Efficient Threshold Signer-Ambiguous Signatures from Variety of Keys(Information Security)
スポンサーリンク
概要
- 論文の詳細を見る
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.
- 社団法人電子情報通信学会の論文
- 2004-02-01
著者
関連論文
- A Length-invariant Hybrid Mix(Special Section on Fundamentals of Information and Communications)
- Efficient Threshold Signer-Ambiguous Signatures from Variety of Keys(Information Security)
- Permutation Network with Arbitiary Number of Inputs and Its Application to Mix-Net(Special Section on Cryptography and Information Security)