Multi-signatures in the plain public-Key model and a general forking lemma

Proceedings of the ACM Conference on Computer and Communications Security

Volumn , Issue , 2006, Pages 390-399

  Bellare, Mihir ^a   Neven, Gregory ^b,c  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b UNIVERSITY OF LEUVEN   (Belgium)

^c ECOLE NORMALE SUPÉRIEURE   (France)

Author keywords

Cryptography; Digital signatures; Forking lemma; Multi signatures

Indexed keywords

KNOWLEDGE BASED SYSTEMS; MATHEMATICAL MODELS; PUBLIC KEY CRYPTOGRAPHY; RANDOM PROCESSES; THEOREM PROVING;

DISTRIBUTED KEY GENERATION; FORKING LEMMA; MULTI-SIGNATURES; PUBLIC-KEY MODELS;

ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS;

EID: 34547339273     PISSN: 15437221     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1180405.1180453     Document Type: Conference Paper

References (42)

1. M. Abdalla, J. H. An, M. Bellare, and C. Namprempre. From identification to signatures via the Fiat-Shamir transform: Minimizing assumptions for security and forward-security. EUROCRYPT 2002, LNCS 2332, Springer-Verlag.
2. M. Abdalla and L. Reyzin. A new forward-secure digital signature scheme. ASIACRYPT 2000, LNCS 1976, Springer-Verlag.
3. C. Adams, S. Farrell, T. Kause, and T. Monen. Internet X. 509 Public Key Infrastructure Certificate Management Protocol (CMP). Internet Engineering Task Force RFC 4210, 2005.
4. K. Barr and K. Asanovic. Energy aware lossless data compression. MobiSys 2003, ACM Press.
5. M. Bellare and O. Goldreich. On defining proofs of knowledge. CRYPTO 1992, LNCS 740, Springer-Verlag.
6. M. Bellare, C. Namprempre, and G. Neven. Unrestricted aggregate signatures. Cryptology ePrint Archive, Report 2006/285, 2006.
7. M. Bellare and G. Neven. New multi-signatures and a, general forking lemma. Full version of this paper, available from http://www.cs.ucsd.edu/users/ mihir, 2006.
8. M. Bellare and A. Palacio. GQ and Schnorr identification schemes: Proofs of security against impersonation under active and concurrent attacks. CRYPTO 2002, LNCS 2442, Springer-Verlag.
9. M. Bellare, T. Ristenpart, and S. Yilek. Work in progress, 2006.
10. M. Bellare and P. Rogaway. Random oracles are practical: A paradigm for designing efficient protocols. ACM CCS 1993, ACM Press.
11. A. Boldyreva. Threshold signatures, multisignatures a,nd blind signatures based on the gap-Diffie-Hellman-group signature scheme. PKC 2003, LNCS 2567, Springer-Verlag.
12. D. Boneh, C. Gentry, B. Lynn, and H. Shacham. Aggregate and verifiably encrypted signatures from bilinear maps. EUROCRYPT 2003, LNCS 2656, Springer-Verlag.
13. D. Boneh, H. Shacham, and B. Lynn. Short signatures from the Weil pairing. ASIACRYPT 2001, LNCS 2248, Springer-Verlag.
14. A. De Santis and G. Persiano. Zero-knowledge proofs of knowledge without interaction. FOCS 1992, IEEE Computer Society Press.
15. U. Feige, A. Fiat, and A. Shamir. Zero knowledge proofs of identity. Journal of Cryptology, 1(2):77-94, 1988.
16. A. Fiat and A. Shamir. How to prove yourself: Practical solutions to identification and signature problems. CRYPTO 1986, LNCS 263, Springer-Verlag.
17. M. Fischlin. Communication-efficient non-interactive proofs of knowledge with online extractors. CRYPTO 2005, LNCS 3621, Springer-Verlag.
18. S. D. Galbraith, K. G. Peterson, and N. P. Smart. Pairings for cryptographers. Cryptology ePrint Archive, Report 2006/165, 2006.
19. L. C. Guillou and J.-J. Quisquater. A "paradoxical" indentity-based signature scheme resulting from zero-knowledge. CRYPTO 1988, LNCS 403, Springer-Verlag.
20. L. Harn. Group-oriented (t, n) threshold digital signature scheme and digital multisignature. IEE Proceedings - Computers and Digital Techniques, 141(5):307-313, 1994.
21. R. Hayashi, T. Okamoto, and K. Tanaka. An RSA family of trap-door permutations with a, common domain and its applications. PKC 2004, LNCS 2947, Springer-Verlag.
22. J. Herranz and G. Sáez. Forking lemmas for ring signature schemes. INDOCRYPT 2003, LNCS 2947, Springer-Verlag.
23. F. Hess. Efficient identity based signature schemes based on pairings. SAC 2002, LNCS 2595, Springer-Verlag.
24. P. Horster, M. Michels, and H. Petersen. Meta-multisignatures schemes based on the discrete logarithm problem. IFIP/SEC 1995. Chapman & Hall.
25. K. Itakura and K. Nakamura. A public-key cryptosystem suitable for digital multisignatures. NEC Research & Development, 71:1-8, 1983.
26. J. Katz and N. Wang. Efficiency improvements for signature schemes with tight security reductions. ACM CCS 2003, ACM Press.
27. S. K. Langford. Weakness in some threshold cryptosystems. CRYPTO 1996, LNCS 1109, Springer-Verlag.
28. C-M. Li, T. Hwang, and N.-Y. Lee. Threshold-multisignature schemes where suspected forgery implies traceability of adversarial shareholders. EUROCRYPT 1994, LNCS 950, Springer-Verlag.
29. S. Lu, R. Ostrovsky, A. Sahai, H. Shacham, and B. Waters. Sequential aggregate signatures and multisignatures without random oracles. EUROCRYPT 2006, LNCS 4004, Springer-Verlag.
30. A. Lysyanskaya, S. Micali, L. Reyzin, and H. Shacham. Sequential aggregate signatures from trapdoor permutations. EUROCRYPT 2004, LNCS 3027, Springer-Verlag.
31. S. Micali, K. Ohta, and L. Reyzin. Accountable-subgroup multisignatures. ACM CCS 2001, ACM Press.
32. M. Michels and P. Horster. On the risk of disruption in several multiparty signature schemes. ASIACRYPT 1996, LNCS 1163, Springer-Verlag.
33. K. Ohta and T. Okamoto. A modification of the Fiat-Shamir scheme. CRYPTO 1988, LNCS 403, Springer-Verlag.
34. K. Ohta and T. Okamoto. A digital multisignature scheme based on the Fiat-Shamir scheme. ASIACRYPT 1991, LNCS 739, Springer-Verlag.
35. K. Ohta and T. Okamoto. Multi-signature schemes secure against active insider attacks. IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences, E82-A(1):21-31, 1999.
36. T. Okamoto. Provably secure and practical identification schemes and corresponding signature schemes. CRYPTO 1992, LNCS 1751, Springer-Verlag.
37. H. Ong and C-P. Schnorr. Fast signature generation with a Fiat Shamir-like scheme. EUROCRYPT 1990, LNCS 473, Springer-Verlag.
38. PKCS #10: Certification request syntax standard. RSA Data Security, Inc., 2000.
39. D. Pointcheval, E. Brickell, S. Vaudenay, and M. Yung. Design validations for discrete logarithm based signature schemes. PKC 2000, LNCS 1751, Springer-Verlag.
40. D. Pointcheval and J. Stern. Security arguments for digital signatures and blind signatures. Journal of Cryptology, 13(3):361-396, 2000.
41. J. Schaad. Internet X.509 Public Key Infrastructure Certificate Request Message Format, Internet Engineering Task Force RFC 4211, 2005.
42. C-P. Schnorr. Efficient signature generation by smart cards. Journal of Cryptology, 4(3):161-174, 1991.