{"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":1750307921084,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":35,"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.1229310","type":"proceedings-article","created":{"date-parts":[[2007,4,5]],"date-time":"2007-04-05T19:41:00Z","timestamp":1175802060000},"page":"173-181","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Unconditionally secure ring authentication"],"prefix":"10.1145","author":[{"given":"Reihaneh","family":"Safavi-Naini","sequence":"first","affiliation":[{"name":"University of Wollongong, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shuhong","family":"Wang","sequence":"additional","affiliation":[{"name":"University of Wollongong, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yvo","family":"Desmedt","sequence":"additional","affiliation":[{"name":"University College London, London, UK"}],"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":"crossref","unstructured":"M.\n       \n      Bellare D.\n       \n      Micciancio and \n      \n      \n      B.\n       \n      Warinschi\n      \n  \n  . \n  Foundations of group signatures: Formal definitions simplified requirements and a construction based on general assumptions. In E. Biham editor EUROCRYPT volume \n  2656\n   of \n  Lecture Notes in Computer Science pages \n  614\n  --\n  629\n  . \n  Springer 2003\n  .]]  M. Bellare D. Micciancio and B. Warinschi. Foundations of group signatures: Formal definitions simplified requirements and a construction based on general assumptions. In E. Biham editor EUROCRYPT volume 2656 of Lecture Notes in Computer Science pages 614--629. Springer 2003.]]","DOI":"10.1007\/3-540-39200-9_38"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1998.2717"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1030083.1030103"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00206326"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"crossref","unstructured":"D.\n       \n      Chaum\n     and \n      \n      \n      E.\n       \n      van Heyst\n    .\n      \n  \n   \n  Group signatures. In D. W. Davies editor EUROCRYPT volume \n  547\n   of \n  Lecture Notes in Computer Science pages \n  257\n  --\n  265\n  . \n  Springer 1991\n  .]]  D. Chaum and E. van Heyst. Group signatures. In D. W. Davies editor EUROCRYPT volume 547 of Lecture Notes in Computer Science pages 257--265. Springer 1991.]]","DOI":"10.1007\/3-540-46416-6_22"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/131607.131630"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/S1389-1286(00)00169-9"},{"volume-title":"ISIT, page 383","year":"1998","author":"Desmedt Y.","key":"e_1_3_2_1_8_1"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2004.09.011"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"crossref","unstructured":"Y.\n       \n      Dodis L.\n       \n      Reyzin and \n      \n      \n      A.\n       \n      Smith\n      \n  \n  . \n  Fuzzy extractors: How to generate strong keys from biometrics and other noisy data. In C. Cachin and J. Camenisch editors EUROCRYPT volume \n  3027\n   of \n  Lecture Notes in Computer Science pages \n  523\n  --\n  540\n  . \n  Springer 2004\n  .]]  Y. Dodis L. Reyzin and A. Smith. Fuzzy extractors: How to generate strong keys from biometrics and other noisy data. In C. Cachin and J. Camenisch editors EUROCRYPT volume 3027 of Lecture Notes in Computer Science pages 523--540. Springer 2004.]]","DOI":"10.1007\/978-3-540-24676-3_31"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00191355"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"crossref","unstructured":"A.\n       \n      Fiat\n     and \n      \n      \n      A.\n       \n      Shamir\n      \n  \n  . \n  How to prove yourself: Practical solutions to identification and signature problems. In A. M. Odlyzko editor CRYPTO volume \n  263\n   of \n  Lecture Notes in Computer Science pages \n  186\n  --\n  194\n  . \n  Springer 1986\n  .]]   A. Fiat and A. Shamir. How to prove yourself: Practical solutions to identification and signature problems. In A. M. Odlyzko editor CRYPTO volume 263 of Lecture Notes in Computer Science pages 186--194. Springer 1986.]]","DOI":"10.1007\/3-540-47721-7_12"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"crossref","unstructured":"J. A.\n       \n      Garay J.\n       \n      Staddon and \n      \n      \n      A.\n       \n      Wool\n      \n  \n  . \n  Long-lived broadcast encryption. In M. Bellare editor CRYPTO volume \n  1880\n   of \n  Lecture Notes in Computer Science pages \n  333\n  --\n  352\n  . \n  Springer 2000\n  .]]   J. A. Garay J. Staddon and A. Wool. Long-lived broadcast encryption. In M. Bellare editor CRYPTO volume 1880 of Lecture Notes in Computer Science pages 333--352. Springer 2000.]]","DOI":"10.1007\/3-540-44598-6_21"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1964.1053689"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/11554868_11"},{"key":"e_1_3_2_1_16_1","first-page":"2104","article-title":"Hmac: Keyed-hasing for message authentication","author":"Krawczyk H.","year":"1997","journal-title":"IETF RFC"},{"volume-title":"Department of Computer Science","year":"2000","author":"Krovetz T.","key":"e_1_3_2_1_17_1"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"crossref","unstructured":"R.\n       \n      Kumar S.\n       \n      Rajagopalan and \n      \n      \n      A.\n       \n      Sahai\n      \n  \n  . \n  Coding constructions for blacklisting problems without computational assumptions. In M. J. Wiener editor CRYPTO volume \n  1666\n   of \n  Lecture Notes in Computer Science pages \n  609\n  --\n  623\n  . \n  Springer 1999\n  .]]   R. Kumar S. Rajagopalan and A. Sahai. Coding constructions for blacklisting problems without computational assumptions. In M. J. Wiener editor CRYPTO volume 1666 of Lecture Notes in Computer Science pages 609--623. Springer 1999.]]","DOI":"10.1007\/3-540-48405-1_38"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"crossref","unstructured":"K.\n       \n      Kurosawa\n     and \n      \n      \n      S.\n       \n      Obana\n      \n  \n  . \n  Characterisation of (k n) multi-receiver authentication\n  . In V. Varadharajan J. Pieprzyk and Y. Mu editors ACISP volume \n  1270\n   of \n  Lecture Notes in Computer Science pages \n  204\n  --\n  215\n  . \n  Springer 1997\n  .]]   K. Kurosawa and S. Obana. Characterisation of (k n) multi-receiver authentication. In V. Varadharajan J. Pieprzyk and Y. Mu editors ACISP volume 1270 of Lecture Notes in Computer Science pages 204--215. Springer 1997.]]","DOI":"10.1007\/BFb0027927"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"crossref","unstructured":"K. M.\n       \n      Martin\n     and \n      \n      \n      R.\n       \n      Safavi-Naini\n      \n  \n  . \n  Multisender authentication systems with unconditional security. In Y. Han T. Okamoto and S. Qing editors ICICS volume \n  1334\n   of \n  Lecture Notes in Computer Science pages \n  130\n  --\n  143\n  . \n  Springer 1997\n  .]]   K. M. Martin and R. Safavi-Naini. Multisender authentication systems with unconditional security. In Y. Han T. Okamoto and S. Qing editors ICICS volume 1334 of Lecture Notes in Computer Science pages 130--143. Springer 1997.]]","DOI":"10.1007\/BFb0028469"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(88)90068-6"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"crossref","unstructured":"M.\n       \n      Naor\n    .\n      \n  \n   \n  Deniable ring authentication. In M. Yung editor CRYPTO volume \n  2442\n   of \n  Lecture Notes in Computer Science pages \n  481\n  --\n  498\n  . \n  Springer 2002\n  .]]   M. Naor. Deniable ring authentication. In M. Yung editor CRYPTO volume 2442 of Lecture Notes in Computer Science pages 481--498. Springer 2002.]]","DOI":"10.1007\/3-540-45708-9_31"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"crossref","unstructured":"L.\n       \n      Nguyen\n     and \n      \n      \n      R.\n       \n      Safavi-Naini\n      \n  \n  . \n  Efficient and provably secure trapdoor-free group signature schemes from bilinear pairings. In P. J. Lee editor ASIACRYPT volume \n  3329\n   of \n  Lecture Notes in Computer Science pages \n  372\n  --\n  386\n  . \n  Springer 2004\n  .]]  L. Nguyen and R. Safavi-Naini. Efficient and provably secure trapdoor-free group signature schemes from bilinear pairings. In P. J. Lee editor ASIACRYPT volume 3329 of Lecture Notes in Computer Science pages 372--386. Springer 2004.]]","DOI":"10.1007\/978-3-540-30539-2_26"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"crossref","unstructured":"R. L.\n       \n      Rivest A.\n       \n      Shamir and \n      \n      \n      Y.\n       \n      Tauman\n      \n  \n  . \n  How to leak a secret. In C. Boyd editor ASIACRYPT volume \n  2248\n   of \n  Lecture Notes in Computer Science pages \n  552\n  --\n  565\n  . \n  Springer 2001\n  .]]   R. L. Rivest A. Shamir and Y. Tauman. How to leak a secret. In C. Boyd editor ASIACRYPT volume 2248 of Lecture Notes in Computer Science pages 552--565. Springer 2001.]]","DOI":"10.1007\/3-540-45682-1_32"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/100216.100269"},{"key":"e_1_3_2_1_26_1","first-page":"85","volume-title":"Theory and Practice in Information-Theoretic Security, ITW'05","author":"Safavi-Naini R.","year":"2005"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"crossref","unstructured":"A.\n       \n      Serjantov\n     and \n      \n      \n      G.\n       \n      Danezis\n      \n  \n  . \n  Towards an information theoretic metric for anonymity. In R. Dingledine and P. F. Syverson editors Privacy Enhancing Technologies volume \n  2482\n   of \n  Lecture Notes in Computer Science pages \n  41\n  --\n  53\n  . \n  Springer 2002\n  .]]  A. Serjantov and G. Danezis. Towards an information theoretic metric for anonymity. In R. Dingledine and P. F. Syverson editors Privacy Enhancing Technologies volume 2482 of Lecture Notes in Computer Science pages 41--53. Springer 2002.]]","DOI":"10.1007\/3-540-36467-6_4"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795293172"},{"volume-title":"ICM: Proceedings of the International Congress of Mathematicians","year":"1998","author":"Shor P. W.","key":"e_1_3_2_1_29_1"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"crossref","unstructured":"G. J.\n       \n      Simmons\n    .\n      \n  \n   \n  Authentication theory\/coding theory. In G. R. Blakley and D. Chaum editors CRYPTO volume \n  196\n   of \n  Lecture Notes in Computer Science pages \n  411\n  --\n  431\n  . \n  Springer 1984\n  .]]   G. J. Simmons. Authentication theory\/coding theory. In G. R. Blakley and D. Chaum editors CRYPTO volume 196 of Lecture Notes in Computer Science pages 411--431. Springer 1984.]]","DOI":"10.1007\/3-540-39568-7_32"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008268610932"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008209004667"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0378-3758(99)00131-7"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"crossref","unstructured":"D. R. Stinson and R. Wei. Generalized cover-free families. Discrete Mathematics 279(1--3):463--477 2004.]]  D. R. Stinson and R. Wei. Generalized cover-free families. Discrete Mathematics 279(1--3):463--477 2004.]]","DOI":"10.1016\/S0012-365X(03)00287-5"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(81)90033-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.1229310","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1229285.1229310","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.1229310"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,3,20]]},"references-count":35,"alternative-id":["10.1145\/1229285.1229310","10.1145\/1229285"],"URL":"https:\/\/doi.org\/10.1145\/1229285.1229310","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"}}]}}