Optimal resilient threshold GQ signatures

Information Sciences

Volumn 177, Issue 8, 2007, Pages 1834-1851

  Chu, Cheng Kang ^a   Tzeng, Wen Guey ^a  

^a NATIONAL CHIAO TUNG UNIVERSITY   (Taiwan)

Author keywords

GQ signature scheme; Threshold signature scheme

Indexed keywords

BROADCASTING; CHANNEL CAPACITY; COMPUTATIONAL METHODS; CRYPTOGRAPHY; NETWORK PROTOCOLS;

CRYPTOGRAPHIC PROTOCOLS; GQ SIGNATURE SCHEME; THRESHOLD SIGNATURE SCHEME; THRESHOLD VERSION;

ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS;

EID: 33846641752     PISSN: 00200255     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ins.2006.11.001     Document Type: Article

References (39)

1. Abdalla M., Miner S., and Namprempre C. Forward-secure threshold signature schemes. Proceedings of the CT-RSA Conference (2001), Springer-Verlag 441-456
2. Abdalla M., and Reyzin L. A new forward-secure digital signature scheme. Proceedings of Advances in Cryptology - ASIACRYPT 2000. LNCS vol. 1976 (2000), Springer-Verlag 116-129
3. Beaver D., and Haber S. Cryptographic protocols provably secure against dynamic adversaries. Proceedings of Advances in Cryptology - EUROCRYPT'92. LNCS vol. 658 (1992), Springer-Verlag 307-323
4. Bellare M., and Miner S.K. A forward-secure digital signature scheme. Proceedings of Advances in Cryptology - CRYPTO'99. LNCS vol. 1666 (1999), Springer-Verlag 431-448
5. Camenisch J., and Koprowski M. Fine-grained forward-secure signature schemes without random oracles. Discrete Appl. Math. 154 2 (2006) 175-188
6. Canetti R., Feige U., Goldreich O., and Naor M. Adaptively secure multi-party computation. Proceedings of the 28th Annual ACM Symposium on the Theory of Computing (STOC'96) (1996), ACM 639-648
7. Canetti R., Gennaro R., Jarecki S., Krawczyk H., and Rabin T. Adaptive security for threshold cryptosystems. Proceedings of Advances in Cryptology - CRYPTO'99. LNCS vol. 1666 (1999), Springer-Verlag 98-115
8. Cerecedo M., Matsumoto T., and Imai H. Efficient and secure multiparty generation of digital signatures based on discrete logarithms. IEICE Trans. Fundamentals E76-A 4 (1993) 532-545
9. Damgård I., and Dupont K. Efficient threshold RSA signatures with general moduli and no extra assumptions. Proceedings of the Public-Key Cryptography (PKC'05). LNCS vol. 3386 (2005), Springer-Verlag 346-361
10. Damgård I., and Koprowski M. Practical threshold RSA signatures without a trusted dealer. Proceedings of Advances in Cryptology - EUROCRYPT 2001. LNCS vol. 2045 (2001), Springer-Verlag 152-165
11. De Santis A., Desmedt Y., Frankel Y., and Yung M. How to share a function securely. Proceedings of the 26th Annual ACM Symposium on the Theory of Computing (STOC'94) (1994), ACM 522-533
12. Delos O., and Quisquater J.-J. An identity-based signature scheme with bounded life-span. Proceedings of Advances in Cryptology - CRYPTO'94. LNCS vol. 839 (1994), Springer-Verlag 83-94
13. Desmedt Y. Society and group oriented cryptography: a new concept. Proceedings of Advances in Cryptology - CRYPTO'87. LNCS vol. 293 (1987), Springer-Verlag 120-127
14. Desmedt Y., and Frankel Y. Shared generation of authenticators and signatures. Proceedings of Advances in Cryptology - CRYPTO'91. LNCS vol. 576 (1991), Springer-Verlag 457-469
15. Fiat A., and Shamir A. How to prove yourself: Practical solutions to identification and signature problems. Proceedings of Advances in Cryptology - CRYPTO'86. LNCS vol. 263 (1986), Springer-Verlag 186-194
16. Yair Frankel, Yvo Desmedt, Parallel reliable threshold multisignature, Technical Report TR-92-04-02, Dept. of EE and CS, U. of Winsconsin, April 1992.
17. Frankel Y., Gemmell P., MacKenzie P.D., and Yung M. Optimal-resilience proactive public-key cryptosystems. Proceedings of 38th Annual Symposium on Foundations of Computer Science (FOCS'97) (1997), IEEE 384-393
18. Frankel Y., Gemmell P., and Yung M. Witness-based cryptographic program checking and robust function sharing. Proceedings of the 28th Annual ACM Symposium on the Theory of Computing (STOC'96) (1996), ACM 499-508
19. Frankel Y., MacKenzie P.D., and Yung M. Robust efficient distributed RSA-key generation. Proceedings of the 30th Annual ACM Symposium on the Theory of Computing (STOC'98) (1998), ACM 663-672
20. Frankel Y., MacKenzie P.D., and Yung M. Adaptively-secure distributed public-key systems. Proceedings of 7th Annual European Symposium on Algorithms (ESA'99). LNCS vol. 1643 (1999), Springer-Verlag 4-27
21. Frankel Y., MacKenzie P.D., and Yung M. Adaptively-secure optimal-resilience proactive RSA. Proceedings of Advances in Cryptology - ASIACRYPT'99. LNCS vol. 1716 (1999), Springer-Verlag 180-194
22. Gennaro R., Jarecki S., Krawczyk H., and Rabin T. Robust and efficient sharing or RSA functions. Proceedings of Advances in Cryptology - CRYPTO'96. LNCS vol. 1109 (1996), Springer-Verlag 157-172
23. Gennaro R., Jarecki S., Krawczyk H., and Rabin T. Robust threshold DSS signatures. Proceedings of Advances in Cryptology - EUROCRYPT'96. LNCS vol. 1070 (1996), Springer-Verlag 354-371
24. Goldreich O., Micali S., and Wigderson A. How to play any mental game or a completeness theorem for protocols with honest majority. Proceedings of the 19th Annual ACM Symposium on the Theory of Computing (STOC'87) (1987), ACM 218-229
25. Guillou L.C., and Quisquater J.-J. A "paradoxical" identity-based signature scheme resulting from zero-knowledge. Proceedings of Advances in Cryptology - CRYPTO'88. LNCS vol. 403 (1988), Springer-Verlag 216-231
26. Itkis G., and Reyzin L. Forward-secure signatures with optimal signing and verifying. Proceedings of Advances in Cryptology - CRYPTO 2001. LNCS vol. 2139 (2001), Springer-Verlag 332-354
27. Stanislaw Jarecki, Efficient Threshold Cryptosystems, Ph.D. thesis, MIT, 2001.
28. Jarecki S., and Lysyanskaya A. Adaptively secure threshold cryptography: Introducing concurrency, removing erasures. Proceedings of Advances in Cryptology - EUROCRYPT 2000. LNCS vol. 1807 (2000), Springer-Verlag 221-242
29. Nielsen J.B., Almansa J.F., and Damgärd I. Simplified threshold RSA with adaptive and proactive security. Proceedings of Advances in Cryptology - EUROCRYPT'06. LNCS vol. 4004 (2006), Springer-Verlag 593-611
30. King B. Improved methods to perform threshold rsa. Proceedings of Advances in Cryptology - ASIACRYPT 2000. LNCS vol. 1976 (2000), Springer-Verlag 359-372
31. Lamport L., Shostak R., and Pease M. The byzantine generals problem. ACM Trans. Program. Lang. Syst. 4 3 (1982) 382-401
32. Liu L.-S., Chu C.-K., and Tzeng W.-G. A threshold GQ signature scheme. Proceedings of Applied Cryptography and Network Security (ACNS 2003). LNCS vol. 2846 (2003), Springer-Verlag 137-150
33. Pease M., Shostak R., and Lamport L. Reaching agreement in the presence of faults. J. ACM 27 2 (1980) 228-234
34. Pedersen T.P. Non-interactive and information-theoretic secure verifiable secret sharing. Proceedings of Advances in Cryptology - CRYPTO'91. LNCS vol. 576 (1991), Springer-Verlag 129-140
35. Rabin T. A simplified approach to threshold and proactive RSA. Proceedings of Advances in Cryptology - CRYPTO'98. LNCS vol. 1462 (1998), Springer-Verlag 89-104
36. Shoup V. Practical threshold signatures. Proceedings of Advances in Cryptology - EUROCRYPT 2000. LNCS vol. 1807 (2000), Springer-Verlag 207-220
37. Tzeng Z.-J., and Tzeng W.-G. Robust forward signature schemes with proactive security. Proceedings of the Public-Key Cryptography (PKC'01) (2001), Springer-Verlag 264-276
38. Lloyd R. Welch, Elwyn R. Berlekamp, Error correction of algebraic block codes, US Patent No. 4,633,470, December 1986.
39. Yao A.C.-C. Protocols for secure computations. Proceedings of 23th Annual Symposium on Foundations of Computer Science (FOCS'82) (1982), IEEE Press 160-164