Adaptively secure feldman vss and applications to universally-composable threshold cryptography

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

Volumn 3152, Issue , 2004, Pages 317-334

  Abe, Masayuki ^a   Fehr, Serge ^b  

^a NTT CORPORATION   (Japan)

^b CWI   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

AUTHENTICATION; CRYPTOGRAPHY; NETWORK SECURITY;

ADAPTIVE SECURITY; ARBITRARY COMPOSITIONS; ENCRYPTION SCHEMES; KEY GENERATION PROTOCOLS; SCHNORR SIGNATURE SCHEME; THRESHOLD CRYPTOGRAPHY; UNIVERSALLY COMPOSABLE; ZERO KNOWLEDGE PROOF;

MOBILE SECURITY;

EID: 33646833311     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-28628-8_20     Document Type: Article

References (16)

1. M. Abe. Robust distributed multiplication without interaction. In M. Wiener, editor, Advances in Cryptology -CRYPTO '99, volume 1666 of Lecture Notes in Computer Science, pages 130-147. Springer-Verlag, 1999.
2. M. Abe, R. Cramer, and S. Fehr. Non-interactive distributed-verifier proofs and proving relations among commitments. In Y. Zheng, editor, Advances in Cryptology - ASIACRYPT '02, volume 2501 of Lecture Notes in Computer Science, pages 206-223. Springer-Verlag, 2002.
3. M. Abe and S. Fehr. Adaptively secure Feldman VSS and applications to universally-coraposable threshold cryptography. In Cryptology ePrint Archive, Report 2004/119, 2004. http://eprint.iacr.org.
4. R. Canetti. Universally composable security: A new paradigm for cryptographic protocols. In Proceedings of the 42nd IEEE Annual Symposium on Foundations of Computer Science, pages 136-145, 2001.
5. R. Canetti. On universally composable notions of security for signature, certification and authentication. In Cryptology ePrint Archive, Report 2003/239, 2003. http://eprint.iacr.org.
6. R. Canetti, U. Feige, O. Goldreich, and M. Naor. Adaptively secure multi-party computation. In Proceedings of the 28th annual ACM Symposium on the Theory of Computing, pages 639-648, 1996.
7. R. Canetti, R. Gennaro, S. Jarecki, H. Krawczyk, and T. Rabin. Adaptive security for threshold cryptosystems. In M. Wiener, editor, Advances in Cryptology CRYPTO '99, volume 1666 of Lecture Notes in Computer Science, pages 98-115. Springer-Verlag, 1999.
8. R. Canetti and T. Rabin. Universal composition with joint state. In Cryptology ePrint Archive, Report 2003/047, 2002. http://eprint.iacr.org.
9. I. Damgård and J. Nielsen. Improved non-committing encryption schemes based on a general complexity assumption. In M. Bellare, editor, Advances in Cryptology CRYPTO 2000, volume 1880 of Lecture Notes in Computer Science, pages 432-450. Springer-Verlag, 2000.
10. P. Feldman. A practical scheme for non-interactive verifiable secret sharing. In Proceedings of the 28th IEEE Annual Symposium on Foundations of Computer Science, pages 427-437, 1987.
11. Y. Frankel, P. D. MacKenzie, and M. Yung. Adaptively-secure distributed publickey systems. In J. Nesetril, editor, European Symposium on Algorithms (ESA '99), volume 1643 of Lecture Notes in Computer Science, pages 4-27. Springer-Verlag, 1998.
12. R. Gennaro, S. Jarecki, H. Krawczyk, and T. Rabin. Secure distributed key generation for discrete-log based cryptosystems. In J. Stern, editor, Advances in Cryptology - EUROCRYPT '99, volume 1592 of Lecture Notes in Computer Science, pages 295-310. Springer-Verlag, 1999.
13. S. Jarecki and A. Lysyanskaya. Adaptively secure threshold cryptography: Introducing concurrency, removing erasures (extended abstract). In B. Preneel, editor, Advances in Cryptology - EUROCRYPT 2000, volume 1807 of Lecture Notes in Computer Science, pages 221-242. Springer-Verlag, 2000.
14. T. P. Pedersen. A threshold cryptosystem without a trusted party. In D. W. Davies, editor, Advances in Cryptology - EUROCRYPT '91, volume 547 of Lecture Notes in Computer Science, pages 522-526. Springer-Verlag, 1991.
15. C. P. Schnorr. Efficient signature generation for smart cards. Journal of Cryptology, 4(3):239-252, 1991.
16. D. Wikström. A universally composable mix-net. In Proceedings of the First Theory of Cryptography Conference (TCC'04), volume 2951 of Lecture Notes in Computer Science, pages 315-335. Springer-Verlag, 2004.