Universal custodian-hiding verifiable encryption for discrete logarithms

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

Volumn 3935 LNCS, Issue , 2006, Pages 389-409

  Liu, Joseph K ^a   Tsang, Patrick P ^b   Wong, Duncan S ^c   Zhu, Robert W ^c  

^a UNIVERSITY OF BRISTOL   (United Kingdom)

^b Dartmouth Department of Computer Science_Dartmouth College   (United States)

^c CITY UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHY; INFORMATION ANALYSIS; SECURITY SYSTEMS;

CUSTODIAN-HIDING; DISCRETE LOGARITHMS; UNIVERSAL CUSTODIAN-HIDING VERIFIABLE ENCRYPTION (UCH-VE);

DATA PRIVACY;

EID: 33745853424     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11734727_31     Document Type: Conference Paper

References (15)

1. N. Asokan, V. Shoup, and M. Waidner. Optimistic fair exchange of digital signatures. In Proc. EUROCRYPT 98, pages 591-606. Springer-Verlag, 1998. LNCS Vol. 1403.
2. F. Bao. An efficient verifiable encryption scheme for encryption of discrete logarithms. In Proc. Smart Card Research and Applications (CARDIS) 1998, pages 213-220. Springer-Verlag, 2000. LNCS Vol. 1820.
3. M. Bellare, A. Boldyreva, A. Desai, and D. Pointcheval. Key-privacy in public-key encryption. In Proc. ASIACRYPT 2001, pages 566-582. Springer-Verlag, 2001. LNCS Vol. 2248.
4. M. Bellare, R. Canetti, and H. Krawczyk. Keying hash functions for message authentication. In Proc. CRYPTO 96, pages 1-15. Springer-Verlag, 1996. LNCS Vol. 1109.
5. M. Bellare and P. Rogaway. Random oracles are practical: A paradigm for designing efficient protocols. In Proc. 1st ACM Conference on Computer and Communications Security, pages 62-73. ACM Press, 1993.
6. J. Camenisch and I. Damgård. Verifiable encryption, group encryption, and their applications to separable group signatures and signature sharing schemes. In Proc. ASIACRYPT 2000, pages 331-345. Springer-Verlag, 2000. LNCS Vol. 1976.
7. J. Camenisch and A. Lysyanskaya. An efficient system for non-transferable anonymous credentials with optional anonymity revocations. In Proc. EUROCRYPT 2001, pages 93-118. Springer-Verlag, 2001. LNCS Vol. 2045.
8. J. Camenisch and V. Shoup. Practical verifiable encryption and decryption of discrete logarithms, http://eprint.iacr.org/2002/161/, 2002.
9. J. Camenisch and V. Shoup. Practical verifiable encryption and decryption of discrete logarithms. In Proc. CRYPTO 2003, pages 126-144. Springer-Verlag, 2003. LNCS Vol. 2729.
10. R. Canetti and S. Goldwasser. An efficient threshold public key cryptosystem secure against adaptive chosen ciphertext attack. In Proc. EUROCRYPT 99, pages 90-106. Springer-Verlag, 1999. LNCS Vol. 1592.
11. Y. Desmedt and Y. Frankel. Threshold cryptosystem. In Proc. CRYPTO 89, pages 307-315. Springer-Verlag, 1989. LNCS Vol. 435.
12. J. Liu, V. Wei, and D. Wong. Custodian-hiding verifiable encryption. In WISA 2004, pages 54-67. Springer-Verlag, 2004. LNCS Vol. 3325.
13. C. Rackoff and D. R. Simon. Non-interactive zero-knowledge proof of knowledge and chosen ciphertext attack. In Proc. CRYPTO 91, pages 433-444. Springer, 1992. LNCS Vol. 576.
14. V. Shoup and R. Gennaro. Securing threshold cryptosystems against chosen ciphertext attack. In Proc. EUROCRYPT 98, pages 1-16. Springer-Verlag, 1998. LNCS Vol. 1403.
15. M. Stadler. Publicly verifiable secret sharing. In Proc. EUROCRYPT 96, pages 191-199. Springer-Verlag, 1996. LNCS Vol. 1070.