The power of proofs-of-possession: Securing multiparty signatures against rogue-key attacks

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

Volumn 4515 LNCS, Issue , 2007, Pages 228-245

  Ristenpart, Thomas ^a   Yilek, Scott ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Bilinear maps; Multisignatures; PKI; Proofs of possession; Ring signatures

Indexed keywords

ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS; INTRUSION DETECTION; NETWORK PROTOCOLS; NETWORK SECURITY;

BILINEAR MAPS; MULTISIGNATURES; PROOFS OF POSSESSION; RING SIGNATURES; SECRET KEYS;

PUBLIC KEY CRYPTOGRAPHY;

EID: 38049178624     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-72540-4_13     Document Type: Conference Paper

References (40)

1. C. Adams, S. Farrell, T. Kause, T. Mononen. Internet X.509 public key infrastructure certificate management protocols (CMP). Request for Comments (RFC) 4210, Internet Engineering Task Force (September 2005)
2. N. Asokan, V. Niemi, P. Laitinen. On the usefulness of proof-of-possession. In Proceedings of the 2nd Annual PKI Research Workshop. (2003) 122-127
3. M. Bellare. CSE 208: Advanced Cryptography. UCSD course (Spring 2006).
4. M. Bellare, O. Goldreich. On Defining Proofs of Knowledge. In CRYPTO '92. Volume 740 of LNCS, Springer (1993) 390-420
5. M. Bellare, T. Kohno, V. Shoup. Stateful public-key cryptosystems: how to encrypt with one 160-bit exponentiation. ACM Conference on Computer and Communications Security. (2006) 380-389
6. M. Bellare, C. Namprempre, G. Neven. Unrestricted aggregate signatures. Cryptology ePrint Archive, Report 2006/285 (2006) http://eprint.iacr.org/.
7. M. Bellare, G. Neven. Multi-signatures in the plain public-key model and a generalized forking lemma. In ACM Conference on Computer and Communications Security. (2006) 390-399
8. M. Bellare, P. Rogaway. Random oracles are practical: a paradigm for designing efficient protocols. In ACM Conference on Computer and Communications Security. (1993) 62-73
9. M. Bellare, P. Rogaway. The security of triple encryption and a framework for code-based game-playing proofs. In EUROCRYPT '06. Volume 4004 of LNCS, Springer (2006) 409-426
10. A. Bender, J. Katz, R. Morselli. Ring signatures: Stronger definitions, and constructions without random oracles. In TCC '06. Volumne 3876 of LNCS, Springer (2006) 60-79
11. A. Boldyreva. Threshold signatures, multisignatures and blind signatures based on the gap-diffie-hellman-group signature scheme. In PKC '03. Volume 2567 of LNCS, Springer (2002) 31-46
12. A. Boldyreva, M. Fischlin, A. Palacio, B. Warinschi. A closer look at PKI: security and efficiency. Public Key Cryptography (2007), to appear.
13. D. Boneh, C. Gentry, B. Lynn, H. Shacham. Aggregate and verifiably encrypted signatures from bilinear maps. In EUROCRYPT '03. Volume 2656 of LNCS, Springer (2003) 416-432
14. D. Boneh, B. Lynn, H. Shacham. Short signatures from the weil pairing. In ASIACRYPT '01. Volume 2248 LNCS, Springer (2001) 514-532
15. J.S. Coron. On the exact security of full domain hash. In CRYPTO '00. Volume 1880 of LNCS, Springer (2000) 229-235
16. A. De Santis, G. Persiano. Zero-knowledge proofs of knowledge without interaction (extended abstract). In FOCS '92. IEEE (1992) 427-436
17. M. Fischlin. Communication-efficient non-interactive proofs of knowledge with online extractors. In CRYPTO '05. Volume 3621 of LNCS, Springer (2005) 152-168
18. S. Goldwasser, S. Micali, R. Rivest. A Paradoxical Solution to the Signature Problem. In FOCS '84. IEEE (1984) 441-449.
19. J. Groth, R. Ostrovsky, A. Sahai. Perfect non-interactive zero knowledge for NP. In EUROCRYPT '06. Volume 4004 of LNCS, Springer (2006) 339-358
20. L. Ham. Group-oriented (t,n) threshold digital signature scheme and digital multisignature. Computers and Digital Techniques, IEEE Proceedings 141(5) (1994) 307-313
21. J. Herranz. Some digital signature schemes with collective signers. Ph.D. Thesis, Universitat Politècnica De Catalunya, Barcelona. April, 2005.
22. P. Horster, M. Michels, H. Petersen. Meta signature schemes based on the discrete logarithm problem. In IFIP TCIl Eleventh International Conference on Information Security (IFIP/SEC 1995) (1995) 128-141
23. M. Jakobsson, K. Sako, R. Impagliazzo. Designated verifier proofs and their applications. In EUROCRYPT '96. Volume 1070 of LNCS, Springer (1996) 143-154
24. F. Laguillaumie, D. Vergnaud. Designated verifier signatures: anonymity and efficient construction from any bilinear map. In Security in Communication Networks, 4th International Conference, SCN 2004. Volume 3352 of LNCS, Springer (2005) 105-119
25. S.K. Langford. Weakness in some threshold cryptosystems. In CRYPTO '96. Volume 1109 of LNCS, Springer (1996) 74-82
26. C.M. Li, T. Hwang, N.Y. Lee. Threshold-multisignature schemes where suspected forgery implies traceability of adversarial shareholders. In EUROCRYPT '94- Volume 950 of LNCS, Springer (1995) 194-204
27. H. Lipmaa, G. Wang, F. Bao. Designated verifier signature schemes: attacks, new security notions and a new construction. In ICALP 2005. Volume 3580 LNCS, Springer (2005) 459-471
28. S. Lu, R. Ostrovsky, A. Sahai, H. Shacham, B. Waters. Sequential aggregate signatures and multisignatures without random oracles. In EUROCRYPT '06. Volume 4004 of LNCS, Springer (2006) 465-485
29. A. Lysyanskaya, S. Micali, L. Reyzin, H. Shacham. Sequential Aggregate Signatures from Trapdoor Permutations. In EUROCRPYT '04. Volume 3027 of LNCS, Springer (2004) 74-90
30. M. Michels, P. Horster. On the risk of disruption in several multiparty signature schemes. In ASIACRYPT '96. Volume 1163 of LNCS, Springer (1996) 334-345
31. S. Micali, K. Ohta, L. Reyzin. Accountable-subgroup multisignatures. In ACM Conference on Computer and Communications Security. (2001) 245-254
32. K. Ohta, T. Okamoto. A digital multisignature scheme based on the Fiat-Shamir scheme. In ASIACRYPT '91. Volume 739 of LNCS, Springer (1993) 139-148
33. K. Ohta, T. Okamoto. Multi-signature schemes secure against active insider attacks. IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences E82-A(1) (1999) 21-31
34. T. Ristenpart, S. Yilek. The power of proofs-of-possession: securing multiparty signatures against rogue-key attacks. Full version of current paper. http://www.cse.ucsd.edu/users/tristenp/
35. R.L. Rivest, A. Shamir, Y. Tauman. How to leak a secret. In ASIACRYPT '01. Volume 2248 of LNCS, Springer (2001) 552-565
36. RSA Laboratories: RSA PKCS #10 v1.7: Certification Request Syntax Standard ftp://ftp.rsasecurity.com/pub/pkcs/pkcs-10/pkcs-10v1_7.pdf.
37. J. Schaad. Internet X.509 public key infrastructure certificate request message format (CRMF). Request for Comments (RFC) 4211, Internet Engineering Task Force (September 2005)
38. H. Shacham, B. Waters. Efficient ring signatures without random oracles. Public Key Cryptography (2007), to appear.
39. R. Steinfeld, L. Bull, H. Wang, J. Pieprzyk. Universal designated-verifier signatures. In ASIACRYPT '03. Volume 2894 of LNCS, Springer (2003) 523-542
40. B. Waters. Efficient identity-based encryption without random oracles. In EUROCRYPT '05. Volume 3494 of LNCS, Springer (2005) 114-127