Practical threshold signatures without random oracles

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

Volumn 4784 LNCS, Issue , 2007, Pages 198-207

  Li, Jin ^a   Yuen, Tsz Hon ^b   Kim, Kwangjo ^a  

^a Korea Advanced Institute of Science and Technology (KAIST)   (South Korea)

^b UNIVERSITY OF WOLLONGONG   (Australia)

Author keywords

Bilinear groups; CDH problem; Threshold signature

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES; INTERACTIVE COMPUTER SYSTEMS; PROBLEM SOLVING; RANDOM PROCESSES;

BILINEAR GROUPS; COMPUTATIONAL DIFFIE-HELLMAN (CDH) PROBLEM; RANDOM ORACLES; THRESHOLD SIGNATURES;

ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS;

EID: 38149090152     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-75670-5_14     Document Type: Conference Paper

References (14)

1. Abe, M., Fehr, S.: Adaptively secure Feldman VSS and applications to universally-composable threshold cryptography. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol. 3152, pp. 317-334. Springer, Heidelberg (2004)
2. Bellare, M., Boldyreva, A., Palacio, A.: An Uninstantiable Random-Oracle-Model Scheme for a Hybrid-Encryption Problem. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 171-188. Springer, Heidelberg (2004)
3. Boneh, D., Boyen, X., Halevi, S.: Chosen ciphertext secure public key threshold encryption without random oracles. In: Pointcheval, D. (ed.) CT-RSA 2006. LNCS, vol. 3860, pp. 226-243. Springer, Heidelberg (2006)
4. Canetti, R., Gennaro, R., Jarecki, S., Krawczyk, H., Rabin, T.: Adaptive security for threshold cryptosystems. In: Wiener, M.J. (ed.) CRYPTO 1999. LNCS, vol. 1666, pp. 98-115. Springer, Heidelberg (1999)
5. Desmedt, Y., Frankel, Y.: Threshold cryptosystems. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 307-315. Springer, Heidelberg (1990)
6. Feldman, P.: A Practical Scheme for Non-Interactive Verifiable Secret Sharing. In: Proc. 28th FOCS, pp. 427-437.
7. Gennaro, R., Jarecki, S., Krawczyk, H., Rabin, T.: Secure Distributed Key Generation for Discrete-Log Based Cryptosystem, In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 295-310. Springer, Heidelberg (1999)
8. Gennaro, R., Jarecki, S., Krawczyk, H., Rabin, T.: Robust threshold DSS signatures. Information and Computation 164(1), 54-64 (1996)
9. Pedersen, T.: A threshold cryptosystem without a trusted party. In: Davies, D.W. (ed.) EUROCRYPT 1991. LNCS, vol. 547, pp. 522-536. Springer, Heidelberg (1991)
10. Pedersen, T.: Non-interactive and information-theoretic secure verifiable secret sharing. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol. 576, pp. 129-140. Springer, Heidelberg (1992)
11. Shamir, A.: How to Share a Secret. Communications of the ACM 22, 612-613 (1979)
12. Shoup, V., Gennaro, R.: Securing Threshold Cryptosystems against Chosen Ciphertext Attack. Journal of Cryptology 15, 75-96 (2002)
13. Wang, H., Zhang, Y., Feng, D.: Short Threshold Signature Schemes Without Random Oracles. In: Maitra, S., Madhavan, C.E.V., Venkatesan, R. (eds.) INDOCRYPT 2005. LNCS, vol. 3797, pp. 297-310. Springer, Heidelberg (2005)
14. Waters, B.: Efficient Identity based Encryption without random oracles. In: Cramer, R.J.F. (ed.) EUROCRYPT 2005. LNCS, vol. 3494, pp. 114-127. Springer, Heidelberg (2005)