New multiparty signature schemes for network routing applications

ACM Transactions on Information and System Security

Volumn 12, Issue 1, 2008, Pages

  Boldyreva, Alexandra ^a,d   Gentry, Craig ^b,e   O'Neill, Adam ^a,d   Yum, Dae Hyun ^c  

^a GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

^b STANFORD UNIVERSITY   (United States)

^c Pohang University of Science and Technology (POSTECH)   (South Korea)

^d Georgia Institute of Technology   (United States)

^e Stanford University   (United States)

Author keywords

Aggregate signatures; Digital signatures; Identity based signatures; Multisignatures; Network security; Pairings

Indexed keywords

AGGREGATE SIGNATURES; DIGITAL SIGNATURES; IDENTITY-BASED SIGNATURES; MULTISIGNATURES; PAIRINGS;

ACCESS CONTROL; AGGLOMERATION; AGGREGATES; APPLICATIONS; AUTHENTICATION; COMPUTER NETWORKS; DIFFRACTIVE OPTICAL ELEMENTS; DIGITAL ARITHMETIC; INTERNET; NETWORK ROUTING; NETWORK SECURITY;

ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS;

EID: 56349146197     PISSN: 10949224     EISSN: 15577406     Source Type: Journal    
DOI: 10.1145/1410234.1410237     Document Type: Article

References (44)

1. AU, M.-H., SUSILO, W., AND MU, Y. 2007. Practical compact e-cash. Information Security and Privacy, 431-445.
2. BELLARE, M., NAMPREMPRE, C., AND NEVEN, G. 2007. Unrestricted aggregate signatures. In Proceedings of the International Colloquium on Automata, Languages, and Programming (ICALP'07). Lecture Notes in Computer Science, vol. 4596. Springer, 411-422.
3. BELLARE, M. AND NEVEN, G. 2007. Identity-based multi-signatures from RSA. In CT-RSA. LNCS, vol. 4377. Springer, 145-162.
4. BELLARE, M. AND ROGAWAY, P. 1993. Random oracles are practical: A paradigm for designing efficient protocols. In Conference on Computer and Communications Security (CCS'93). ACM, 62-73.
5. BELLOVIN, S. 2006. Position paper: Workable routing security. WIRED.
6. BOLDYREVA, A. 2003. Threshold signatures, multisignatures and blind signatures based on the Gap-Diffie-Hellman-Group signature scheme. In Proceedings of the 6th International Workshop on Practice and Theory in Public Key Cryptography (PKC03), LNCS, vol. 2567. Springer, 31-46.
7. BOLDYREVA, A., GENTRY, C., O'NEILL, A., AND YUM, D.-H. 2007. Ordered multisignatures and identity-based sequential aggregate signatures, with applications to secure routing. In Conference on Computer and Communications Security (CCS'07). ACM, 276-285.
8. BONEH, D. AND BOYEN, X. 2004a. Efficient selective-ID secure identity-based encryption without random oracles. In Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques (EUROCRYPT'04). Lecture Notes in Computer Science. Springer, 223-238.
9. BONEH, D. AND BOYEN, X. 2004b. Short signatures without random oracles. In Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques (EUROCRYPT'04). Lecture Notes in Computer Science, vol. 3027. Springer, 56-73.
10. BONEH, D. AND FRANKLIN, M. K. 2001. Identity-based encryption from the Weil pairing. In Proceedings of the Annual International Cryptology Conference (CRYPTO'01). Lecture Notes in Computer Science, vol. 2139. Springer, 213-229.
11. BONEH, D., GENTRY, C., SHACHAM, H., AND LYNN, B. 2003. Aggregate and verifiably encrypted signatures from bilinear maps. In Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques (EUROCRYPT'03). Lecture Notes in Computer Science, vol. 2656.
12. BONEH, D., LYNN, B., AND SHACHAM, H. 2001. Short signatures from the weil pairing. In Proceedings of the International Conference on the Theory and Application of Cryptology and Information Security (ASIACRYPT'01). Lecture Notes in Computer Science, vol. 2248.
13. BURMESTER, M., DESMEDT, Y., DOI, H., MAMBO, M., OKAMOTO, E., TADA, M., AND YOSHIFUJI, Y. 2000. A structured ElGamal-type multisignature scheme. In Proceedings of the 3rd International Workshop on Practice and Theory in Public Key Cryptography (PKC'00). Springer, 466-483.
14. BUTLER, K., FARLEY, F., MCDANIEL, P., AND REXFORD, J. 2005. A survey of BGP security. http://www.research.att.com/jrex/.
15. CAMENISCH, J. AND LYSYANSKAYA, A. 2004. Signature schemes and anonymous credentials from bilinear maps. In Proceedings of the Annual International Cryptology Conference (CRYPTO'04). Lecture Notes in Computer Science, vol. 3152. Springer, 56-72.
16. CORON, J.-S. 2000. On the exact security of full domain hash. In Proceedings of the Annual International Cryptology Conference (CRYPTO'00). Lecture Notes in Computer Science. Springer, 229-235.
17. DOI, H., MAMBO, M., OKAMOTO, E., AND UYEMATSU, T. 1994. Multisignature scheme with specified order. In Proceedings of the Conference on Communication, Control, and Computing (CCCM'94).
18. DOI, H., MAMBO, M., AND OKAMOTO, E. 1994. Multisignature schemes for various group structures. In Proceedings of the Symposium on Cryptography and Information Security (CIS'94).
19. GALINDO, D., HERRANZ, J., AND KILTZ, E. 2006. On the generic construction of identity-based signatures with additional properties. In Proceedings of the International Conference on the Theory and Application of Cryptology and Information Security (ASIACRYPT'06). Lecture Notes in Computer Science, vol. 4284. Springer, 178-193.
20. GENTRY, C. AND RAMZAN, Z. 2006. Identity-based aggregate signatures. In Proceedings of the International Workshop on Practice and Theory in Public Key Cryptography (PKC'06). Lecture Notes in Computer Science, vol. 3958. Springer, 257-273.
21. GENTRY, C. AND SILVERBERG, A. 2002. Hierarchical ID-based cryptography. In Proceedings of the International Conference on the Theory and Application of Cryptology and Information Security (ASIACRYPT'02). Springer, 548-566.
22. GRANGER, R. AND SMART, N. 2006. On computing products of pairings. Cryptology ePrint Archive, Report 2006/172.
23. HERRANZ, J. 2006. Deterministic identity-based signatures for partial aggregation. Comput. J. 49, 3, 322-330.
24. KENT, S. T., LYNN, C., MIKKELSON, J., AND SEO, K. 2000. Secure border gateway protocol (S-BGP) - real world performance and deployment issues. In Proceedings of the Network and Distribution System Security Symposium (NDSS'00).
25. KILTZ, E., MITYAGIN, A., PANJWANI, S., AND RAGHAVAN, B. 2005. Append-only signatures. In Proceedings of the International Colloquium on Automata, Languages, and Programming (ICALP'05). Lecture Notes in Computer Science, vol. 3580. Springer, 434-445.
26. LIN, C.-Y., WU, T.-C., AND ZHANG, F. 2003. A structured multisignature scheme from the Gap Diffie-Hellman group. Cryptology ePrint Archive, Report 2003/090.
27. LU, S., OSTROVSKY, R., SAHAI, A., SHACHAM, H., AND WATERS, B. 2006. Sequential aggregate signatures and multisignatures without random oracles. In Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques (EUROCRYPT'06). Lecture Notes in Computer Science, vol. 4004. Springer, 465-485.
28. LYNN, B. The pairing-based crypto library. http://crypto. stanford.edu/pbc.
29. LYSYANSKAYA, A., MICALI, S., REYZIN, L., AND SHACHAM, H. 2004. Sequential aggregate signatures from trapdoor permutations. In Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques (EUROCRYPT'04). Lecture Notes in Computer Science, vol. 3027. Springer, 74-90.
30. LYSYANSKAYA, A., RIVEST, R. L., SAHAI, A., AND WOLF, S. 2000. Pseudonym systems. In Proceedings of the ACM Symposium on Applied Computing (SAC'00). Vol. 1758.
31. MITOMI, S. AND MIYAJI, A. 2000. A multisignature scheme with message flexibility, order flexibility and order verifiability. In Proceedings of the Australasian Conference on Information Security and Privacy (ACISP'00). Springer, London, UK, 298-312.
32. MOTIWALA, M. AND FEAMSTER, N. 2006. Position paper: Network troubleshooting on data plane coattails. WIRED.
33. MOTIWALA, M., BAVIER, A., AND FEAMSTER, N. 2007. In-band network path diagnosis. Georgia Tech Technical Report GT-CS-07-07 3.
34. MYKLETUN, E. AND TSUDIK, G. 2006. Aggregation queries in the database-as-a-service model. In Proceedings of the Conference on Database and Applications Security (DBSEC'06).
35. ACM Transactions on Information and Systems Security, Vol. 12, No. 1, Article 3, Pub. date: October 2008.
36. N. FEAMSTER, H.B. AND REXFORD, J. 2004. Some foundational problems in interdomain routing. HotNets.
37. NEVEN, G. 2008. Efficient sequential aggregate signed data. In Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques (EUROCRYPT'08). Lecture Notes in Computer Science, vol. 4965. Springer, 52-69.
38. SAXENA, A. AND SOH, B. 2005. One-way signature chaining - a new paradigm for group cryptosystems. Cryptology ePrint Archive, Report 2005/335.
39. SCHWARTZ, J. T. 1980. Fast probabilistic algorithms for verification of polynomial identities. Journal of the ACM 27, 4, 701-717.
40. SHAMIR, A. 1984. Identity-based cryptosystems and signature schemes. In Proceedings of the Annual International Cryptology Conference (CRYPTO'84). Springer, 47-53.
41. SHOUP, V. 1997. Lower bounds for discrete logarithms and related problems. In Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques (EUROCRYPT97). Lecture Notes in Computer Science, vol. 1233. Springer, 256-266.
42. TADA, M. 2002. An order-specified multisignature scheme secure against active insider attacks. In Proceedings of the Australasian Conference on Information Security and Privacy (ACISP'02). Springer, 328-345.
43. XU, S., MU, Y., AND SUSILO, W. 2006. Online/offline signatures and multisignatures for AODV and DSR routing security. In Proceedings of the Australasian Conference on Information Security and Privacy (ACISP'06). LNCS, vol. 4058. Springer, 99-110.
44. ZHAO, M., SMITH, S. W., AND NICOL, D. M. 2005. Aggregated path authentication for efficient BGP security. In Proceedings of the Conference on Computer and Communications Security (CCS'05). ACM, 128-138.