Sequential aggregate signatures and multisignatures without random oracles

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

Volumn 4004 LNCS, Issue , 2006, Pages 465-485

  Lu, Steve ^a   Ostrovsky, Rafail ^a   Sahai, Amit ^a   Shacham, Hovav ^b   Waters, Brent ^c  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b WEIZMANN INSTITUTE OF SCIENCE   (Israel)

^c SRI INTERNATIONAL   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; CRYPTOGRAPHY; DATABASE SYSTEMS; ROUTERS; SECURITY OF DATA;

AGGREGATE SIGNATURES; MULTISIGNATURE; PROXY SIGNATURES; RANDOM ORACLES;

ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS;

EID: 33746066354     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11761679_28     Document Type: Conference Paper

References (29)

1. N. Asokan, V. Shoup, and M. Waidner. Optimistic fair exchange of digital signatures. IEEE J. Selected Areas in Comm., 18(4):593-610, Apr. 2000.
2. F. Bao, R. Deng, and W. Mao. Efficient and practical fair exchange protocols with offline TTP. In P. Karger and L. Gong, editors, Proceedings of IEEE Security & Privacy, pages 77-85, May 1998.
3. P. Barreto and M. Naehrig. Pairing-friendly elliptic curves of prime order. In B. Preneel and S. Tavares, editors, Proceedings of SAC 2005, volume 3897 of LNCS, pages 319-31. Springer-Verlag, 2006.
4. M. Bellare, D. Micciancio, and B. Warinschi. Foundations of group signatures: Formal definitions, simplified requirements, and a construction based on general assumptions. In E. Biham, editor, Proceedings of Eurocrypt 2003, volume 2656 of LNCS, pages 614-29. Springer-Verlag, May 2003.
5. A. Bender, J. Katz, and R. Morselli. Ring signatures: Stronger definitions, and constructions without random oracles. In S. Halevi and T. Rabin, editors, Proceedings of TCC 2006, volume 3876 of LNCS, pages 60-79, Springer-Verlag, Mar. 2006.
6. A. Boldyreva. Threshold signature, multisignature and blind signature schemes based on the gap-Diffie-Hellman-group signature scheme. In Y. Desmedt, editor, Proceedings of PKC 2003, volume 2567 of LNCS, pages 31-46. Springer-Verlag, Jan. 2003.
7. A. Boldyreva, A. Palacio, and B. Warinschi. Secure proxy signature schemes for delegation of signing rights. Cryptology ePrint Archive, Report 2003/096, 2003. http://eprint.iacr.org/.
8. D. Boneh, C. Gentry, B. Lynn, and H. Shacham. Aggregate and verifiably encrypted signatures from bilinear maps. In E. Biham, editor, Proceedings of Eurocrypt 2003, volume 2656 of LNCS, pages 416-32, Springer-Verlag, May 2003.
9. D. Boneh, B. Lynn, and H. Shacham. Short signatures from the Weil pairing. J. Cryptology, 17(4):297-319, Sept. 2004,
10. Extended abstract in Proceedings of Asiacrypt 2001.
11. R. Canetti, O. Goldreich, and S. Halevi. The random oracle methodology, revisited. J. ACM, 51(4):557-94, July 2004.
12. S. Chatterjee and P. Sarkar. Trading time for space: Towards an efficient IBE scheme with short(er) public parameters in the standard model. In D. Won and S. Kim, editors, Proceedings of ICISC 2005, LNCS. Springer-Verlag, Dec. 2005. To appear.
13. J.-S. Coron and D. Naccache. Boneh et al.'s k-element aggregate extraction assumption is equivalent to the Dime-Hellman assumption. In C. S. Laih, editor, Proceedings of Asiacrypt 2003, volume 2894 of LNCS, pages 392-7. Springer-Verlag, Dec. 2003.
14. S. Galbraith. Pairings. In I. F. Blake, G. Seroussi, and N. Smart, editors, Advances in Elliptic Curve Cryptography, volume 317 of London Mathematical Society Lecture Notes, chapter IX, pages 183-213. Cambridge University Press, 2005.
15. S. Goldwasser, S. Micali, and H. Rivest. A digital signature scheme secure against adaptive chosen-message attacks. SIAM J. Computing, 17(2):281-308, 1988.
16. J. Groth, R. Ostrovsky, and A. Sahai. Perfect non-interactive zero knowledge for NP. In S. Vaudenay, editor, Proceedings of Eurocrypt 2006, LNCS. Springer-Verlag, May 2006. This volume.
17. R. Hayashi, T. Okamoto, and K. Tanaka. An RSA family of trap-door permutations with a common domain and its applications. In F. Bao, R. H. Deng, and J. Zhou, editors, Proceedings of PKC 2004, volume 2947 of LNCS, pages 291-304. Springer-Verlag, Mar. 2004.
18. K. Itakura and K. Nakamura. A public-key cryptosystem suitable for digital multisignatures, NEC J. Res. & Dev., 71:1-8, Oct. 1983.
19. S. Kent, C. Lynn, and K. Seo. Secure border gateway protocol (Secure-BGP). IEEE J. Selected Areas in Comm., 18(4):582-92, April 2000.
20. N. Koblitz and A. Menezes. Pairing-based cryptography at high security levels. In N. Smart, editor, Proceedings of Cryptography and Coding 2005, volume 3796 of LNCS, pages 13-36. Springer-Verlag, Dec. 2005.
21. A. Lysyanskaya, S. Micali, L. Reyzin, and H. Shacham. Sequential aggregate signatures from trapdoor permutations. In G. Cachin and J. Camenisch, editors, Proceedings of Eurocrypt 2004, volume 3027 of LNCS, pages 74-90. Springer-Verlag, May 2004.
22. M. Mambo, K. Usuda, and E. Okamoto. Proxy signatures for delegating signing operation. In L. Gong and J. Steam, editors. Proceedings of CCS 1996, pages 48-57. ACM Press, Mar. 1996.
23. S. Micali, K. Ohta, and L. Reyzin. Accountable-subgroup multisignatures (extended abstract). In P. Samarati, editor, Proceedings of CCS 2001, pages 245-54. ACM Press, Nov. 2001.
24. D. Naccache. Secure and practical identity-based encryption. Cryptology ePrint Archive, Report 2005/369, 2005. http://eprint.iacr.org/.
25. D. Nicol, S. Smith, and M. Zhao. Evaluation of efficient security for BGP route announcements using parallel simulation. Simulation Modelling Practice and Theory, 12:187-216, 2004.
26. K. Ohta and T. Okamoto. Multisignature schemes secure against active insider attacks. IEICE Trans. Fundamentals, E82-A(1):21-31, 1999.
27. T. Okamoto. A digital multisignature scheme using bijective public-key cryptosystems. ACM Trans. Computer Systems, 6(4):432-41, November 1988,
28. K. Paterson, Cryptography from pairings, In I. F. Blake, G. Seroussi, and N. Smart, editors, Advances in Elliptic Curve Cryptography, volume 317 of London Mathematical Society Lecture Notes, chapter X, pages 215-51. Cambridge University Press, 2005.
29. B. Waters. Efficient identity-based encryption without random oracles. In R. Cramer, editor, Proceedings of Eurocrypt 2005, volume 3494 of LNCS, pages 114-27. Springer-Verlag, May 2005.