{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:38:41Z","timestamp":1750307921636,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":27,"publisher":"ACM","license":[{"start":{"date-parts":[[2007,3,20]],"date-time":"2007-03-20T00:00:00Z","timestamp":1174348800000},"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":[[2007,3,20]]},"DOI":"10.1145\/1229285.1229309","type":"proceedings-article","created":{"date-parts":[[2007,4,5]],"date-time":"2007-04-05T19:41:00Z","timestamp":1175802060000},"page":"161-172","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Concurrently-secure credential ownership proofs"],"prefix":"10.1145","author":[{"given":"Siamak","family":"Shahandashti","sequence":"first","affiliation":[{"name":"University of Wollongong, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Reihaneh","family":"Safavi-Naini","sequence":"additional","affiliation":[{"name":"University of Wollongong, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joonsang","family":"Baek","sequence":"additional","affiliation":[{"name":"Institute for Infocomm Research (I2R), Singapore"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2007,3,20]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/11593447_35"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"crossref","unstructured":"M.\n      Bellare\n     and \n      O.\n      Goldreich\n  . \n  On defining proofs of knowledge\n  . In E. F. Brickell editor CRYPTO volume \n  740\n   of \n  Lecture Notes in Computer Science pages \n  390\n  --\n  420\n  . \n  Springer 1992\n  .]]   M. Bellare and O. Goldreich. On defining proofs of knowledge. In E. F. Brickell editor CRYPTO volume 740 of Lecture Notes in Computer Science pages 390--420. Springer 1992.]]","DOI":"10.1007\/3-540-48071-4_28"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"crossref","unstructured":"M.\n      Bellare C.\n      Namprempre and \n      G.\n      Neven\n  . \n  Security proofs for identity-based identification and signature schemes\n  . In C. Cachin and J. Camenisch editors EUROCRYPT volume \n  3027\n   of \n  Lecture Notes in Computer Science pages \n  268\n  --\n  286\n  . \n  Springer 2004\n  .]]  M. Bellare C. Namprempre and G. Neven. Security proofs for identity-based identification and signature schemes. In C. Cachin and J. Camenisch editors EUROCRYPT volume 3027 of Lecture Notes in Computer Science pages 268--286. Springer 2004.]]","DOI":"10.1007\/978-3-540-24676-3_17"},{"key":"e_1_3_2_1_4_1","series-title":"Lecture Notes in Computer Science","first-page":"319","volume-title":"Financial Cryptography","author":"Bellare M.","year":"2001","unstructured":"M. Bellare , C. Namprempre , D. Pointcheval , and M. Semanko . The power of rsa inversion oracles and the security of chaum's rsa-based blind signature scheme . In P. F. Syverson, editor, Financial Cryptography , volume 2339 of Lecture Notes in Computer Science , pages 319 -- 338 . Springer , 2001 .]] M. Bellare, C. Namprempre, D. Pointcheval, and M. Semanko. The power of rsa inversion oracles and the security of chaum's rsa-based blind signature scheme. In P. F. Syverson, editor, Financial Cryptography, volume 2339 of Lecture Notes in Computer Science, pages 319--338. Springer, 2001.]]"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"crossref","unstructured":"M.\n      Bellare\n     and \n      A.\n      Palacio\n  . \n  Gq and schnorr identification schemes: Proofs of security against impersonation under active and concurrent attacks\n  . In M. Yung editor CRYPTO volume \n  2442\n   of \n  Lecture Notes in Computer Science pages \n  162\n  --\n  177\n  . \n  Springer 2002\n  .]]   M. Bellare and A. Palacio. Gq and schnorr identification schemes: Proofs of security against impersonation under active and concurrent attacks. In M. Yung editor CRYPTO volume 2442 of Lecture Notes in Computer Science pages 162--177. Springer 2002.]]","DOI":"10.1007\/3-540-45708-9_11"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/1754495.1754541"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"crossref","unstructured":"D.\n      Boneh\n     and \n      M. K.\n      Franklin\n  . \n  Identity-based encryption from the weil pairing\n  . In J. Kilian editor CRYPTO volume \n  2139\n   of \n  Lecture Notes in Computer Science pages \n  213\n  --\n  229\n  . \n  Springer 2001\n  .]]   D. Boneh and M. K. Franklin. Identity-based encryption from the weil pairing. In J. Kilian editor CRYPTO volume 2139 of Lecture Notes in Computer Science pages 213--229. Springer 2001.]]","DOI":"10.1007\/3-540-44647-8_13"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539701398521"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/4372.4373"},{"key":"e_1_3_2_1_11_1","first-page":"118","volume-title":"Odlyzko {25}","author":"Chaum D.","unstructured":"D. Chaum and J.-H. Evertse . A secure and privacy-protecting protocol for transmitting personal information between organizations . In Odlyzko {25} , pages 118 -- 167 .]] D. Chaum and J.-H. Evertse. A secure and privacy-protecting protocol for transmitting personal information between organizations. In Odlyzko {25}, pages 118--167.]]"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"crossref","unstructured":"J.-S.\n      Coron\n    .\n  On the exact security of full domain hash\n  . In M. Bellare editor CRYPTO volume \n  1880\n   of \n  Lecture Notes in Computer Science pages \n  229\n  --\n  235\n  . \n  Springer 2000\n  .]]   J.-S. Coron. On the exact security of full domain hash. In M. Bellare editor CRYPTO volume 1880 of Lecture Notes in Computer Science pages 229--235. Springer 2000.]]","DOI":"10.1007\/3-540-44598-6_14"},{"key":"e_1_3_2_1_13_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"354","DOI":"10.1007\/978-3-540-46588-1_24","volume-title":"Public Key Cryptography","author":"Cramer R.","year":"2000","unstructured":"R. Cramer , I. Damg\u00e5rd , and P. D. MacKenzie . Efficient zero-knowledge proofs of knowledge without intractability assumptions . In H. Imai and Y. Zheng, editors, Public Key Cryptography , volume 1751 of Lecture Notes in Computer Science , pages 354 -- 372 . Springer , 2000 .]] R. Cramer, I. Damg\u00e5rd, and P. D. MacKenzie. Efficient zero-knowledge proofs of knowledge without intractability assumptions. In H. Imai and Y. Zheng, editors, Public Key Cryptography, volume 1751 of Lecture Notes in Computer Science, pages 354--372. Springer, 2000.]]"},{"key":"e_1_3_2_1_14_1","first-page":"23","volume-title":"EUROCRYPT","author":"Desmedt Y.","year":"1988","unstructured":"Y. Desmedt . Subliminal-free authentication and signature (extended abstract) . In EUROCRYPT , pages 23 -- 33 , 1988 .]] Y. Desmedt. Subliminal-free authentication and signature (extended abstract). In EUROCRYPT, pages 23--33, 1988.]]"},{"key":"e_1_3_2_1_15_1","volume-title":"E82-A(1):69--76","author":"Desmedt Y.","year":"1999","unstructured":"Y. Desmedt and K. Kurosawa . Practical and proven zero-knowledge constant round variants of gq and schnorr. TIEICE: IEICE Transactions on Fundamentals of Electronics, Communications, and Computer Science , E82-A(1):69--76 , 1999 .]] Y. Desmedt and K. Kurosawa. Practical and proven zero-knowledge constant round variants of gq and schnorr. TIEICE: IEICE Transactions on Fundamentals of Electronics, Communications, and Computer Science, E82-A(1):69--76, 1999.]]"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795291562"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02351717"},{"key":"e_1_3_2_1_18_1","first-page":"186","volume-title":"Odlyzko {25}","author":"Fiat A.","unstructured":"A. Fiat and A. Shamir . How to prove yourself: Practical solutions to identification and signature problems . In Odlyzko {25} , pages 186 -- 194 .]] A. Fiat and A. Shamir. How to prove yourself: Practical solutions to identification and signature problems. In Odlyzko {25}, pages 186--194.]]"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1137\/0218012"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1137\/0217017"},{"key":"e_1_3_2_1_21_1","series-title":"Lecture Notes in Computer Science","first-page":"216","volume-title":"CRYPTO","author":"Guillou L. C.","year":"1988","unstructured":"L. C. Guillou and J.-J. Quisquater . A \"paradoxical\" indentity-based signature scheme resulting from zero-knowledge. In S. Goldwasser, editor, CRYPTO , volume 403 of Lecture Notes in Computer Science , pages 216 -- 231 . Springer , 1988 .]] L. C. Guillou and J.-J. Quisquater. A \"paradoxical\" indentity-based signature scheme resulting from zero-knowledge. In S. Goldwasser, editor, CRYPTO, volume 403 of Lecture Notes in Computer Science, pages 216--231. Springer, 1988.]]"},{"key":"e_1_3_2_1_22_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1007\/978-3-540-24632-9_18","volume-title":"Public Key Cryptography","author":"Kurosawa K.","year":"2004","unstructured":"K. Kurosawa and S.-H. Heng . From digital signature to id-based identification\/signature . In F. Bao, R. H. Deng, and J. Zhou, editors, Public Key Cryptography , volume 2947 of Lecture Notes in Computer Science , pages 248 -- 261 . Springer , 2004 .]] K. Kurosawa and S.-H. Heng. From digital signature to id-based identification\/signature. In F. Bao, R. H. Deng, and J. Zhou, editors, Public Key Cryptography, volume 2947 of Lecture Notes in Computer Science, pages 248--261. Springer, 2004.]]"},{"key":"e_1_3_2_1_24_1","series-title":"Lecture Notes in Computer Science","first-page":"184","volume-title":"Selected Areas in Cryptography","author":"Lysyanskaya A.","year":"1999","unstructured":"A. Lysyanskaya , R. L. Rivest , A. Sahai , and S. Wolf . Pseudonym systems . In H. M. Heys and C. M. Adams, editors, Selected Areas in Cryptography , volume 1758 of Lecture Notes in Computer Science , pages 184 -- 199 . Springer , 1999 .]] A. Lysyanskaya, R. L. Rivest, A. Sahai, and S. Wolf. Pseudonym systems. In H. M. Heys and C. M. Adams, editors, Selected Areas in Cryptography, volume 1758 of Lecture Notes in Computer Science, pages 184--199. Springer, 1999.]]"},{"key":"e_1_3_2_1_25_1","series-title":"Lecture Notes in Computer Science","volume-title":"Advances in Cryptology --- CRYPTO '86","author":"Odlyzko A. M.","year":"1986","unstructured":"A. M. Odlyzko , editor. Advances in Cryptology --- CRYPTO '86 , Santa Barbara , California, USA, 1986 , Proceedings, volume 263 of Lecture Notes in Computer Science . Springer , 1987.]] A. M. Odlyzko, editor. Advances in Cryptology --- CRYPTO '86, Santa Barbara, California, USA, 1986, Proceedings, volume 263 of Lecture Notes in Computer Science. Springer, 1987.]]"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"crossref","unstructured":"T.\n      Okamoto\n     and \n      K.\n      Ohta\n  . \n  How to utilize the randomness of zero-knowledge proofs\n  . In A. Menezes and S. A. Vanstone editors CRYPTO volume \n  537\n   of \n  Lecture Notes in Computer Science pages \n  456\n  --\n  475\n  . \n  Springer 1990\n  .]]   T. Okamoto and K. Ohta. How to utilize the randomness of zero-knowledge proofs. In A. Menezes and S. A. Vanstone editors CRYPTO volume 537 of Lecture Notes in Computer Science pages 456--475. Springer 1990.]]","DOI":"10.1007\/3-540-38424-3_33"},{"key":"e_1_3_2_1_27_1","first-page":"47","volume-title":"CRYPTO","author":"Shamir A.","year":"1984","unstructured":"A. Shamir . Identity-based cryptosystems and signature schemes . In CRYPTO , pages 47 -- 53 , 1984 .]] A. Shamir. Identity-based cryptosystems and signature schemes. In CRYPTO, pages 47--53, 1984.]]"},{"key":"e_1_3_2_1_28_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"523","DOI":"10.1007\/978-3-540-40061-5_33","volume-title":"C.-S","author":"Steinfeld R.","year":"2003","unstructured":"R. Steinfeld , L. Bull , H. Wang , and J. Pieprzyk . Universal designated-verifier signatures . In C.-S . Laih, editor, ASIACRYPT, volume 2894 of Lecture Notes in Computer Science , pages 523 -- 542 . Springer , 2003 .]] R. Steinfeld, L. Bull, H. Wang, and J. Pieprzyk. Universal designated-verifier signatures. In C.-S. Laih, editor, ASIACRYPT, volume 2894 of Lecture Notes in Computer Science, pages 523--542. Springer, 2003.]]"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/11426639_7"}],"event":{"name":"Asia CCS07: Asia CCS'07 ACM Symposium on Information, Computer and Communications Security","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"],"location":"Singapore","acronym":"Asia CCS07"},"container-title":["Proceedings of the 2nd ACM symposium on Information, computer and communications security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1229285.1229309","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1229285.1229309","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T14:51:36Z","timestamp":1750258296000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1229285.1229309"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,3,20]]},"references-count":27,"alternative-id":["10.1145\/1229285.1229309","10.1145\/1229285"],"URL":"https:\/\/doi.org\/10.1145\/1229285.1229309","relation":{},"subject":[],"published":{"date-parts":[[2007,3,20]]},"assertion":[{"value":"2007-03-20","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}