{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:25:18Z","timestamp":1750307118322,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":34,"publisher":"ACM","license":[{"start":{"date-parts":[[2011,10,17]],"date-time":"2011-10-17T00:00:00Z","timestamp":1318809600000},"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":[[2011,10,17]]},"DOI":"10.1145\/2046556.2046567","type":"proceedings-article","created":{"date-parts":[[2011,10,18]],"date-time":"2011-10-18T13:02:00Z","timestamp":1318942920000},"page":"81-92","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["Non-interactive distributed encryption"],"prefix":"10.1145","author":[{"given":"Jaap-Henk","family":"Hoepman","sequence":"first","affiliation":[{"name":"TNO \/ Radboud University Nijmegen, Groningen, Netherlands"}]},{"given":"David","family":"Galindo","sequence":"additional","affiliation":[{"name":"University of Luxembourg, Luxembourg, Luxembourg"}]}],"member":"320","published-online":{"date-parts":[[2011,10,17]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"583","volume-title":"Provably secure fair blind signatures with tight revocation","author":"Abe Masayuki","year":"2001","unstructured":"Masayuki Abe and Miyako Ohkubo . Provably secure fair blind signatures with tight revocation . In Colin Boyd, editor, ASIACRYPT, LNCS 2248, pages 583 -- 602 . Springer , 2001 . Masayuki Abe and Miyako Ohkubo. Provably secure fair blind signatures with tight revocation. In Colin Boyd, editor, ASIACRYPT, LNCS 2248, pages 583--602. Springer, 2001."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_2_1","DOI":"10.1007\/11832072_8"},{"key":"e_1_3_2_1_3_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1007\/978-3-540-24632-9_19","volume-title":"Public Key Cryptography","author":"Baek Joonsang","year":"2004","unstructured":"Joonsang Baek and Yuliang Zheng . Identity-based threshold decryption . In Feng Bao, Robert H. Deng, and Jianying Zhou, editors, Public Key Cryptography , volume 2947 of Lecture Notes in Computer Science , pages 262 -- 276 . Springer , 2004 . Joonsang Baek and Yuliang Zheng. Identity-based threshold decryption. In Feng Bao, Robert H. Deng, and Jianying Zhou, editors, Public Key Cryptography, volume 2947 of Lecture Notes in Computer Science, pages 262--276. Springer, 2004."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_4_1","DOI":"10.1007\/11693383_22"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_5_1","DOI":"10.1007\/s00145-008-9026-x"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_6_1","DOI":"10.1007\/11605805_15"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_7_1","DOI":"10.1137\/S0097539701398521"},{"doi-asserted-by":"crossref","unstructured":"Eric\n      Brier Jean-S\u00e9bastien\n      Coron Thomas\n      Icart David\n      Madore Hugues\n      Randriam and \n      Mehdi\n      Tibouchi\n    .\n  Efficient indifferentiable hashing into ordinary elliptic curves\n  . In Tal Rabin editor CRYPTO volume \n  6223\n   of \n  Lecture Notes in Computer Science pages \n  237\n  --\n  254\n  . \n  Springer 2010\n  .   Eric Brier Jean-S\u00e9bastien Coron Thomas Icart David Madore Hugues Randriam and Mehdi Tibouchi. Efficient indifferentiable hashing into ordinary elliptic curves. In Tal Rabin editor CRYPTO volume 6223 of Lecture Notes in Computer Science pages 237--254. Springer 2010.","key":"e_1_3_2_1_8_1","DOI":"10.1007\/978-3-642-14623-7_13"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_9_1","DOI":"10.1007\/s00145-005-0318-0"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_10_1","DOI":"10.1145\/1456424.1456426"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_11_1","DOI":"10.1145\/1180405.1180431"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_12_1","DOI":"10.1007\/11832072_10"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_13_1","DOI":"10.1145\/358549.358563"},{"key":"e_1_3_2_1_14_1","first-page":"319","volume-title":"Untraceable electronic cash","author":"Chaum David","year":"1988","unstructured":"David Chaum , Amos Fiat , and Moni Naor . Untraceable electronic cash . In Shafi Goldwasser, editor, CRYPTO, LNCS 403, pages 319 -- 327 . Springer , 1988 . David Chaum, Amos Fiat, and Moni Naor. Untraceable electronic cash. In Shafi Goldwasser, editor, CRYPTO, LNCS 403, pages 319--327. Springer, 1988."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_15_1","DOI":"10.1109\/SFCS.1985.64"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_16_1","DOI":"10.1007\/978-3-540-85174-5_18"},{"doi-asserted-by":"crossref","unstructured":"Yvo\n      Desmedt\n     and \n      Yair\n      Frankel\n    .\n  Threshold cryptosystems\n  . In Gilles Brassard editor CRYPTO volume \n  435\n   of \n  Lecture Notes in Computer Science pages \n  307\n  --\n  315\n  . \n  Springer 1989\n  .   Yvo Desmedt and Yair Frankel. Threshold cryptosystems. In Gilles Brassard editor CRYPTO volume 435 of Lecture Notes in Computer Science pages 307--315. Springer 1989.","key":"e_1_3_2_1_17_1","DOI":"10.1007\/0-387-34805-0_28"},{"doi-asserted-by":"crossref","unstructured":"Augusto Jun\n      Devegili Michael\n      Scott and \n      Ricardo\n      Dahab\n    .\n  Implementing cryptographic pairings over barreto-naehrig curves\n  . In Tsuyoshi Takagi Tatsuaki Okamoto Eiji Okamoto and Takeshi Okamoto editors Pairing volume \n  4575\n   of \n  Lecture Notes in Computer Science pages \n  197\n  --\n  207\n  . \n  Springer 2007\n  .   Augusto Jun Devegili Michael Scott and Ricardo Dahab. Implementing cryptographic pairings over barreto-naehrig curves. In Tsuyoshi Takagi Tatsuaki Okamoto Eiji Okamoto and Takeshi Okamoto editors Pairing volume 4575 of Lecture Notes in Computer Science pages 197--207. Springer 2007.","key":"e_1_3_2_1_18_1","DOI":"10.1007\/978-3-540-73489-5_10"},{"key":"e_1_3_2_1_19_1","series-title":"Lecture Notes in Computer Science","first-page":"1","volume-title":"Public Key Cryptography","author":"Dodis Yevgeniy","year":"2003","unstructured":"Yevgeniy Dodis . Efficient construction of (distributed) verifiable random functions . In Yvo Desmedt, editor, Public Key Cryptography , volume 2567 of Lecture Notes in Computer Science , pages 1 -- 17 . Springer , 2003 . Yevgeniy Dodis. Efficient construction of (distributed) verifiable random functions. In Yvo Desmedt, editor, Public Key Cryptography, volume 2567 of Lecture Notes in Computer Science, pages 1--17. Springer, 2003."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_20_1","DOI":"10.1016\/j.jss.2011.03.083"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_21_1","DOI":"10.1016\/0022-0000(84)90070-9"},{"issue":"2","key":"e_1_3_2_1_22_1","first-page":"16","article-title":"Revocable privacy","volume":"5","author":"Hoepman Jaap-Henk","year":"2009","unstructured":"Jaap-Henk Hoepman . Revocable privacy . ENISA Quarterly Review , 5 ( 2 ): 16 -- 17 , June 2009 . Jaap-Henk Hoepman. Revocable privacy. ENISA Quarterly Review, 5(2):16--17, June 2009.","journal-title":"ENISA Quarterly Review"},{"key":"e_1_3_2_1_23_1","volume-title":"Code and other laws of cyberspace","author":"Lessig Lawrence","year":"1999","unstructured":"Lawrence Lessig . Code and other laws of cyberspace . Basic Books , 1999 . Lawrence Lessig. Code and other laws of cyberspace. Basic Books, 1999."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_24_1","DOI":"10.1007\/s10623-003-1719-4"},{"key":"e_1_3_2_1_25_1","volume-title":"Wired","author":"Schneier Bruce","year":"2008","unstructured":"Bruce Schneier . What our top spy doesn't get: Security and privacy aren't opposites . Wired , January 2008 . Bruce Schneier. What our top spy doesn't get: Security and privacy aren't opposites. Wired, January 2008."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_26_1","DOI":"10.1145\/359168.359176"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_27_1","DOI":"10.1007\/BFb0054113"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_28_1","DOI":"10.1016\/j.dam.2006.07.004"},{"key":"e_1_3_2_1_29_1","volume-title":"Harvard University Press","author":"Solove Daniel J.","year":"2008","unstructured":"Daniel J. Solove . Understanding Privacy . Harvard University Press , 2008 . Daniel J. Solove. Understanding Privacy. Harvard University Press, 2008."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_31_1","DOI":"10.5555\/1755009.1755032"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_32_1","DOI":"10.1007\/11745853_34"},{"key":"e_1_3_2_1_33_1","first-page":"119","volume-title":"EUROCRYPT","author":"Eric","year":"1997","unstructured":"Eric R. Verheul and Henk C. A. van Tilborg. Binding ElGamal: A fraud-detectable alternative to key-escrow proposals . In EUROCRYPT , pages 119 -- 133 , 1997 . Eric R. Verheul and Henk C. A. van Tilborg. Binding ElGamal: A fraud-detectable alternative to key-escrow proposals. In EUROCRYPT, pages 119--133, 1997."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_34_1","DOI":"10.2307\/1321160"},{"doi-asserted-by":"crossref","unstructured":"Hoeteck\n      Wee\n    .\n  Threshold and revocation cryptosystems via extractable hash proofs\n  . In Kenneth G. Paterson editor EUROCRYPT volume \n  6632\n   of \n  Lecture Notes in Computer Science pages \n  589\n  --\n  609\n  . \n  Springer 2011\n  .   Hoeteck Wee. Threshold and revocation cryptosystems via extractable hash proofs. In Kenneth G. Paterson editor EUROCRYPT volume 6632 of Lecture Notes in Computer Science pages 589--609. Springer 2011.","key":"e_1_3_2_1_35_1","DOI":"10.1007\/978-3-642-20465-4_32"}],"event":{"sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"],"acronym":"CCS'11","name":"CCS'11: the ACM Conference on Computer and Communications Security","location":"Chicago Illinois USA"},"container-title":["Proceedings of the 10th annual ACM workshop on Privacy in the electronic society"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2046556.2046567","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2046556.2046567","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T09:48:19Z","timestamp":1750240099000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2046556.2046567"}},"subtitle":["a new primitive for revocable privacy"],"short-title":[],"issued":{"date-parts":[[2011,10,17]]},"references-count":34,"alternative-id":["10.1145\/2046556.2046567","10.1145\/2046556"],"URL":"https:\/\/doi.org\/10.1145\/2046556.2046567","relation":{},"subject":[],"published":{"date-parts":[[2011,10,17]]},"assertion":[{"value":"2011-10-17","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}