Abstract. In this paper, we provide a new approach to study undeniable signatures by translating secure digital signatures to secure undeniable signatures so that the existing algorithms can be used. Our mechanism is that any verifier without trapdoor information cannot distinguish whether a message is encoded from Diffie-Hellamn resource D or random resource R while a signer with trapdoor information can distinguish efficiently a codeword which is computed from D or R. We show how our mechanism can be efficiently achieved and provide proofs of security for our schemes in the standard complexity model. We also provide evidences to show that our approach can be applied to construct designated confirmer signatures, designated verifier signatures as well.
|
610
|
A digital signature scheme secure against adaptive chosen-message attacks
– Goldwasser, Micali, et al.
- 1988
|
|
356
|
Undeniable signatures
– Chaum, Antwerpen
|
|
210
|
Efficient identification and signatures for smart cards
– Schnorr
|
|
173
|
Optimal Asymmetric Encryption
– Bellare, Rogaway
- 1994
|
|
161
|
J.-J.Quisquater: A Practical Zero-Knowledge Protocol fitted to Security Microprocessor Minimizing both Transmission and Memory, Proc.of EuroCrypt 88, Springer Verlag LNCS series
– Guillou
|
|
93
|
Key agreement in dynamic peer groups
– Steiner, Tsudik, et al.
- 2000
|
|
79
|
Random oracles in Constantinople: Practical asynchronous Byzantine agreement using cryptography
– Cachin, Kursawe, et al.
- 2000
|
|
60
|
Digital payment systems with passive anonymity-revoking trustees
– Camenisch, Maurer, et al.
- 1996
|
|
56
|
RSAbased undeniable signature
– Gennaro, Krawczyk, et al.
- 1997
|
|
51
|
Distributed provers with applications to undeniable signatures
– Pedersen
- 1991
|
|
20
|
Generic Constructions for Secure and Efficient Confirmer Signature Schemes
– Michels, Stadler
- 1998
|
|
19
|
Confirmer Signature Schemes Secure against Adaptive Adversaries
– Camenisch, Michels
- 2000
|
|
19
|
Assumptions related to discrete logarithms: Why subtleties make a real difference
– Sadeghi, Steiner
- 2001
|
|
18
|
New convertible undeniable signature schemes
– Damg˚ard, Pedersen
|
|
18
|
Impagliazzo R, “Designated verifier proofs and their applications
– Jakobsson, Sako, et al.
- 1996
|
|
15
|
Blackmailing using Undeniable Signatures
– Jakobsson
- 1994
|
|
13
|
RSA-Based Undeniable Signatures for General Moduli
– Galbraith, Mao, et al.
- 2002
|
|
12
|
Interactive Bi-Proof Systems and Undeniable Signature Schemes
– Fujioka, Okamoto, et al.
- 1991
|
|
11
|
Efficient Convertible Undeniable Signature Schemes
– Michels, Stadler
- 1997
|
|
6
|
Birgit Pfitzmann: Cryptographically Strong Undeniable Signatures, Unconditionally Secure for the Signer
– Chaum, Heijst
- 1992
|
|
6
|
Signature scheme based on the Strong RAS assumption
– Cramer, Shoup
- 1999
|
|
4
|
Chaum: Zero-Knowledge Undeniable Signatures; Eurocrypt '90, Abstracts, rhus
– David
- 1990
|
|
3
|
Wallet Databases with Observers. CRYPTO
– Chaum, Pedersen
- 1992
|
|
3
|
An improved scheme of the Gennaro-Krawczyk-Rabin undeniable signature system based on RSA
– Miyazaki
- 2001
|
|
2
|
Breaking generalized Diffie Hellman modulo a composite is no easier than factoring
– Biham, Boneh, et al.
- 1999
|
|
2
|
Yung: Weakness of Undeniable Signature Schemes (Extended Abstract). EUROCRYPT
– Desmedt, M
- 1991
|
|
2
|
Information theoretically and Computationally Secure Key Agreement in Cryptography
– Wolf
- 1999
|
|
2
|
Constructing Committed Signatures From Strong-RSA Assumption
– Zhu
|
|
1
|
Convertible Undeniable Signatures. CRYPTO
– Boyar, Chaum, et al.
- 1990
|
|
1
|
Chaum: Designated Confirmer Signatures
– David
- 1994
|
|
1
|
notes on verifier designated signatures. http:// www.cs.fsu.edu/ desmedt/ lectures/ verifier-designated-signatures.pdf
– Lecture
|
|
1
|
Tal Rabin: RSA-Based Undeniable Signatures. CRYPTO
– Gennaro, Krawczyk
- 1997
|
|
1
|
Wenbo Mao: Invisibility and Anonymity of Undeniable and Confirmer Signatures. CT-RSA 2003
– Galbraith
- 2002
|
|
1
|
Confirmer Signatures and Public-Key Encryption are Equivalent. CRYPTO
– Designated
- 1994
|
|
1
|
and Huaxiong Wang and
– Steinfeld, Bull
|
|
1
|
and Huaxiong Wang and Josef Pieprzyk Efficient Extension of Standard Schnorr/RSA signatures into Universal Designated-Verifier Signatures
– Steinfeld
|
