Bounded vector signatures and their applications

Proceedings of the 6th International Symposium on Information, Computer and Communications Security, ASIACCS 2011

Volumn , Issue , 2011, Pages 277-285

  Wei, Lei ^a   Coull, Scott E ^b   Reiter, Michael K ^a  

^a UNIVERSITY OF NORTH CAROLINA   (United States)

^b Rhoads and Sinon   (United States)

Author keywords

Algebraic signatures; Malleable signatures; Vectors

Indexed keywords

AUTHENTICATION; ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS; NETWORK SECURITY;

ALGEBRAIC SIGNATURES; DECISIONAL DIFFIE HELLMAN ASSUMPTION; DIGITAL SIGNATURE SCHEMES; MALLEABLE SIGNATURES; MULTI-DIMENSIONAL VECTORS; PROPERTY; RANDOM ORACLE MODEL; SIGNATURE SCHEME; SIGNING KEY; STRETCH PROPERTY;

VECTORS;

EID: 79956016288     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1966913.1966949     Document Type: Conference Paper

References (43)

1. S. Agrawal, D. Boneh, X. Boyen, and D. Mandell-Freeman. Preventing pollution attacks in multi-source network coding. Cryptology ePrint Archive, Report 2010/183, 2010. http://eprint.iacr.org/.
2. M.J. Atallah, M. Blanton, N. Fazio, and K.B. Frikken. Dynamic and efficient key management for access hierarchies. ACM Transactions on Information and System Security, 12(3):1-43, 2009.
3. M.J. Atallah, M. Blanton, and K.B. Frikken. Efficient techniques for realizing geo-spatial access control. In 2nd ACM Symposium on Information, Computer and Communications Security, pages 82-92, 2007. (Pubitemid 47479230)
4. G. Ateniese, A. De Santis, A.L. Ferrara, and B. Masucci. Provably-secure time-bound hierarchical key assignment schemes. In 13th ACM Conference on Computer and Communications Security, pages 288-297, 2006. (Pubitemid 47131377)
5. N. Baric and B. Pfitzmann. Collision-free accumulators and fail-stop signature schemes without trees. In Advances in Cryptology-Eurocrypt '97, pages 480-494, 1997. (Pubitemid 127067821)
6. M. Bellare and Neven G. Transitive signatures: new schemes and proofs. IEEE Transactions on Information Theory, 51(6):2133-2151, 2005. (Pubitemid 40843631)
7. B.H. Bloom. Space/time trade-offs in hash coding with allowable errors. Communications of the ACM, 13(7):422-426, 1970.
8. D. Boneh, D. Freeman, J. Katz, and B. Waters. Signing a linear subspace: Signature schemes for network coding. In 12th International Conference on Practice and Theory in Public Key Cryptography, pages 68-87, 2009.
9. J.W. Byers, J. Considine, M. Mitzenmacher, and S. Rost. Informed content delivery across adaptive overlay networks. IEEE/ACM Transactions on Networking, 12(5):767-780, 2004.
10. J. Camenisch and A. Lysyanskaya. Dynamic accumulators and application to efficient revocation of anonymous credentials. In Advances in Cryptology - CRYPTO 2002, volume 2442 of Lecture Notes in Computer Science, pages 101-120, 2002.
11. J. Camenisch and M. Michels. Separability and efficiency for generic group signature schemes. In Advances in Cryptology-Crypto '99, volume 1666, pages 413-430, 1999.
12. D. Chaum and T. P. Pedersen. Wallet databases with observers. In Advances in Cryptology-Crypto '92, pages 89-105, 1992.
13. R. Cramer and V. Shoup. Signature schemes based on the strong RSA assumption. ACM Transactions on Information and System Security, 3(3):161-185, 2000.
14. th IEEE Symposium on High Performance Distributed Computing, pages 236-246, 2003.
15. I. Damgård and M. Koprowski. Practical threshold RSA signatures without a trusted dealer. In Advances in Cryptology - Eurocrypt '01, pages 152-165, 2001. (Pubitemid 33275830)
16. W. de Jonge and D. Chaum. Some variations on RSA signatures and their security. In Advances in Cryptology|Crypto '86, pages 49-59, 1986.
17. DNS-based blacklist, 2010. http://www.dnsbl.info.
18. C. Estan and G. Varghese. New directions in traffic measurement and accounting: Focusing on the elephants, ignoring the mice. ACM Transactions on Computer Systems, 21(3):270-313, 2003.
19. L. Fan, P. Cao, J. Almeida, and A.Z. Broder. Summary cache: a scalable wide-area web cache sharing protocol. IEEE/ACM Transactions on Networking, 8(3):281-293, 2000.
20. A. Fiat and A. Shamir. How to prove yourself: Practical solutions to identification and signature problems. In Advances in Cryptology|Crypto '86, volume 263 of LNCS, pages 186-194, 1986.
21. R. Gennaro, S. Halevi, and T. Rabin. Secure hash-and-sign signatures without the random oracle. In Advances in Cryptology-Eurocrypt '99, pages 123-139, 1999.
22. R. Gennaro, J. Katz, H. Krawczyk, and T. Rabin. Secure network coding over the integers. Cryptology ePrint Archive, Report 2009/569, 2010. http://eprint.iacr.org/.
23. A. Hevia and D. Micciancio. The provable security of graph-based one-time signatures and extensions to algebraic signature schemes. In Advances in Cryptology-Asiacrypt '02, pages 379-396, 2002.
24. T.D. Hodes, S.E. Czerwinski, B.Y. Zhao, A.D. Joseph, and R.H. Katz. An architecture for secure wide-area service discovery. Wireless Networks, 8(2/3):213-230, 2002. (Pubitemid 34168128)
25. S. Hohenberger and B. Waters. Short and stateless signatures from the RSA assumption. In Advances in Cryptology-Crypto '09, pages 654-670, 2009.
26. R. Johnson, D. Molnar, D. Song, and D. Wagner. Homomorphic signature schemes. In The Cryptographer's Track at the RSA Conference on Topics in Cryptology, pages 244-262, 2002.
27. A. Kiayias and M. Yung. Group signatures: provable security, efficient constructions and anonymity from trapdoor-holders. Cryptology ePrint Archive, Report 2004/076, 2004. http://eprint.iacr.org/.
28. E. Kiltz, A. Mityagin, S. Panjwani, and B. Raghavan. Append-only signatures. In 32th International Colloquium on Automata, Languages and Programming, 2005.
29. B. Lampson, M. Abadi, M. Burrows, and E. Wobber. Authentication in distributed systems: Theory and practice. ACM Transactions on Computer Systems, 10(4):265-310, November 1992.
30. th ACM SIGOPS Workshop, pages 125-132, 2002.
31. K. Marzullo. Tolerating failures of continuous-valued sensors. ACM Transactions on Computer Systems, 8(4):284-304, 1990.
32. S. Micali and R. L. Rivest. Transitive signature schemes. In The Cryptographer's Track at the RSA Conference on Topics in Cryptology, pages 236-243, 2002.
33. G. Neven. A simple transitive signature scheme for directed trees. Theoretical Computer Science, 396(1-3):277-282, 2008.
34. A. Perrig, D. Song, and D. Tygar. ELK: a new protocol for efficient large-group key distribution. In 2001 IEEE Symposium on Security and Privacy, pages 247-262, 2002.
35. P. Reynolds and A. Vahdat. Efficient peer-to-peer keyword searching. In 2003 ACM/IFIP/USENIX International Conference on Middleware, pages 21-40, 2003.
36. st Joint Conference of the IEEE Computer and Communication Societies, pages 1248-1257, 2002.
37. A. Shamir. How to share a secret. Communications of the ACM, 22(11):612-613, 1979.
38. V. Shoup. Practical threshold signatures. In Advances in Cryptology-Eurocrypt '00, pages 207-220, 2000.
39. Spam and open relay blocking system, 2010.http://www.sorbs.net.
40. The spamhaus project, 2010.http://www.spamhaus.org.
41. L. Wei, S. E. Coull, and M. K. Reiter. Bounded vector signatures and their applications. Technical Report 10-018, Department of Computer Science, University of North Carolina at Chapel Hill, December 2010.
42. C. K. Wong, M. Gouda, and S. S. Lam. Secure group communications using key graphs. IEEE/ACM Transactions on Networking, 8(1):16-30, 2000. (Pubitemid 30584705)
43. thACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, pages 440-443, 2009.