Designated confirmer signatures revisited

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

Volumn 4392 LNCS, Issue , 2007, Pages 342-361

  Wikström, Douglas ^a  

^a ETH ZURICH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

MATHEMATICAL MODELS; PUBLIC KEY CRYPTOGRAPHY;

DESIGNATED CONFIRMER SIGNATURES; DIFFIE-HELLMAN ASSUMPTION; NON-TRANSFERABILITY;

ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS;

EID: 38049032821     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-70936-7_19     Document Type: Conference Paper

References (23)

1. F. Boudot. Efficient proofs that a committed number lies in an interval. In Advances in Cryptology - Eurocrypt 2000, volume 1807 of Lecture Notes in Computer Science, pages 431-444. Springer Verlag, 2000.
2. J. Camenisch and Markus Michels. Confirmer signature schemes secure against adaptive adversaries. In Advances in Cryptology - Eurocrypt 2000, Lecture Notes in Computer Science, pages 243-258. Springer Verlag, 2000.
3. J. Camensisch and V. Shoup. Practical verifiable encryption and decryption of discrete logarithms. In Advances in Cryptology - Crypto 2003, volume 2729 of Lecture Notes in Computer Science, pages 126-144. Springer Verlag, 2003.
4. D. Chaum. Designated confirmer signatures. In Advances in Cryptology - Eurocrypt '94, volume 950 of Lecture Notes in Computer Science, pages 86-91. Springer Verlag, 1994.
5. D. Chaum and H. van Antwerpen. Undeniable signatures. In Advances in Cryptology - Crypto '89, volume 435 of Lecture Notes in Computer Science, pages 212-216. Springer Verlag, 1990.
6. R. Cramer, I. Damgård, and P. D. MacKenzie. Efficient zero-knowledge proofs of knowledge without intractability assumptions. In Public Key Cryptography - PKC 2000, volume 1751, pages 354-372. Springer Verlag, 2000.
7. R Cramer, I. Damgård, and T. P. Pedersen. Efficient and provable security amplifications. In Security Protocols, International Workshop, Cambridge, United Kingdom, April 10-12, 1996, Proceedings, volume 1189 of Lecture Notes in Computer Science, pages 101-109. Springer, 1996.
8. R. Cramer and V. Shoup. Universal hash proofs and a paradigm for adaptive chosen ciphertext secure public-key encryption. http://homepages.cwi.nl/cramer/ , June 1999.
9. I. Damgård and E. Fujisaki. A statistically-hiding integer commitment scheme based on groups with hidden order. In Advances in Cryptology - Asiacrypt 2002, volume 2501 of Lecture Notes in Computer Science, pages 125-142. Springer Verlag, 2002.
10. W. Diffie and M. E. Hellman. New directions in cryptography. IEEE Transactions on Information Theory, 22(6):644-654, 1976.
11. D. Dolev, C. Dwork, and M. Naor. Non-malleable cryptography. In 23rd ACM Symposium on the Theory of Computing (STOC), pages 542-552. ACM Press, 1991.
12. E. Fujisaki and T. Okamoto. Statistical zero knowledge protocols to prove modular polynomial relations. In Advances in Cryptology - Crypto '97, volume 1294 of Lecture Notes in Computer Science, pages 16-30. Springer Verlag, 1997.
13. C. Gentry, D. Molnar, and Z. Ramzan. Efficient designated confirmer signatures without random oracles or zero-knowledge proofs (extended abstract). In Advances in Cryptology - Asiacrypt 2005, volume 3788 of Lecture Notes in Computer Science, pages 662-681. Springer Verlag, 2005.
14. O. Goldreich. A uniform-complexity treatment of encryption and zeroknowledge. Journal of Cryptology, 6(1):21-53, 1993.
15. S. Goldwasser, S. Micali, and R. Rivest. A digital signature scheme secure against adaptive chosen-message attacks. SIAM Journal on Computing, 17(2):281-308, 1988.
16. S. Goldwasser and E. Waisbard. Transformation of digital signature schemes into designated confirmer signatures. In 1st Theory of Cryptography Conference (TCC), volume 2951 of Lecture Notes in Computer Science, pages 77-100. Springer Verlag, 2004.
17. M. Jakobsson, K. Sako, and R. Impagliazzo. Designated verifier proofs and their applications. In Advances in Cryptology - Eurocrypt '96, volume 1070 of Lecture Notes in Computer Science, pages 143-154. Springer Verlag, 1996.
18. M. Michels and M. Stadler. Generic constructions for secure and efficient confirmer signature schemes. In Advances in Cryptology - Eurocrypt 1998, volume 1403 of Lecture Notes in Computer Science, pages 406-421. Springer Verlag, 1998.
19. T. Okamoto. Designated confirmer signatures and public key encryption are equivalent. In Advances in Cryptology - Crypto '94, volume 839 of Lecture Notes in Computer Science, pages 61-74. Springer Verlag, 1994.
20. P. Paillier. Public-key cryptosystems based on composite degree residuosity classes. In Advances in Cryptology - Eurocrypt '99, volume 1592 of Lecture Notes in Computer Science, pages 223-238. Springer Verlag, 1999.
21. R. Pass and A. Rosen. New and improved constructions of non-malleable cryptographic protocols. In 37th ACM Symposium on the Theory of Computing (STOC), pages 533-542. ACM Press, 2005.
22. V. Shoup and R. Gennaro. Securing threshold cryptosystems against chosen ciphertext attack. In Advances in Cryptology - Eurocrypt '98, volume 1403 of Lecture Notes in Computer Science, pages 1-16. Springer Verlag, 1998.
23. Douglas Wikström. Designated confirmer signatures revisited. Cryptology ePrint Archive, Report 2006/123, 2006. http://eprint.iacr.org/.