Universal Designated Verifier Signature proof (or how to efficiently prove knowledge of a signature)

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3788 LNCS, Issue , 2005, Pages 644-661

  Baek, Joonsang ^a   Safavi Naini, Reihaneh ^a   Susilo, Willy ^a  

^a UNIVERSITY OF WOLLONGONG   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

DATA PRIVACY; INTERACTIVE COMPUTER SYSTEMS; KNOWLEDGE BASED SYSTEMS; MATHEMATICAL MODELS; NETWORK PROTOCOLS; RANDOM PROCESSES;

INTERACTIVE PROTOCOL; RANDOM ORACLE MODEL; SIGNER'S SECRET KEY; UNIVERSAL DESIGNATED VERIFIER SIGNATURE (UDVS);

ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS;

EID: 33646817427     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11593447_35     Document Type: Conference Paper

References (28)

1. M. Bellare and O. Goldreich, On Defining Proof of Knowledge, In Crypto '92, LNCS 740, pp. 390-420, Springer-Verlag, 1993.
2. M. Bellare and P. Rogaway, Random Oracles are Practical: A Paradigm for Designing Efficient Protocols, In ACM-CCS, pp, 62-73, 1993.
3. M. Bellare and A. Palacio, GQ and Schnorr Identification Schemes: Proofs of Security against Impersonation under Active and Concurrent Attacks, In Crypto '02, LNCS 2442, pp. 162-177, Springer-Verlag, 2002.
4. D. Boneh and M. Franklin, Identity-Based Encryption from the Weil Pairing, In Crypto '01, LNCS 2139, pp. 213-229, Springer-Verlag, 2001.
5. D. Boneh, B. Lynn and H. Shacham, Short Signatures from the Weil Pairing, In Asiacrypt '01, LNCS 2248, pp. 566-582, Springer-Verlag, 2001.
6. D. Boneh, C. Gentry, B. Lynn and H. Shacham, Aggregate and Verifiably Encrypted Signatures from Bilinear Maps, In Eurocrypt '03, LNCS 2656, pp. 416-432, Springer-Verlag, 2003.
7. D. Boneh and X. Boyen, Short Signatures Without Random Oracles, In Eurocrypt '04, LNCS 3027, pp. 56-73, Springer-Verlag, 2004.
8. G. Brassard, D. Chaum and C. Crpeau, Minimum Disclosure Proof of Knowledge, In Journal of Computer and System Sciences, 37 (2), pp. 156-189, 1988.
9. D. Chaum and H. Antwerpen, Undeniable Signatures, In Crypto '89, LNCS 435, pp. 212-216, Springer-Verlag, 1990.
10. J. Camenisch and A. Lysyanskaya, An Efficient System for Non-Transferable Anonymous Credentials with Anonymity Revocation, In Eurocrypt '01, LNCS 2045, pp. 93-118, Springer-Verlag, 2001.
11. J. Camenisch and A. Lysyanskaya, Signature Schemes and Anonymous Credentials from Bilinear Maps, In Crypto '04, LNCS 3152, pp. 56-72, Springer-Verlag, 2004.
12. Y. Desmedt, C. Gourtier and S. Bengio, Special Uses and Abuses of the Fiat-Shamir Passport Protocol, In Crypto '87, LNCS 293, pp. 21-39, Springer-Verlag, 1988.
13. U. Feige and A. Shamir, Witness Indistinguishability and Witness Hiding Protocols, In 22nd Symposium on the Theory of Computing (STOC), pp. 416-426, ACM, 1990.
14. S. Goldwasser, S. Micali and R. Rivest, A Digital Signature Scheme Secure Against Adaptive Chosen- Message Attack, In SIAM Journal on Computing, 17 (2), pp. 281-308, 1988.
15. S. Goldwasser, S. Micali and C. Rackoff, The Knowledge Complexity of Interactive Proof System, In SIAM Journal on Computing, 18 (1), pp. 186-208, 1989.
16. M. Jakobsson, Blackmailing Using Undeniable Signatures, In Eurocrypt "94, LNCS 950, pp. 425-427, Springer-Verlag, 1994.
17. M. Jakobsson, K. Sako and R. Impagliazzo, Designated Verifier Proofs and Their Applications, In Eurocrypt '96, LNCS 1070, pp. 143-154, Springer-Verlag, 1996.
18. A. Joux: The Weil and Tate Pairings as Building Blocks for Public Key Cryptosysttms, Algorithmic Number Theory Symposium (ANTS-V) '02, LNCS 2369, pp. 20-32, Springer-Verlag, 2002.
19. H. Krawczyk and T. Rabin, Chameleon Hashing and Signatures, Network and Distributed System Security Symposium (NDSS) '00, pp. 143 - 154, The Internet Society, 2000.
20. A. Lysyanskaya, R. Rivest, A. Sahai and S. Wolf Pseudonym Systems, In Selected Areas in Cryptography (SAC) '99, LNCS 1758, pp. 184-199, Springer-Verlag, 1999.
21. M. Naor, Deniable Ring Authentication, In Crypto '02, LNCS 2442, pp. 481-198, Springer-Verlag, 2002.
22. W. Ogata, K. Kurosawa and S. Heng, The Security of the FDH Variant of Chaum's Undeniable Signature Scheme, In Public Key Cryptography (PKC) '05, LNCS 3386, pp. 328-345, Springer-Verlag, 2005.
23. C. P. Schnorr, Efficient Identifications and Signatures for Smart Cards, In Crypto '89, LNCS 435, pp. 239-251, Springer-Verlag, 1990.
24. R. Rivest, A. Shamir and Y. Tauman, How to Leak a Secret, In Asiacrypt '01, LNCS 2248, pp. 552 - 565, Springer-Verlag, 2001.
25. R. Steinfeld, L. Bull, H. Wang and J. Pieprzyk, Universal Designated-Verifier Signatures, In Asiacrypt '03, LNCS 2894, pp. 523-542, Springer-Verlag, 2003.
26. R. Steinfeld, H. Wang and J. Pieprzyk, Efficient Extension of Standard Schnorr/RSA Signatures into Universal Designated-Verifier Signatures, In Public Key Cryptography (PKC) '04, LNCS 2947, pp. 86-100, Springer-Verlag, 2004.
27. W. Susilo and Y. Mu, Deniable Ring Authentication Revisited, In Applied Cryptography and Network Security (ACNS) '04, LNCS 3089, pp. 149-163, Springer-Verlag, 2004.
28. R. Zhang, J. Furukawa and H. Imai, Short signature and Universal Designated Verifier Signature without Random Oracles, In Applied Cryptography and Network Security (ACNS) '05, LNCS 3531, pp. 483-498, Springer-Verlag, 2005.