{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:24:21Z","timestamp":1759638261577,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":31,"publisher":"ACM","license":[{"start":{"date-parts":[[2004,10,25]],"date-time":"2004-10-25T00:00:00Z","timestamp":1098662400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2004,10,25]]},"DOI":"10.1145\/1030083.1030105","type":"proceedings-article","created":{"date-parts":[[2005,1,30]],"date-time":"2005-01-30T17:55:16Z","timestamp":1107107716000},"page":"158-167","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":60,"title":["<i>k<\/i>\n            -anonymous secret handshakes with reusable credentials"],"prefix":"10.1145","author":[{"given":"Shouhuai","family":"Xu","sequence":"first","affiliation":[{"name":"University of Texas at San Antonio"}]},{"given":"Moti","family":"Yung","sequence":"additional","affiliation":[{"name":"Columbia University"}]}],"member":"320","published-online":{"date-parts":[[2004,10,25]]},"reference":[{"doi-asserted-by":"publisher","key":"e_1_3_2_1_1_1","DOI":"10.5555\/1765299.1765302"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_2_1","DOI":"10.1145\/586110.586118"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_3_1","DOI":"10.5555\/829515.830565"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_4_1","DOI":"10.5555\/647097.717024"},{"key":"e_1_3_2_1_5_1","first-page":"92","volume-title":"Optimal asymmetric encryption","author":"Bellare M.","year":"1995","unstructured":"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.]] 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.]]"},{"key":"e_1_3_2_1_6_1","first-page":"335","volume-title":"Proc. EUROCRYPT 84","author":"Blom R.","year":"1985","unstructured":"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.]] 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.]]"},{"key":"e_1_3_2_1_7_1","first-page":"471","volume-title":"Proc. CRYPTO 92","author":"Blundo C.","year":"1992","unstructured":"C. Blundo , A. DeSantis , A. Herzberg , S. Kutten , U. Vaccaro , and M. Yung . Perfectly-secure key distribution for dynamic conferences. In E. F. Brickell, editor , Proc. CRYPTO 92 , pages 471 -- 486 . Springer-Verlag , 1992 . Lecture Notes in Computer Science No. 740.]] C. Blundo, A. DeSantis, A. Herzberg, S. Kutten, U. Vaccaro, and M. Yung. Perfectly-secure key distribution for dynamic conferences. In E. F. Brickell, editor, Proc. CRYPTO 92, pages 471--486. Springer-Verlag, 1992. Lecture Notes in Computer Science No. 740.]]"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_8_1","DOI":"10.1007\/11542322_31"},{"key":"e_1_3_2_1_9_1","volume-title":"Advances in Cryptology - ASIACRYPT","author":"Castelluccia C.","year":"2004","unstructured":"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 .]] 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.]]"},{"key":"e_1_3_2_1_10_1","first-page":"199","volume-title":"Proc. CRYPTO 82","author":"Chaum D.","year":"1983","unstructured":"D. Chaum . Blind signatures for untraceable payments . In R. L. Rivest, A. Sherman, and D. Chaum, editors, Proc. CRYPTO 82 , pages 199 -- 203 , New York, 1983 . Plenum Press .]] D. Chaum. Blind signatures for untraceable payments. In R. L. Rivest, A. Sherman, and D. Chaum, editors, Proc. CRYPTO 82, pages 199--203, New York, 1983. Plenum Press.]]"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1007\/3-540-46416-6_22","volume-title":"Advances in Cryptology --- Eurocrypt '91","author":"Chaum D.","year":"1991","unstructured":"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.]] 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.]]"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_12_1","DOI":"10.5555\/646759.705842"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_13_1","DOI":"10.5555\/646763.706340"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_14_1","DOI":"10.1109\/TIT.1976.1055638"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_15_1","DOI":"10.1145\/103418.103474"},{"key":"e_1_3_2_1_16_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1007\/3-540-44647-8_16","volume-title":"Proc. CRYPTO","author":"Fujisaki E.","year":"2001","unstructured":"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.]] 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.]]"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_17_1","DOI":"10.1145\/6490.6503"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_18_1","DOI":"10.1137\/0217017"},{"key":"e_1_3_2_1_19_1","volume-title":"Internet Activities Board","author":"Harkins D.","year":"1998","unstructured":"D. Harkins and D. Carrel . RFC 2409: The Internet Key Exchange (IKE) . Internet Activities Board , 1998 .]] D. Harkins and D. Carrel. RFC 2409: The Internet Key Exchange (IKE). Internet Activities Board, 1998.]]"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_20_1","DOI":"10.1145\/1005140.1005142"},{"key":"e_1_3_2_1_21_1","first-page":"143","volume-title":"Proc. EUROCRYPT 96","author":"Jakobsson M.","unstructured":"M. Jakobsson , K. Sako , and R. Impagliazzo . Designated verifier proofs and their applications . In Proc. EUROCRYPT 96 , pages 143 -- 154 .]] M. Jakobsson, K. Sako, and R. Impagliazzo. Designated verifier proofs and their applications. In Proc. EUROCRYPT 96, pages 143--154.]]"},{"key":"e_1_3_2_1_22_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"400","DOI":"10.1007\/978-3-540-45146-4_24","volume-title":"Proc. CRYPTO","author":"Krawczyk H.","year":"2003","unstructured":"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.]] 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.]]"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_23_1","DOI":"10.1145\/872035.872061"},{"key":"e_1_3_2_1_24_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1007\/3-540-45708-9_31","volume-title":"Proc. CRYPTO","author":"Naor M.","year":"2002","unstructured":"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.]] 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.]]"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_25_1","DOI":"10.1145\/352600.352609"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_26_1","DOI":"10.5555\/646756.705376"},{"key":"e_1_3_2_1_27_1","first-page":"552","volume-title":"Advances in Cryptology--ASIACRYPT '2001","author":"Rivest R.","unstructured":"R. Rivest , A. Shamir , and Y. Tauman . How to leak a secret . In Advances in Cryptology--ASIACRYPT '2001 , pages 552 -- 565 .]] R. Rivest, A. Shamir, and Y. Tauman. How to leak a secret. In Advances in Cryptology--ASIACRYPT '2001, pages 552--565.]]"},{"key":"e_1_3_2_1_28_1","volume-title":"Proceedings of the Symposium on Cryptography and Information Security (SCIS)","author":"Sakai R.","year":"2002","unstructured":"R. Sakai , K. Ohgishi , and M. Kasahara . Cryptosystems based on pairing . In Proceedings of the Symposium on Cryptography and Information Security (SCIS) , 2002 .]] R. Sakai, K. Ohgishi, and M. Kasahara. Cryptosystems based on pairing. In Proceedings of the Symposium on Cryptography and Information Security (SCIS), 2002.]]"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_29_1","DOI":"10.1142\/S0218488502001648"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_30_1","DOI":"10.1145\/948109.948128"},{"unstructured":"S. Xu and M. Yung. k-anonymous secret handshakes with reusable credentials. Full version of the present paper.]]  S. Xu and M. Yung. k-anonymous secret handshakes with reusable credentials. Full version of the present paper.]]","key":"e_1_3_2_1_31_1"}],"event":{"sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control","ACM Association for Computing Machinery"],"acronym":"CCS04","name":"CCS04: 11th ACM Conference on Computer and Communications Security 2004","location":"Washington DC USA"},"container-title":["Proceedings of the 11th ACM conference on Computer and communications security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1030083.1030105","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1030083.1030105","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T16:25:07Z","timestamp":1750263907000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1030083.1030105"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,10,25]]},"references-count":31,"alternative-id":["10.1145\/1030083.1030105","10.1145\/1030083"],"URL":"https:\/\/doi.org\/10.1145\/1030083.1030105","relation":{},"subject":[],"published":{"date-parts":[[2004,10,25]]},"assertion":[{"value":"2004-10-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}