IEICE TRANSACTIONS on Fundamentals
Undeniable and Unpretendable Signatures
Summary :
Undeniable signature, and unpretendable signature schemes have been studied independently. In this paper, efficient schemes which serve as both at the same time are presented. The schemes find their typical application in anonymous auction where the winner cannot deny her bid; nobody can pretend to be the winner; and the anonymity of all losers is preserved. The security of the schemes is proved in the common reference string model under discrete logarithm type assumptions.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E95-A No.1 pp.138-150
- Publication Date
- 2012/01/01
- Publicized
- Online ISSN
- 1745-1337
- DOI
- 10.1587/transfun.E95.A.138
- Type of Manuscript
- Special Section PAPER (Special Section on Cryptography and Information Security)
- Category
- Authentication
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Le Trieu PHONG, Kaoru KUROSAWA, Wakaha OGATA, "Undeniable and Unpretendable Signatures" in IEICE TRANSACTIONS on Fundamentals,
vol. E95-A, no. 1, pp. 138-150, January 2012, doi: 10.1587/transfun.E95.A.138.
Abstract: Undeniable signature, and unpretendable signature schemes have been studied independently. In this paper, efficient schemes which serve as both at the same time are presented. The schemes find their typical application in anonymous auction where the winner cannot deny her bid; nobody can pretend to be the winner; and the anonymity of all losers is preserved. The security of the schemes is proved in the common reference string model under discrete logarithm type assumptions.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E95.A.138/_p
Copy
@ARTICLE{e95-a_1_138,
author={Le Trieu PHONG, Kaoru KUROSAWA, Wakaha OGATA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Undeniable and Unpretendable Signatures},
year={2012},
volume={E95-A},
number={1},
pages={138-150},
abstract={Undeniable signature, and unpretendable signature schemes have been studied independently. In this paper, efficient schemes which serve as both at the same time are presented. The schemes find their typical application in anonymous auction where the winner cannot deny her bid; nobody can pretend to be the winner; and the anonymity of all losers is preserved. The security of the schemes is proved in the common reference string model under discrete logarithm type assumptions.},
keywords={},
doi={10.1587/transfun.E95.A.138},
ISSN={1745-1337},
month={January},}
Copy
TY - JOUR
TI - Undeniable and Unpretendable Signatures
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 138
EP - 150
AU - Le Trieu PHONG
AU - Kaoru KUROSAWA
AU - Wakaha OGATA
PY - 2012
DO - 10.1587/transfun.E95.A.138
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E95-A
IS - 1
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - January 2012
AB - Undeniable signature, and unpretendable signature schemes have been studied independently. In this paper, efficient schemes which serve as both at the same time are presented. The schemes find their typical application in anonymous auction where the winner cannot deny her bid; nobody can pretend to be the winner; and the anonymity of all losers is preserved. The security of the schemes is proved in the common reference string model under discrete logarithm type assumptions.
ER -
English
