A threshold GQ signature scheme

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

Volumn 2846, Issue , 2003, Pages 137-150

  Liu, Li Shan ^a   Chu, Cheng Kang ^a   Tzeng, Wen Guey ^a  

^a NATIONAL CHIAO TUNG UNIVERSITY   (Taiwan)

Author keywords

GQ signature scheme; Thershold signature scheme

Indexed keywords

AUTHENTICATION; CRYPTOGRAPHY;

ADAPTIVE ADVERSARY; CHOSEN MESSAGE ATTACKS; DISCRETE LOGARITHM MODULO; OPTIMAL RESILIENCE; SAFE PRIMES; SIGNATURE SCHEME; THRESHOLD SIGNATURE SCHEMES;

NETWORK SECURITY;

EID: 0242310003     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45203-4_11     Document Type: Article

References (25)

1. Ran Canetti, Uriel Feige, Oded Goldreich, and Moni Naor. Adaptively secure multi-party computation. In Proceedings of the 28th Annual ACM Symposium on the Theory of Computing (STOC '96), pages 639-648. ACM, 1996.
2. Ran Canetti, Rosario Gennaro, Stanislaw Jarecki, Hugo Krawczyk, and Tal Rabin. Adaptive security for threshold cryptosystems. In Proceedings of Advances in Cryptology - CRYPTO '99, volume 1666 of LNCS, pages 98-115. Springer-Verlag, 1999.
3. Manuel Cerecedo, Tsutomu Matsumoto, and Hideki Imai. Efficient and secure multiparty generation of digital signatures based on discrete logarithms. IEICE Trans. Fundamentals, E76-A(4):532-545, 1993.
4. Yvo Desmedt. Society and group oriented cryptography: A new concept. In Proceedings of Advances in Cryptology - CRYPTO '87, volume 293 of LNCS, pages 120-127. Springer-Verlag, 1987.
5. Yvo Desmedt and Yair Frankel. Shared generation of authenticators and signatures. In Proceedings of Advances in Cryptology - CRYPTO '91, volume 576 of LNCS, pages 457-469. Springer-Verlag, 1991.
6. Olivier Delos and Jean-Jacques Quisquater. An identity-based signature scheme with bounded life-span. In Proceedings of Advances in Cryptology - CRYPTO '94, volume 839 of LNCS, pages 83-94. Springer-Verlag, 1994.
7. Yair Frankel and Yvo Desmedt. Parallel reliable threshold multisignature. Technical Report TR-92-04-02, Dept. of EE and CS, U. of Winsconsin, April 1992.
8. Yair Frankel, Peter Gemmell, Philip D. MacKenzie, and Moti Yung. Optimal-resilience proactive public-key cryptosystems. In Proceedings of 38th Annual Symposium on Foundations of Computer Science (FOCS '97), pages 384-393. IEEE, 1997.
9. Yair Frankel, Peter Gemmell, and Moti Yung. Witness-based cryptographic program checking and robust function sharing. In Proceedings of the 28th Annual ACM Symposium on the Theory of Computing (STOC '96), pages 499-508. ACM, 1996.
10. Yair Frankel, Philip D. MacKenzie, and Moti Yung. Robust efficient distributed rsa-key generation. In Proceedings of the 30th Annual ACM Symposium on the Theory of Computing (STOC '98), pages 663-672. ACM, 1998.
11. Yair Frankel, Philip D. MacKenzie, and Moti Yung. Adaptively-secure distributed public-key systems. In Proceedings of 7th Annual European Symposium on Algorithms (ESA '99), volume 1643 of LNCS, pages 4-27. Springer-Verlag, 1999.
12. Yair Frankel, Philip D. MacKenzie, and Moti Yung. Adaptively-secure optimal-resilience proactive rsa. In Proceedings of Advances in Cryptology - ASIACRYPT '99, volume 1716 of LNCS, pages 180-194. Springer-Verlag, 1999.
13. Amos Fiat and Adi Shamir. How to prove yourself: Practical solutions to identification and signature problems. In Proceedings of Advances in Cryptology - CRYPTO '86, volume 263 of LNCS, pages 186-194. Springer-Verlag, 1986.
14. Rosario Gennaro, Stanislaw Jarecki, Hugo Krawczyk, and Tal Rabin. Robust and efficient sharing of rsa functions. In Proceedings of Advances in Cryptology - CRYPTO '96, volume 1109 of LNCS, pages 157-172. Springer-Verlag, 1996.
15. Rosario Gennaro, Stanislaw Jarecki, Hugo Krawczyk, and Tal Rabin. Robust threshold DSS signatures. In Proceedings of Advances in Cryptology - EUROCRYPT '96, volume 1070 of LNCS, pages 354-371. Springer-Verlag, 1996.
16. Oded Goldreich, Silvio Micali, and Avi Wigderson. How to play any mental game or a completeness theorem for protocols with honest majority. In Proceedings of the 19th Annual ACM Symposium on the Theory of Computing (STOC '87), pages 218-229. ACM, 1987.
17. Louis C. Guillou and Jean-Jacques Quisquater. A "paradoxical" indentity-based signature scheme resulting from zero-knowledge. In Proceeding of Advances in Cryptology - CRYPTO '88, volume 403 of LNCS, pages 216-231. Springer-Verlag, 1988.
18. Gene Itkis and Leonid Reyzin. Forward-secure signatures with optimal signing and verifying. In Proceedings of Advances in Cryptology - CRYPTO 2001, volume 2139 of LNCS, pages 332-354. Springer-Verlag, 2001.
19. Stanislaw Jarecki. Efficient Threshold Cryptosystems. PhD thesis, MIT, 2001.
20. Stanislaw Jarecki and Anna Lysyanskaya. Adaptively secure threshold cryptography: Introducing concurrency, removing erasures. In Proceedings of Advances in Cryptology - EUROCRYPT 2000, volume 1807 of LNCS, pages 221-242. Springer-Verlag, 2000.
21. Tal Rabin. A simplified approach to threshold and proactive rsa. In Proceedings of Advances in Cryptology - CRYPTO '98, volume 1462 of LNCS, pages 89-104. Springer-Verlag, 1998.
22. Alfredo De Santis, Yvo Desmedt, Yair Frankel, and Moti Yung. How to share a function securely. In Proceedings of the 26th Annual ACM Symposium on the Theory of Computing (STOC '94), pages 522-533. ACM, 1994.
23. Victor Shoup. Practical threshold signatures. In Proceedings of Advances in Cryptology - EUROCRYPT 2000, volume 1807 of LNCS, pages 207-220. Springer-Verlag, 2000.
24. Lloyd R. Welch and Elwyn R. Berlekamp. Error correction of algebraic block codes. U.S. Patent No. 4,633,470, December 1986.
25. Andrew Chi-Chih Yao. Protocols for secure computations. In Proceedings of 23th Annual Symposium on Foundations of Computer Science (FOCS '82), pages 160-164. IEEE, 1982.