{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:34:51Z","timestamp":1750307691346,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":37,"publisher":"ACM","license":[{"start":{"date-parts":[[2008,10,31]],"date-time":"2008-10-31T00:00:00Z","timestamp":1225411200000},"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":[[2008,10,31]]},"DOI":"10.1145\/1456424.1456426","type":"proceedings-article","created":{"date-parts":[[2008,11,6]],"date-time":"2008-11-06T13:49:50Z","timestamp":1225979390000},"page":"1-8","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":11,"title":["Rethinking accountable privacy supporting services"],"prefix":"10.1145","author":[{"given":"Jan","family":"Camenisch","sequence":"first","affiliation":[{"name":"IBM Research, Zurich Research Laboratory, R\u00fcschlikon, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"Gro\u00df","sequence":"additional","affiliation":[{"name":"IBM Research, Zurich Research Laboratory, R\u00fcschlikon, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas S.","family":"Heydt-Benjamin","sequence":"additional","affiliation":[{"name":"IBM Research, Zurich Research Laboratory, R\u00fcschlikon, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2008,10,31]]},"reference":[{"key":"e_1_3_2_1_1_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1007\/11535218_13","volume-title":"Advances in Cryptology -- CRYPTO","author":"Abdalla M.","year":"2005","unstructured":"M. Abdalla , M. Bellare , D. Catalano , E. Kiltz , T. Kohno , T. Lange , J. Malone-Lee , G. Neven , P. Paillier , and H. Shi . Searchable encryption revisited: Consistency properties, relation to anonymous ibe, and extensions . In V. Shoup, editor, Advances in Cryptology -- CRYPTO 2005 , volume 3621 of Lecture Notes in Computer Science , pages 205 -- 222 . Springer Verlag , 2005. M. Abdalla, M. Bellare, D. Catalano, E. Kiltz, T. Kohno, T. Lange, J. Malone-Lee, G. Neven, P. Paillier, and H. Shi. Searchable encryption revisited: Consistency properties, relation to anonymous ibe, and extensions. In V. Shoup, editor, Advances in Cryptology -- CRYPTO 2005, volume 3621 of Lecture Notes in Computer Science, pages 205--222. Springer Verlag, 2005."},{"key":"e_1_3_2_1_2_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1007\/3-540-44598-6_16","volume-title":"Advances in Cryptology -- CRYPTO","author":"Ateniese G.","year":"2000","unstructured":"G. Ateniese , J. Camenisch , M. Joye , and G. Tsudik . A practical and provably secure coalition-resistant group signature scheme . In M. Bellare, editor, Advances in Cryptology -- CRYPTO 2000 , volume 1880 of Lecture Notes in Computer Science , pages 255 -- 270 . Springer Verlag , 2000. G. Ateniese, J. Camenisch, M. Joye, and G. Tsudik. A practical and provably secure coalition-resistant group signature scheme. In M. Bellare, editor, Advances in Cryptology -- CRYPTO 2000, volume 1880 of Lecture Notes in Computer Science, pages 255--270. Springer Verlag, 2000."},{"key":"e_1_3_2_1_3_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/978-3-540-28628-8_3","volume-title":"Advances in Cryptology CRYPTO","author":"Boneh D.","year":"2004","unstructured":"D. Boneh , X. Boyen , and H. Shacham . Short group signatures . In M. K. Franklin, editor, Advances in Cryptology CRYPTO 2004 , volume 3152 of Lecture Notes in Computer Science , pages 41 -- 55 . Springer Verlag , 2004. D. Boneh, X. Boyen, and H. Shacham. Short group signatures. In M. K. Franklin, editor, Advances in Cryptology CRYPTO 2004, volume 3152 of Lecture Notes in Computer Science, pages 41--55. Springer Verlag, 2004."},{"key":"e_1_3_2_1_4_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1007\/3-540-45539-6_31","volume-title":"Advances in Cryptology EUROCRYPT","author":"Boudot F.","year":"2000","unstructured":"F. Boudot . Efficient proofs that a committed number lies in an interval . In B. Preneel, editor, Advances in Cryptology EUROCRYPT 2000 , volume 1807 of Lecture Notes in Computer Science , pages 431 -- 444 . Springer Verlag , 2000. F. Boudot. Efficient proofs that a committed number lies in an interval. In B. Preneel, editor, Advances in Cryptology EUROCRYPT 2000, volume 1807 of Lecture Notes in Computer Science, pages 431--444. Springer Verlag, 2000."},{"key":"e_1_3_2_1_8_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"318","DOI":"10.1007\/3-540-69053-0_22","volume-title":"Advances in Cryptology -- EUROCRYPT '97","author":"Brands S.","year":"1997","unstructured":"S. Brands . Rapid demonstration of linear relations connected by boolean operators. In W. Fumy, editor, Advances in Cryptology -- EUROCRYPT '97 , volume 1233 of Lecture Notes in Computer Science , pages 318 -- 333 . Springer Verlag , 1997 . S. Brands. Rapid demonstration of linear relations connected by boolean operators. In W. Fumy, editor, Advances in Cryptology -- EUROCRYPT '97, volume 1233 of Lecture Notes in Computer Science, pages 318--333. Springer Verlag, 1997."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/517876"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1180405.1180431"},{"key":"e_1_3_2_1_11_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1007\/11426639_18","volume-title":"Advances in Cryptology -- Eurocrypt","author":"Camenisch J.","year":"2005","unstructured":"J. Camenisch , S. Hohenberger , and A. Lysyanskaya . Compact E-cash . In R. Cramer, editor, Advances in Cryptology -- Eurocrypt 2005 , volume 3494 of Lecture Notes in Computer Science , pages 302 -- 321 . Springer , 2005. J. Camenisch, S. Hohenberger, and A. Lysyanskaya. Compact E-cash. In R. Cramer, editor, Advances in Cryptology -- Eurocrypt 2005, volume 3494 of Lecture Notes in Computer Science, pages 302--321. Springer, 2005."},{"key":"e_1_3_2_1_12_1","volume-title":"IBM Research","author":"Camenisch J.","year":"2008","unstructured":"J. Camenisch , M. Kohlweiss , A. R. Dur\u00e1n , and C. Sheedy . Public key encryption with oblivious keyword search and its application to data retention. IBM Research Report RZ 3708 , IBM Research , May 2008 . http:\/\/domino.research.ibm.com\/library\/cyberdig.nsf\/index.html. J. Camenisch, M. Kohlweiss, A. R. Dur\u00e1n, and C. Sheedy. Public key encryption with oblivious keyword search and its application to data retention. IBM Research Report RZ 3708, IBM Research, May 2008. http:\/\/domino.research.ibm.com\/library\/cyberdig.nsf\/index.html."},{"key":"e_1_3_2_1_13_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1007\/3-540-44987-6_7","volume-title":"Advances in Cryptology -- EUROCRYPT","author":"Camenisch J.","year":"2001","unstructured":"J. Camenisch and A. Lysyanskaya . Efficient non-transferable anonymous multi-show credential system with optional anonymity revocation . In B. Pfitzmann, editor, Advances in Cryptology -- EUROCRYPT 2001 , volume 2045 of Lecture Notes in Computer Science , pages 93 -- 118 . Springer Verlag , 2001. J. Camenisch and A. Lysyanskaya. Efficient non-transferable anonymous multi-show credential system with optional anonymity revocation. In B. Pfitzmann, editor, Advances in Cryptology -- EUROCRYPT 2001, volume 2045 of Lecture Notes in Computer Science, pages 93--118. Springer Verlag, 2001."},{"key":"e_1_3_2_1_14_1","series-title":"Lecture Notes in Computer Science","first-page":"268","volume-title":"Security in Communication Networks","author":"Camenisch J.","year":"2002","unstructured":"J. Camenisch and A. Lysyanskaya . A signature scheme with efficient protocols . In S. Cimato, C. Galdi, and G. Persiano, editors, Security in Communication Networks , Third International Conference, SCN 2002 , volume 2576 of Lecture Notes in Computer Science , pages 268 -- 289 . Springer Verlag , 2003. J. Camenisch and A. Lysyanskaya. A signature scheme with efficient protocols. In S. Cimato, C. Galdi, and G. Persiano, editors, Security in Communication Networks, Third International Conference, SCN 2002, volume 2576 of Lecture Notes in Computer Science, pages 268--289. Springer Verlag, 2003."},{"key":"e_1_3_2_1_15_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1007\/978-3-540-28628-8_4","volume-title":"Advances in Cryptology -- CRYPTO","author":"Camenisch J.","year":"2004","unstructured":"J. Camenisch and A. Lysyanskaya . Signature schemes and anonymous credentials from bilinear maps . In M. K. Franklin, editor, Advances in Cryptology -- CRYPTO 2004 , volume 3152 of Lecture Notes in Computer Science , pages 56 -- 72 . Springer Verlag , 2004. J. Camenisch and A. Lysyanskaya. Signature schemes and anonymous credentials from bilinear maps. In M. K. Franklin, editor, Advances in Cryptology -- CRYPTO 2004, volume 3152 of Lecture Notes in Computer Science, pages 56--72. Springer Verlag, 2004."},{"key":"e_1_3_2_1_17_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1007\/3-540-48910-X_8","volume-title":"Advances in Cryptology -- EUROCRYPT '99","author":"Camenisch J.","year":"1999","unstructured":"J. Camenisch and M. Michels . Proving in zero-knowledge that a number n is the product of two safe primes . In J. Stern, editor, Advances in Cryptology -- EUROCRYPT '99 , volume 1592 of Lecture Notes in Computer Science , pages 107 -- 122 . Springer Verlag , 1999 . J. Camenisch and M. Michels. Proving in zero-knowledge that a number n is the product of two safe primes. In J. Stern, editor, Advances in Cryptology -- EUROCRYPT '99, volume 1592 of Lecture Notes in Computer Science, pages 107--122. Springer Verlag, 1999."},{"key":"e_1_3_2_1_18_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1007\/3-540-48405-1_27","volume-title":"Advances in Cryptology -- CRYPTO '99","author":"Camenisch J.","year":"1999","unstructured":"J. Camenisch and M. Michels . Separability and efficiency for generic group signature schemes . In M. Wiener, editor, Advances in Cryptology -- CRYPTO '99 , volume 1666 of Lecture Notes in Computer Science , pages 413 -- 430 . Springer Verlag , 1999 . J. Camenisch and M. Michels. Separability and efficiency for generic group signature schemes. In M. Wiener, editor, Advances in Cryptology -- CRYPTO '99, volume 1666 of Lecture Notes in Computer Science, pages 413--430. Springer Verlag, 1999."},{"key":"e_1_3_2_1_19_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1007\/978-3-540-45146-4_8","volume-title":"Advances in Cryptology -- CRYPTO","author":"Camenisch J.","year":"2003","unstructured":"J. Camenisch and V. Shoup . Practical verifiable encryption and decryption of discrete logarithms . In D. Boneh, editor, Advances in Cryptology -- CRYPTO 2003 , volume 2729 of Lecture Notes in Computer Science , pages 126 -- 144 , 2003. J. Camenisch and V. Shoup. Practical verifiable encryption and decryption of discrete logarithms. In D. Boneh, editor, Advances in Cryptology -- CRYPTO 2003, volume 2729 of Lecture Notes in Computer Science, pages 126--144, 2003."},{"key":"e_1_3_2_1_20_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"410","DOI":"10.1007\/BFb0052252","volume-title":"Advances in Cryptology -- CRYPTO '97","author":"Camenisch J.","year":"1997","unstructured":"J. Camenisch and M. Stadler . Efficient group signature schemes for large groups . In B. Kaliski, editor, Advances in Cryptology -- CRYPTO '97 , volume 1296 of Lecture Notes in Computer Science , pages 410 -- 424 . Springer Verlag , 1997 . J. Camenisch and M. Stadler. Efficient group signature schemes for large groups. In B. Kaliski, editor, Advances in Cryptology -- CRYPTO '97, volume 1296 of Lecture Notes in Computer Science, pages 410--424. Springer Verlag, 1997."},{"key":"e_1_3_2_1_22_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"561","DOI":"10.1007\/BFb0054154","volume-title":"Advances in Cryptology EUROCRYPT '98","author":"Chan A.","year":"1998","unstructured":"A. Chan , Y. Frankel , and Y. Tsiounis . Easy come -- easy go divisible cash . In K. Nyberg, editor, Advances in Cryptology EUROCRYPT '98 , volume 1403 of Lecture Notes in Computer Science , pages 561 -- 575 . Springer Verlag , 1998 . A. Chan, Y. Frankel, and Y. Tsiounis. Easy come -- easy go divisible cash. In K. Nyberg, editor, Advances in Cryptology EUROCRYPT '98, volume 1403 of Lecture Notes in Computer Science, pages 561--575. Springer Verlag, 1998."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/358549.358563"},{"key":"e_1_3_2_1_24_1","first-page":"199","volume-title":"Advances in Cryptology -- Proceedings of CRYPTO '82","author":"Chaum D.","year":"1983","unstructured":"D. Chaum . Blind signatures for untraceable payments . In D. Chaum, R. L. Rivest, and A. T. Sherman, editors, Advances in Cryptology -- Proceedings of CRYPTO '82 , pages 199 -- 203 . Plenum Press , 1983 . D. Chaum. Blind signatures for untraceable payments. In D. Chaum, R. L. Rivest, and A. T. Sherman, editors, Advances in Cryptology -- Proceedings of CRYPTO '82, pages 199--203. Plenum Press, 1983."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/4372.4373"},{"key":"e_1_3_2_1_26_1","series-title":"Lecture Notes in Computer Science","first-page":"118","volume-title":"Advances in Cryptology -- CRYPTO '86","author":"Chaum D.","year":"1987","unstructured":"D. Chaum and J.-H. Evertse . A secure and privacy-protecting protocol for transmitting personal information between organizations . In M. Odlyzko, editor, Advances in Cryptology -- CRYPTO '86 , volume 263 of Lecture Notes in Computer Science , pages 118 -- 167 . Springer-Verlag , 1987 . D. Chaum and J.-H. Evertse. A secure and privacy-protecting protocol for transmitting personal information between organizations. In M. Odlyzko, editor, Advances in Cryptology -- CRYPTO '86, volume 263 of Lecture Notes in Computer Science, pages 118--167. Springer-Verlag, 1987."},{"key":"e_1_3_2_1_27_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1007\/3-540-48071-4_7","volume-title":"Advances in Cryptology CRYPTO '92","author":"Chaum D.","year":"1993","unstructured":"D. Chaum and T. P. Pedersen . Wallet databases with observers . In E. F. Brickell, editor, Advances in Cryptology CRYPTO '92 , volume 740 of Lecture Notes in Computer Science , pages 89 -- 105 . Springer-Verlag , 1993 . D. Chaum and T. P. Pedersen. Wallet databases with observers. In E. F. Brickell, editor, Advances in Cryptology CRYPTO '92, volume 740 of Lecture Notes in Computer Science, pages 89--105. Springer-Verlag, 1993."},{"key":"e_1_3_2_1_28_1","series-title":"Lecture Notes in Computer Science","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. van Heyst . Group signatures . In D. W. Davies, editor, Advances in Cryptology -- EUROCRYPT '91 , volume 547 of Lecture Notes in Computer Science , pages 257 -- 265 . Springer-Verlag , 1991 . D. Chaum and E. van Heyst. Group signatures. In D. W. Davies, editor, Advances in Cryptology -- EUROCRYPT '91, volume 547 of Lecture Notes in Computer Science, pages 257--265. Springer-Verlag, 1991."},{"key":"e_1_3_2_1_29_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1007\/3-540-48658-5_19","volume-title":"Advances in Cryptology CRYPTO '94","author":"Cramer R.","year":"1994","unstructured":"R. Cramer , I. Damg\u00e5rd , and B. Schoenmakers . Proofs of partial knowledge and simplified design of witness hiding protocols . In Y. G. Desmedt, editor, Advances in Cryptology CRYPTO '94 , volume 839 of Lecture Notes in Computer Science , pages 174 -- 187 . Springer Verlag , 1994 . R. Cramer, I. Damg\u00e5rd, and B. Schoenmakers. Proofs of partial knowledge and simplified design of witness hiding protocols. In Y. G. Desmedt, editor, Advances in Cryptology CRYPTO '94, volume 839 of Lecture Notes in Computer Science, pages 174--187. Springer Verlag, 1994."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"crossref","unstructured":"I. Damg\u00e5rd and E. Fujisaki. An integer commitment scheme based on groups with hidden order. http:\/\/eprint.iacr.org\/2001 2001.  I. Damg\u00e5rd and E. Fujisaki. An integer commitment scheme based on groups with hidden order. http:\/\/eprint.iacr.org\/2001 2001.","DOI":"10.1007\/3-540-36178-2_8"},{"key":"e_1_3_2_1_31_1","series-title":"Lecture Notes in Computer Science","first-page":"186","volume-title":"Advances in Cryptology -- CRYPTO '86","author":"Fiat A.","year":"1987","unstructured":"A. Fiat and A. Shamir . How to prove yourself: Practical solutions to identification and signature problems . In A. M. Odlyzko, editor, Advances in Cryptology -- CRYPTO '86 , volume 263 of Lecture Notes in Computer Science , pages 186 -- 194 . Springer Verlag , 1987 . A. Fiat and A. Shamir. How to prove yourself: Practical solutions to identification and signature problems. In A. M. Odlyzko, editor, Advances in Cryptology -- CRYPTO '86, volume 263 of Lecture Notes in Computer Science, pages 186--194. Springer Verlag, 1987."},{"key":"e_1_3_2_1_32_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1007\/3-540-49649-1_21","volume-title":"Advances in Cryptology -- ASIACRYPT '98","author":"Frankel Y.","year":"1998","unstructured":"Y. Frankel , Y. Tsiounis , and M. Yung . Fair off-line e-cash made easy . In K. Kim and T. Matsumoto, editors, Advances in Cryptology -- ASIACRYPT '98 , volume 1514 of Lecture Notes in Computer Science , pages 257 -- 270 . Springer Verlag , 1998 . Y. Frankel, Y. Tsiounis, and M. Yung. Fair off-line e-cash made easy. In K. Kim and T. Matsumoto, editors, Advances in Cryptology -- ASIACRYPT '98, volume 1514 of Lecture Notes in Computer Science, pages 257--270. Springer Verlag, 1998."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"crossref","unstructured":"A.\n      Fujioka T.\n      Okamoto and \n      K.\n      Ohta\n  . \n  A practical secret voting scheme for large scale elections\n  . In J. Seberry and Y. Zheng editors ASIACRYPT volume \n  718\n   of \n  Lecture Notes in Computer Science pages \n  244\n  --\n  251\n  . \n  Springer 1992\n  .   A. Fujioka T. Okamoto and K. Ohta. A practical secret voting scheme for large scale elections. In J. Seberry and Y. Zheng editors ASIACRYPT volume 718 of Lecture Notes in Computer Science pages 244--251. Springer 1992.","DOI":"10.1007\/3-540-57220-1_66"},{"key":"e_1_3_2_1_34_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1007\/BFb0052225","volume-title":"Advances in Cryptology -- CRYPTO '97","author":"Fujisaki E.","year":"1997","unstructured":"E. Fujisaki and T. Okamoto . Statistical zero knowledge protocols to prove modular polynomial relations . In B. Kaliski, editor, Advances in Cryptology -- CRYPTO '97 , volume 1294 of Lecture Notes in Computer Science , pages 16 -- 30 . Springer Verlag , 1997 . E. Fujisaki and T. Okamoto. Statistical zero knowledge protocols to prove modular polynomial relations. In B. Kaliski, editor, Advances in Cryptology -- CRYPTO '97, volume 1294 of Lecture Notes in Computer Science, pages 16--30. Springer Verlag, 1997."},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1137\/0217017"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.5555\/1781454.1781477"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1504\/IJSN.2006.010821"},{"key":"e_1_3_2_1_38_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"571","DOI":"10.1007\/978-3-540-24676-3_34","volume-title":"Advances in Cryptology -- EUROCRYPT","author":"Kiayias A.","year":"2004","unstructured":"A. Kiayias , M. Yung , and Y. Tsiounis . Traceable signatures . In C. Cachin and J. Camenisch, editors, Advances in Cryptology -- EUROCRYPT 2004 , volume 3027 of Lecture Notes in Computer Science , pages 571 -- 589 . Springer , 2004. A. Kiayias, M. Yung, and Y. Tsiounis. Traceable signatures. In C. Cachin and J. Camenisch, editors, Advances in Cryptology -- EUROCRYPT 2004, volume 3027 of Lecture Notes in Computer Science, pages 571--589. Springer, 2004."},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/336992.337028"},{"key":"e_1_3_2_1_40_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/3-540-46766-1_9","volume-title":"Advances in Cryptology -- CRYPTO '91","author":"Pedersen T. P.","year":"1992","unstructured":"T. P. Pedersen . Non-interactive and information-theoretic secure verifiable secret sharing . In J. Feigenbaum, editor, Advances in Cryptology -- CRYPTO '91 , volume 576 of Lecture Notes in Computer Science , pages 129 -- 140 . Springer Verlag , 1992 . T. P. Pedersen. Non-interactive and information-theoretic secure verifiable secret sharing. In J. Feigenbaum, editor, Advances in Cryptology -- CRYPTO '91, volume 576 of Lecture Notes in Computer Science, pages 129--140. Springer Verlag, 1992."},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/359340.359342"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00196725"}],"event":{"name":"CCS08: 15th ACM Conference on Computer and Communications Security 2008","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control","ACM Association for Computing Machinery"],"location":"Alexandria Virginia USA","acronym":"CCS08"},"container-title":["Proceedings of the 4th ACM workshop on Digital identity management"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1456424.1456426","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1456424.1456426","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:29:54Z","timestamp":1750253394000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1456424.1456426"}},"subtitle":["extended abstract"],"short-title":[],"issued":{"date-parts":[[2008,10,31]]},"references-count":37,"alternative-id":["10.1145\/1456424.1456426","10.1145\/1456424"],"URL":"https:\/\/doi.org\/10.1145\/1456424.1456426","relation":{},"subject":[],"published":{"date-parts":[[2008,10,31]]},"assertion":[{"value":"2008-10-31","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}