Identity-based threshold signature scheme from the bilinear pairings (extended abstract)

International Conference on Information Technology: Coding Computing, ITCC

Volumn 1, Issue , 2004, Pages 124-128

  Baek, Joonsang ^a   Zheng, Yuliang ^b  

^a MONASH UNIVERSITY   (Australia)

^b UNIVERSITY OF NORTH CAROLINA AT CHARLOTTE   (United States)

Author keywords

Bilinear Pairing; Chosen message attack; Generalized Bilinear Problem; Identity based threshold signature; Verifiable secret sharing

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; ELECTRONIC MAIL; INVERSE PROBLEMS; SECURITY OF DATA; SERVERS;

BILINEAR PAIRING; CHOSEN MESSAGE ATTACK; GENERALIZED BILINEAR PROBLEM; IDENTITY-BASED THRESHOLD SIGNATURE; VERIFIABLE SECRET-SHARING;

ABSTRACTING;

EID: 3042597451     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (15)

1. J. Baek and, Y. Zheng, "Identity-Based Threshold Decryption", to appear in Proc. of PKC 2004.
2. J. Baek and, Y. Zheng, "Identity-Based Threshold Signature Scheme from the Bilinear Pairings", full version, available at http://phd.netcomp.monash.edu.au/joonsang.
3. M. Bellare and P. Rogaway, "Random Oracles are Practical: A Paradigm for Designing Efficient Protocols", Proc. of the First ACM CCCS, pp 62-73, ACM Press, 1993.
4. D. Boneh and M. Franklin, "Identity-Based Encryption from the Weil Pairing", Proc. of CRYPTO 2001, LNCS 2139, pp 213-229, Springer-Verlag, 2001.
5. M. Cerecedo, M. Matsumoto and H. Imai, "Efficient and Secure Multiparty Generation of Digital Signatures Based on Discrete Logarithms", IEICE Trans. Fundamentals., Vol. E76-A, pp 532-545,1IEICE, 1993.
6. J. Cha and J. Cheon, "An Identity-Based Signature from Gap Diffie-Hellman Groups", Proc. of PKC 2003, LNCS 2567, pp 18-30, Springer-Verlag, 2003.
7. P. Feldman, "A Practical Scheme for Non-Interactive Verifiable Secret Sharing", Proc. of the FOCS, pp 427-437, IEEE, 1987.
8. R. Gennaro, S. Jarecki, H. Krawczyk and T. Rabin, "Robust Threshold DSS Signatures", Proc. of EUROCRYPT '96, LNCS 1070, pp 354-371, Springer-Verlag, 1996.
9. R. Gennaro, S. Jarecki, H. Krawczyk and T. Rabin, "Secure Distributed Key Generation for Discrete-Log Based Cryptosystem", Proc. of EUROCRYPT '99, LNCS 1592, pp 295-310, Springer-Verlag, 1999.
10. S. Goldwasser, S. Micali and R. Rivest, "A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks", SIAM Journal on Computing, 17, 2, pp 281-308, 1988.
11. F. Hess, "Efficient Identity Based Signature Schemes Based on Pairings", Proc. of SAC 2002, LNCS 2595, pp 310-324, Springer-Verlag, 2002.
12. A. Joux, "The Weil and Tate Pairings as Building Blocks for Public Key Cryptosystems", Proc. of ANTS-V, LNCS 2369, pp 20-32, Springer-Verlag, 2002.
13. T. P. Pedersen, "Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing", Proc. of EUROCRYPT '91, LNCS 576, pp 129-140, Springer-Verlag,1992.
14. A. Shamir, "How to Share a Secret", Communications of the ACM, Vol. 22, pp 612-613, 1979.
15. A. Shamir, "Identity-based Cryptosystems and Signature Schemes", Proc. of CRYPTO '84, LNCS 196, pp 47-53, Springer-Verlag, 1984.