IEICE TRANSACTIONS on Fundamentals
Efficient Threshold Signer-Ambiguous Signatures from Variety of Keys
Summary :
This paper presents an efficient and generic solution in the following scenario: There are n independent people using variety of signature schemes such as DSS, RSA, Schnorr, and so on, and a subset of them attempts to sign a document without being identified which subset they are. This is a generalized scenario of the Ring Signatures by Rivest, Shamir and Tauman, whose original scenario limits the subset to be a single person and the base signature scheme to be RSA/Rabin schemes. Our scheme allows any signature schemes based on sigma-protocols and claw-free permutations. It also offers shorter signatures and less computation compared to known generic construction. The security is argued in the random oracle model as well as previous schemes and shows that our scheme achieves reduction cost linear in the number of hash queries while it is square for previous generic constructions.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E87-A No.2 pp.471-479
- Publication Date
- 2004/02/01
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- PAPER
- Category
- Information Security
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
Masayuki ABE, Miyako OHKUBO, Koutarou SUZUKI, "Efficient Threshold Signer-Ambiguous Signatures from Variety of Keys" in IEICE TRANSACTIONS on Fundamentals,
vol. E87-A, no. 2, pp. 471-479, February 2004, doi: .
Abstract: This paper presents an efficient and generic solution in the following scenario: There are n independent people using variety of signature schemes such as DSS, RSA, Schnorr, and so on, and a subset of them attempts to sign a document without being identified which subset they are. This is a generalized scenario of the Ring Signatures by Rivest, Shamir and Tauman, whose original scenario limits the subset to be a single person and the base signature scheme to be RSA/Rabin schemes. Our scheme allows any signature schemes based on sigma-protocols and claw-free permutations. It also offers shorter signatures and less computation compared to known generic construction. The security is argued in the random oracle model as well as previous schemes and shows that our scheme achieves reduction cost linear in the number of hash queries while it is square for previous generic constructions.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e87-a_2_471/_p
Copy
@ARTICLE{e87-a_2_471,
author={Masayuki ABE, Miyako OHKUBO, Koutarou SUZUKI, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Efficient Threshold Signer-Ambiguous Signatures from Variety of Keys},
year={2004},
volume={E87-A},
number={2},
pages={471-479},
abstract={This paper presents an efficient and generic solution in the following scenario: There are n independent people using variety of signature schemes such as DSS, RSA, Schnorr, and so on, and a subset of them attempts to sign a document without being identified which subset they are. This is a generalized scenario of the Ring Signatures by Rivest, Shamir and Tauman, whose original scenario limits the subset to be a single person and the base signature scheme to be RSA/Rabin schemes. Our scheme allows any signature schemes based on sigma-protocols and claw-free permutations. It also offers shorter signatures and less computation compared to known generic construction. The security is argued in the random oracle model as well as previous schemes and shows that our scheme achieves reduction cost linear in the number of hash queries while it is square for previous generic constructions.},
keywords={},
doi={},
ISSN={},
month={February},}
Copy
TY - JOUR
TI - Efficient Threshold Signer-Ambiguous Signatures from Variety of Keys
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 471
EP - 479
AU - Masayuki ABE
AU - Miyako OHKUBO
AU - Koutarou SUZUKI
PY - 2004
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E87-A
IS - 2
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - February 2004
AB - This paper presents an efficient and generic solution in the following scenario: There are n independent people using variety of signature schemes such as DSS, RSA, Schnorr, and so on, and a subset of them attempts to sign a document without being identified which subset they are. This is a generalized scenario of the Ring Signatures by Rivest, Shamir and Tauman, whose original scenario limits the subset to be a single person and the base signature scheme to be RSA/Rabin schemes. Our scheme allows any signature schemes based on sigma-protocols and claw-free permutations. It also offers shorter signatures and less computation compared to known generic construction. The security is argued in the random oracle model as well as previous schemes and shows that our scheme achieves reduction cost linear in the number of hash queries while it is square for previous generic constructions.
ER -
English
