κ-anonymous secret handshakes with reusable credentials

Proceedings of the ACM Conference on Computer and Communications Security

Volumn , Issue , 2004, Pages 158-167

  Xu, Shouhuai ^a   Yung, Moti ^b  

^a University of Texas at San Antonio   (United States)

^b Columbia University ^*  (United States)

Author keywords

Anonymity, unlinkability; Credential systems; Privacy preserving authentication; Reusable credentials; Secret handshake

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER NETWORKS; DISTRIBUTED COMPUTER SYSTEMS; ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS; ONLINE SYSTEMS; SECURITY OF DATA; TELECOMMUNICATION NETWORKS;

ANONYMITY; CREDENTIAL SYSTEMS; PRIVACY-PRESERVING AUTHENTICATION; REUSABLE CREDENTIALS; SECRET HANDSHAKE; UNLINKABILITY;

PUBLIC KEY CRYPTOGRAPHY;

EID: 14844289583     PISSN: 15437221     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1030083.1030105     Document Type: Conference Paper

References (31)

1. M. Abadi. Private authentication. In Proceedings of the 2002 Workshop on Privacy Enhancing Technologies, pages 27-40, 2003.
2. W. Aiello, S. Bellovin, M. Blaze, J. Ioannidis, O. Reingold, R. Canetti, and A. Keromytis. Efficient, dos-reeistant, secure key exchange for internet protocols. In V. Atluri, editor, Proc. of the 9th ACM Conference on Computer and Communications Security, pages 48-58. ACM Press, 2002.
3. D. Balfanz, G. Durfee, N. Shankar, D. Smetters, J. Staddon, and H. Wong. Secret handshakes from pairing-based key agreements. In 24th IEEE Symposium on Security and Privacy, Oakland, CA, May 2003.
4. M. Bellare, A. Boldyreva, A. Desai, and D. Pointcheval. Key-privacy in public-key encryption. In C. Boyd, editor, Advances in Cryptology-ASIACRYPT '2001, pages 566-582. Springer-Verlag, 2001. Lecture Notes in Computer Science No. 2248.
5. M. Bellare and P. Rogaway. Optimal asymmetric encryption. In A. D. Santis, editor, EUROCRYPT94, pages 92-111. Springer, 1995. Lecture Notes in Computer Science No. 950.
6. R. Blom. An optimal class of symmetric key generation systems. In T. Beth, N. Cot, and I. Ingemarsson, editors, Proc. EUROCRYPT 84, pages 335-338. Springer-Verlag, 1985. Lecture Notes in Computer Science No. 209.
7. C. Blundo, A. DeSantis, A. Herzberg, S. Kutten, U. Vaccaro, and M. Yung. Perfectly-secure key distribution for dynamic conferences. In E. P. Brickell, editor, Proc. CRYPTO 92, pages 471-486. Springer-Verlag, 1992. Lecture Notes in Computer Science No. 740.
8. C. Boyd, W. Mao, and K. Paterson. Deniable authenticated key establishment for internet protocols. In the Proceedings of Security Protocols, 2003.
9. C. Castelluccia, S. Jarecki, and G. Tsudik. Secret handshakes from ca-oblivious encryption. In P. Lee, editor, Advances in Cryptology - ASIACRYPT 2004, volume of Lecture Notes in Computer Science, pages Springer, 2004.
10. D. Chaum. Blind signatures for untraceable payments. In R. L. Rivest, A. Sherman, and D. Chaum, editors, Proc. CRYPTO 88, pages 199-203, New York, 1983. Plenum Press.
11. D. Chaum and E. V. Heyst. Group signatures. In D. W. Davies, editor, Advances in Cryptology - Eurocrypt '91, pages 257-265, Berlin, 1991. Springer-Verlag. Lecture Notes in Computer Science No. 547.
12. R. Cramer, I. Damgård, and B. Schoenmakers. Proofs of partial knowledge and simplified design of witness hiding protocols. In Y. G. Desmedt, editor, Proc. CRYPTO 94, pages 174-187. Springer, 1994. Lecture Notes in Computer Science No. 839.
13. R. Cramer and V. Shoup. A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack. In H. Krawczyk, editor, Proc. CRYPTO 98, pages 13-25. Springer-Verlag, 1998. Lecture Notes in Computer Science No. 1462.
14. W. Diffie and M. E. Hellman. New directions in cryptography. IEEE Trans. Inform. Theory, 11-22:644-854, Nov. 1976.
15. D. Dolev, C. Dwork, and M. Naor. Non-malleable cryptography. In Proc. 23rd ACM Symp. on Theory of Computing, pages 542-552. ACM, 1991.
16. E. Fujisaki, T. Okamoto, D. Pointcheval, and J. Stern. Rsa-oaep is secure under the rsa assumption. In J. Kilian, editor, Proc. CRYPTO 2001, volume 2139 of Lecture Notes in Computer Science, pages 260-274. Springer-Verlag, 2001.
17. O. Goldreich, S. Goldwasser, and S. Micali. How to construct random functions. Journal of the ACM, 33(4):792-807, Oct. 1986.
18. S. Goldwasser, S. Micali, and R. Rivest. A digital signature scheme secure against adaptive chosen-message attacks. SIAM J. Computing, 17(2):281-308, Apr. 1988.
19. D. Harkins and D. Carrel. RFC 2409: The Internet Key Exchange (IKE). Internet Activities Board, 1998.
20. J. Holt, R. Bradshaw, K. Seamons, and H. Orman. Hidden credentials. In Proceedings of 2nd ACM Workshop on Privacy in the Electronic Society, pages 147-173, 2003.
21. M. Jakobsson, K. Sako, and R. Impagliazzo, Designated verifier proofs and their applications. In Proc. EUROCRYPT 96, pages 143-154.
22. H. Krawczyk. Sigma: The 'sign-and-mac' approach to authenticated diffie-hellman and its use in the ike-protocols. In D. Boneh, editor, Proc. CRYPTO 2003, volume 2729 of Lecture Notes in Computer Science, pages 400-425. Springer-Verlag, 2002.
23. N. Li, W. Du, and D. Boneh. Oblivious signature-based envelope. In Proceedings of 82nd ACM Symposium on Principles of Distributed Computing (PODC), pages 182-189. ACM, 2003.
24. M. Naor. Deniable ring authentication. In M. Yung, editor, Proc. CRYPTO 2002, volume 2442 of Lecture Notes in Computer Science, pages 481-498. Springer-Verlag, 2002.
25. P. Persiano and I. Visconti. User privacy issues regarding certificates and the tls protocol: the design and implementation of the spsl protocol. In ACM Conference on Computer and Communications Security, pages 53-62. ACM, 2000.
26. C. Rackoff and D. R. Simon. Non-interactive zero-knowledge proof of knowledge and chosen ciphertext attack. In J. Feigenbaum, editor, Proc. CRYPTO 91, pages 433-444. Springer, 1992. Lecture Notes in Computer Science No. 576.
27. R. Rivest, A. Shamir, and Y. Tauman. How to leak a secret. In Advances in Cryptology-ASIACRYPT '2001, pages 552-565.
28. R. Sakai, K. Ohgishi, and M. Kasahara. Cryptosystems based on pairing. In Proceedings of the Symposium on Cryptography and Information Security (SCIS), 2002.
29. L. Sweeney. κ-anonymity: A model for protecting privacy. International Journal on Uncertainty, Fuzziness and Knowledge-based Systems, 10(5):557-570, 2002.
30. L. von Ahn, A. Bortz, and N. Hopper, k-anonymous message transmission. In V. Atluri, editor, Proc. of ACM-CCS 03, pages 122-130, Washington D.C., USA, October 2003. ACM, ACM Press.
31. S. Xu and M. Yung. k-anonymous secret handshakes with reusable credentials. Full version of the present paper.