Gradually convertible undeniable signatures (Michels-Petersen-Horster convertible undeniable signatures revisited)

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

Volumn 4521 LNCS, Issue , 2007, Pages 478-496

  El Aimani, Laila ^a   Vergnaud, Damien ^a  

^a Rheinische Friedrich Wilhelms Universität   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

AUTHENTICATION; COMPUTER CRIME; MATHEMATICAL MODELS; NETWORK PROTOCOLS; NETWORK SECURITY; SECURITY SYSTEMS;

FORMAL SECURITY ANALYSIS; FORMAL SECURITY TREATMENT; GENERIC GROUP MODELS; SELF-AUTHENTICATING PROPERTY;

ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS;

EID: 38049054353     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-72738-5_31     Document Type: Conference Paper

References (21)

1. M. Bellare, A. Boldyreva, A. Desai, and D. Pointcheval, Key-Privacy in Public-Key Encryption., Advances in Cryptology - ASIACRYPT 2001 (C. Boyd, ed.), Lect. Notes Comput. Sci., vol. 2248, Springer, 2001, pp. 566-582.
2. M. Bellare and T. Kohno, Hash Function Balance and its Impact on Birthday Attacks., Advances in Cryptology - EUROCRYPT 2004 (C. Cachin and J. Camenisch, eds.), Lect. Notes Comput. Sci., vol. 3027, Springer, 2004, pp. 401-418.
3. M. Bellare and P. Rogaway, Random Oracles are Practical: A Paradigm for Design-ing Efficient Protocols., Proceedings of the First ACM Conference on Computer and Communications Security (D. Denning, R. Pyle, R. Ganesan, R. Sandhu, and V. Ashby, eds.), ACM Press, 1993, pp. 62-73.
4. J. Boyar, D. Chaum, I. B. Damgård, and T. B. Pedersen, Convertible undeniable signatures., Advances in Cryptology - CRYPTO'90 (A. J. Menezes and S. A. Vanstone, eds.), Lect. Notes Comput. Sci., vol. 537, Springer, 1991, pp. 189-205.
5. D. R. L. Brown, Generic Groups, Collision Resistance, and ECDSA., Des. Codes Cryptography 35 (2005), no. 1, 119-152.
6. J. Camenisch and V. Shoup, Practical Verifiable Encryption and Decryption of Discrete Logarithms., Advances in Cryptology - CRYPTO 2003 (D. Boneh, ed.), Lect. Notes Comput. Sci., vol. 2729, Springer, 2003, pp. 126-144.
7. D. Chaum and H. van Antwerpen, Undeniable Signatures., Advances in Cryptology - CRYPTO'89 (G. Brassard, ed.), Lect. Notes Comput. Sci., vol. 435, Springer, 1990, pp. 212-216.
8. A. W. Dent, Adapting the Weaknesses of the Random Oracle Model to the Generic Group Model, Advances in Cryptology - ASIACRYPT 2002 (Y. Zheng, ed.), Lect. Notes Comput. Sci., vol. 2501, Springer, 2002, pp. 100-109.
9. S. D. Galbraith and W. Mao, Invisibility and Anonymity of Undeniable and Confirmer Signatures., Topics in Cryptology - CT-RSA 2003 (M. Joye, ed.), Lect. Notes Comput. Sci., vol. 2612, Springer, 2003, pp. 80-97.
10. S. Goldwasser, S. Micali, and R. L. Rivest, A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks., SIAM J. Comput. 17 (1988), no. 2, 281-308.
11. M. Jakobsson, K. Sako, and R. Impagliazzo, Designated Verifier Proofs and Their Applications., Advances in Cryptology - EUROCRYPT'96 (U. M. Maurer, ed.), Lect. Notes Comput. Sci., vol. 1070, Springer, 1996, pp. 143-154.
12. C. Kudla and K. G. Paterson, Non-interactive Designated Verifier Proofs and Undeniable Signatures., Cryptography and Coding, 10th IMA International Conference (N. P. Smart, ed.), Lect. Notes Comput. Sci., vol. 3796, Springer, 2005, pp. 136-154.
13. F. Laguillaumie and D. Vergnaud, Time-Selective Convertible Undeniable Signatures., Topics in Cryptology - CT-RSA 2005 (A. J. Menezes, ed.), Lect. Notes Comput. Sci., vol. 3376, Springer, 2005, pp. 154-171.
14. M. Michels, H. Petersen, and P. Horster, Breaking and Repairing a Convertible Undeniable Signature Scheme., Proceedings of the Third ACM Conference on Computer and Communications Security (L. Gong and J. Stern, eds.), ACM Press, 1996, pp. 148-152.
15. W. Ogata, K. Kurosawa, and S.-H. Heng, The Security of the FDH Variant of Chaum's Undeniable Signature Scheme, IEEE Trans. Inf. Theory 52 (2006), no. 5, 2006-2017.
16. T. Okamoto and D. Pointcheval, The Gap-Problems: a New Class of Problems for the Security of Cryptographic Schemes., 4th International Workshop on Practice and Theory in Public Key Cryptography, PKC 2001 (K. Kim, ed.), Lect. Notes Comput. Sci., vol. 1992, Springer, 2001, pp. 104-118.
17. P. Paillier and D. Vergnaud, Discrete-Log Based Signatures May Not Be Equivalent to Discrete-Log., Advances in Cryptology - ASIACRYPT 2005 (B. Roy, ed.), Lect. Notes Comput. Sci., vol. 3788, Springer, 2005, pp. 1-20.
18. P. Rogaway and T. Shrimpton, Cryptographic Hash-Function Basics: Definitions, Implications, and Separations for Preimage Resistance, Second-Preimage Resistance, and Collision Resistance., Fast Software Encryption, 11th International Workshop, FSE 2004 (B. K. Roy and W. Meier, eds.), Lect. Notes Comput. Sci., vol. 3017, Springer, 2004, pp. 371-388.
19. V. Shoup, Lower Bounds for Discrete Logarithms and Related Problems., Advances in Cryptology - EUROCRYPT'97 (W. Fumy, ed.), Lect. Notes Comput. Sci., vol. 1233, Springer, 1997, pp. 256-266.
20. W. Stadje, The Residues modulo m of Products of Random Integers., Comb. Probab. Comput. 11 (2002), no. 5, 529-540.
21. J. Stern, D. Pointcheval, J. Malone-Lee, and N. P. Smart, Flaws in applying proof methodologies to signature schemes., Advances in Cryptology - CRYPTO 2002 (M. Yung, ed.), Lect. Notes Comput. Sci., vol. 2442, Springer, 2002, pp. 93-110.