Sanitizable signatures

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

Volumn 3679 LNCS, Issue , 2005, Pages 159-177

  Ateniese, Giuseppe ^a   Chou, Daniel H ^a   De Medeiros, Breno ^b   Tsudik, Gene ^c  

^a Johns Hopkins University   (United States)

^b FLORIDA STATE UNIVERSITY   (United States)

^c Irvine   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

SECURITY OF DATA;

SANITIZABLE SIGNATURE; SEMI-TRUSTED CENSORS;

CRYPTOGRAPHY;

EID: 33646059204     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11555827_10     Document Type: Conference Paper

References (39)

1. G. Ateniese and B. de Medeiros. On the key-exposure problem in chameleon hashes. Proceedings of the Fourth Conference on Security in Communication Networks (SCN'04), Lect. Notes Comp. Sci., vol. 3352. Springer-Verlag, 2005. Full version: Cryptology ePrint Archive, Report 2004/243, http://eprint.iacr. org/2004/243
2. G. Ateniese and B. de Medeiros. Identity-Based Chameleon Hash and Applications. In Ari Juels, ed., Proc. of Financial Cryptography (FC 2004), Lect. Notes Comp. Sci., vol. 3110, pp. 164-180. Springer-Verlag, 2004
3. M. Bellare, O. Goldreich, and S. Goldwasser. Incremental cryptography: the case of hashing and signing. In Y. Desmedt, ed., Advances in Cryptology-CRYPTO '94, Lect. Notes Comp. Sci., vol. 839, pp. 216-233. Springer-Verlag, 1994.
4. M. Bellare, O. Goldreich, and S. Goldwasser. Incremental cryptography with application to virus protection. In Proc. of the Twenty-Seventh Annual ACM Symposium on Theory of Computing (FOCS'95), pp. 45-56. ACM Press, 1995.
5. M. Bellare and D. Micciancio. A new paradigm for collision-free hashing: Incrementality at reduced cost. In Advances in Cryptology-Eurocrypt'97, Lect. Notes Comp. Sci., vol. 1233. Springer-Verlag, 1997.
6. M. Bellare and G. Neven. Transitive signatures based on factoring and RSA. In Y. Zheng, ed.,Advances in Cryptology-ASIACRYPT'02, Lect. Notes Comp. Sci., vol. 2501, pp. 397-414. Springer-Verlag, 2003.
7. M. Bellare, P. Rogaway. PSS: Provably secure encoding method for digital signature. IEEE P1363a: Provably secure signatures, http://grouper.ieee.org/ groups/1363/p1363a/pssigs.html (1998)
8. M. Bishop, B. Bhumiratana, R. Crawford, and K. Levitt. How to Sanitize Data. Proceedings of the 13th IEEE International Workshops on Enabling Technologies: Infrastructures for Collaborative Enterprises (WETICE-2004). Pp. 217-222. June 2004, Modena, Italy.
9. J. Boyar, D. Chaum, I. B. Damgård, T. P. Pedersen. Convertible undeniable signatures. In Advances in Cryptology-CRYPTO'90, Lect. Notes Comp. Sci., vol. 537, pp. 189-205. Springer-Verlag, 1990.
10. th IEEE Information Assurance Workshop (IAW'05), pp. 234-241. 2004.
11. Crypto++ Library 5.2.1. http://wwv.eskimo.com/weidai/cryptlib.html
12. S. Chari, T. Rabin, and R. Rivest. An efficient signature scheme for route aggregation. Unpublished manuscript, 2002. http://theory.lcs.mit.edu/ rivest/publicatioas.html
13. D. Chaum. Zero-knowledge undeniable signature. In Advances in Cryptology-EUROCRYPT'90, Lect. Notes Comp. Sci., vol. 473, pp. 458-464. Springer-Verlag, 1990.
14. D. Chaum and H. Antwerpen. Undeniable signatures. In Advances in Cryptology - CRYPTO'89. Lect. Notes Comp. Sci., vol. 435, pp. 212-216. Springer-Verlag, 1991.
15. D. Chaum, E. van Heijst, B. Pfitzmann. Cryptographically strong undeniable signatures, unconditionally secure for the signer. In Advances in Cryptology-CRYPTO'91, Lect. Notes Comp. Sci., vol. 576, pp. 470-ff. Springer-Verlag, 1991.
16. th International Information Security Conference (ISC'04), Lect. Notes Comp. Sci., vol. 3225, pp. 87-98. Springer-Verlag, 2004.
17. R. Gennaro, S. Halevi, and T. Rabin. Secure hash-and-sign signatures without the random oracle. In Advances in Cryptology-EUROCRYPT'99, Lect. Notes Comp. Sci., vol. 1592, pp. 123-139. Springer-Verlag, 1999.
18. S. Haber and W. S. Stornetta. How to Time-Stamp a Digital Document. In Advances in Cryptology-CRYPTO'90, Lect. Notes Comp. Sci., vol. 537, pp. 437-455. Springer-Verlag, 1990.
19. Hakan Hacigümus, Balakrishna R. Iyer, and Sharad Mehrotra. Executing SQL over encrypted data in the database-service-provider model. In Proc. Intern. Conf. Management of Data (ACM SIGMOD 2002), pp. 216-227. ACM Press, 2002.
20. A. J. Menezes, P. C. van Oorschot and S. A. Vanstone. Handbook of Applied Cryptography. CRC Press, 2001.
21. Einar Mykletun, Maithili Narasimha, and Gene Tsudik. Authentication and Integrity in Outsourced Databases. In Proc. of the Network and Distributed System Security Symposium (NDSS'04), 10 pp. Internet Society (ISOC) Press, 2004. http://www.isoc.org/isoc/conferences/ndss/04/proceedings/Papers/Mykletun.pdf
22. D. Johnson and D. Maltz. Dynamic Source Routing in Ad Hoc Wireless Networks, Mobile Computing, 1996.
23. R. Johnson, D. Molnar, D. Song, and D. Wagner. Homomorphic signature schemes. In B. Preneel, ed., Topics in Cryptology-CT-RSA 2002, Lect. Notes Comp. Sci., vol. 2771, pp. 244-262. Springer-Verlag, 2002.
24. S. Kent, C. Lynn and K. Seo. Secure Border Gateway Protocol (Secure-BGP), IEEE Journal on Selected Areas in Communications, April 2000.
25. H. Krawczyk and T. Rabin. Chameleon signatures. In Proceedings of the Network and Distributed Systems Security Symposium (NDSS 2000), pp. 143-154.
26. S. Micali and R. Rivest. Transitive signature schemes. In B. Preneel, ed., Topics in Cryptology-RSA-CT'02, Lect. Notes Comp. Sci., vol. 2271, pp. 236-243. Springer-Verlag, 2002.
27. S. L. Murphy, M. R. Badger, and B. Wellington. OSPF with digital signatures. Internet Engineering Task Force (IETF) Request for Comments (RFC) 2154, June 1997.
28. D. Naccache, D. Pointcheval, and J. Stern. Twin signatures: An alternative to the hash-and-sign paradigm. In P. Samarati, ed., Proceedings of the Eighth Annual ACM Conference on Computer and Communications Security, pp. 20-27. ACM Press, 2001.
29. K. Nyberg and R. A. Rueppel. Message recovery for signature schemes based on the discrete logarithm problem. In Designs, Codes, and Cryptography, vol. 7(1-2), pp. 61-81. Kluwer Academic Publishers, 1996.
30. R. Pang and V. Paxson. A High-level Programming Environment for Packet Trace Anonymization and Transformation. In Proc. ACM SIGCOMM 2003.
31. R. Perlman. Network layer protocols with Byzantine robustness. Ph.D. thesis, Dept. of Elect. Eng. and Comp. Sci., Massachusetts Institute of Technology, August 1988.
32. M. Peuhkuri. A method to compress and anonymize packet traces. In Proceedings of the ACM SIGCOMM Internet Measurement Workshop, November 2001.
33. Y. Rekhter and T. Li. Border Gateway Protocol 4 (BGP-4), Internet Engineering Task Force (IETF) Request for Comments (RFC) 1771. March 1995.
34. R. Rivest. Two signature schemes. Slides from talk given at Cambridge University, Oct. 17, 2000. http://theory.lcs.mit.edu/rivest/publications.html
35. RSA Labs: RSA Cryptography Standard: EMSAPSS - PKCS#1 v2.1. (2002)
36. R. Steinfeld, L. Bull, and Y. Zheng. Content extraction signatures. In K. Kim, ed., Information Security and Cryptology-ICISC'01, Lect. Notes Comp. Sci., vol. 2288, pp. 285-304. Springer-Verlag, 2002.
37. S. F. Shahandashti, M. Salmasizadeh, and J. Mohajeri. A provably secure short transitive signature scheme from bilinear group pairs. In C. Blundo and S. Cimato, eds., Security in Communication Networks-SCN'04, Lect. Notes Comp. Sci., vol. 3352, pp. 60-76. Springer-Verlag, 2005.
38. United States of America Department of Health and Human Services. Standards for Privacy of Individually Identifiable Health Information: Final Rule, Federal Register: August 14, 2002, vol. 67, no. 157.
39. J. Xu, J. Fan, M. Ammar, and S. B. Moon. On the design and performance of prefix preserving IP traffic trace anonymization. In Proceedings of the ACM SIGCOMM Internet Measurement Workshop, November 2001.