{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:19:45Z","timestamp":1750306785977,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":35,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,11,4]],"date-time":"2013-11-04T00:00:00Z","timestamp":1383523200000},"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":[[2013,11,4]]},"DOI":"10.1145\/2517840.2517857","type":"proceedings-article","created":{"date-parts":[[2013,11,12]],"date-time":"2013-11-12T15:29:36Z","timestamp":1384270176000},"page":"37-48","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["Optimally private access control"],"prefix":"10.1145","author":[{"given":"Markulf","family":"Kohlweiss","sequence":"first","affiliation":[{"name":"Microsoft Research, Cambridge, United Kingdom"}]},{"given":"Alfredo","family":"Rial","sequence":"additional","affiliation":[{"name":"IBM Research, Zurich, Switzerland"}]}],"member":"320","published-online":{"date-parts":[[2013,11,4]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"crossref","unstructured":"Masayuki\n      Abe Jens\n      Groth Kristiyan\n      Haralambiev and \n      Miyako\n      Ohkubo\n    .\n  Optimal structure-preserving signatures in asymmetric bilinear groups\n  . In Phillip Rogaway editor CRYPTO volume \n  6841\n   of \n  Lecture Notes in Computer Science pages \n  649\n  --\n  666\n  . \n  Springer 2011\n  .   Masayuki Abe Jens Groth Kristiyan Haralambiev and Miyako Ohkubo. Optimal structure-preserving signatures in asymmetric bilinear groups. In Phillip Rogaway editor CRYPTO volume 6841 of Lecture Notes in Computer Science pages 649--666. Springer 2011.","DOI":"10.1007\/978-3-642-22792-9_37"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-10366-7_26"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"crossref","unstructured":"Feng\n      Bao Robert H.\n      Deng and \n      Huafei\n      Zhu\n    .\n  Variations of diffie-hellman problem\n  . In Sihan Qing Dieter Gollmann and Jianying Zhou editors ICICS volume \n  2836\n   of \n  Lecture Notes in Computer Science pages \n  301\n  --\n  312\n  . \n  Springer 2003\n  .  Feng Bao Robert H. Deng and Huafei Zhu. Variations of diffie-hellman problem. In Sihan Qing Dieter Gollmann and Jianying Zhou editors ICICS volume 2836 of Lecture Notes in Computer Science pages 301--312. Springer 2003.","DOI":"10.1007\/978-3-540-39927-8_28"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/1802614.1802642"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/168588.168596"},{"key":"e_1_3_2_1_7_1","first-page":"274","volume-title":"EUROCRYPT","author":"Benaloh Josh Cohen","year":"1993","unstructured":"Josh Cohen Benaloh and Michael de Mare . One-way accumulators : A decentralized alternative to digital sinatures (extended abstract) . In EUROCRYPT , pages 274 -- 285 , 1993 . Josh Cohen Benaloh and Michael de Mare. One-way accumulators: A decentralized alternative to digital sinatures (extended abstract). In EUROCRYPT, pages 274--285, 1993."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/11535218_16"},{"key":"e_1_3_2_1_9_1","series-title":"LNCS","first-page":"318","volume-title":"Advances in Cryptology | EUROCRYPT '97","author":"Brands Stefan","year":"1997","unstructured":"Stefan Brands . Rapid demonstration of linear relations connected by boolean operators . In Walter Fumy, editor, Advances in Cryptology | EUROCRYPT '97 , volume 1233 of LNCS , pages 318 -- 333 . Springer Verlag , 1997 . Stefan Brands. Rapid demonstration of linear relations connected by boolean operators. In Walter Fumy, editor, Advances in Cryptology | EUROCRYPT '97, volume 1233 of LNCS, pages 318--333. Springer Verlag, 1997."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-32928-9_31"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1653662.1653679"},{"key":"e_1_3_2_1_13_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"192","DOI":"10.1007\/978-3-642-19379-8_12","volume-title":"Public Key Cryptography","author":"Camenisch Jan","year":"2011","unstructured":"Jan Camenisch , Maria Dubovitskaya , Gregory Neven , and Gregory M. Zaverucha . Oblivious transfer with hidden access control policies . In Dario Catalano, Nelly Fazio, Rosario Gennaro, and Antonio Nicolosi, editors, Public Key Cryptography , volume 6571 of Lecture Notes in Computer Science , pages 192 -- 209 . Springer , 2011 . Jan Camenisch, Maria Dubovitskaya, Gregory Neven, and Gregory M. Zaverucha. Oblivious transfer with hidden access control policies. In Dario Catalano, Nelly Fazio, Rosario Gennaro, and Antonio Nicolosi, editors, Public Key Cryptography, volume 6571 of Lecture Notes in Computer Science, pages 192--209. Springer, 2011."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/3088723.3088765"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-00468-1_27"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-25385-0_24"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"crossref","unstructured":"Jan\n      Camenisch\n     and \n      Anna\n      Lysyanskaya\n    .\n  An efficient system for non-transferable anonymous credentials with optional anonymity revocation\n  . In Birgit Pfitzmann editor EUROCRYPT volume \n  2045\n   of \n  Lecture Notes in Computer Science pages \n  93\n  --\n  118\n  . \n  Springer 2001\n  .   Jan Camenisch and Anna Lysyanskaya. An efficient system for non-transferable anonymous credentials with optional anonymity revocation. In Birgit Pfitzmann editor EUROCRYPT volume 2045 of Lecture Notes in Computer Science pages 93--118. Springer 2001.","DOI":"10.1007\/3-540-44987-6_7"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"crossref","unstructured":"Jan\n      Camenisch\n     and \n      Anna\n      Lysyanskaya\n    .\n  Dynamic accumulators and application to efficient revocation of anonymous credentials\n  . In Moti Yung editor CRYPTO volume \n  2442\n   of \n  Lecture Notes in Computer Science pages \n  61\n  --\n  76\n  . \n  Springer 2002\n  .   Jan Camenisch and Anna Lysyanskaya. Dynamic accumulators and application to efficient revocation of anonymous credentials. In Moti Yung editor CRYPTO volume 2442 of Lecture Notes in Computer Science pages 61--76. Springer 2002.","DOI":"10.1007\/3-540-45708-9_5"},{"key":"e_1_3_2_1_19_1","first-page":"268","volume-title":"SCN","author":"Camenisch Jan","year":"2002","unstructured":"Jan Camenisch and Anna Lysyanskaya . A signature scheme with efficient protocols . In SCN , pages 268 -- 289 , 2002 . Jan Camenisch and Anna Lysyanskaya. A signature scheme with efficient protocols. In SCN, pages 268--289, 2002."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"crossref","unstructured":"Jan\n      Camenisch\n     and \n      Anna\n      Lysyanskaya\n    .\n  Signature schemes and anonymous credentials from bilinear maps\n  . In Matthew K. Franklin editor CRYPTO volume \n  3152\n   of \n  Lecture Notes in Computer Science pages \n  56\n  --\n  72\n  . \n  Springer 2004\n  .  Jan Camenisch and Anna Lysyanskaya. Signature schemes and anonymous credentials from bilinear maps. In Matthew K. Franklin editor CRYPTO volume 3152 of Lecture Notes in Computer Science pages 56--72. Springer 2004.","DOI":"10.1007\/978-3-540-28628-8_4"},{"key":"e_1_3_2_1_21_1","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1007\/3-540-48910-X_8","volume-title":"Advances in Cryptology | EUROCRYPT '99","author":"Camenisch Jan","year":"1999","unstructured":"Jan Camenisch and Markus Michels . Proving in zero-knowledge that a number n is the product of two safe primes . In Jacques Stern, editor, Advances in Cryptology | EUROCRYPT '99 , volume 1592 of LNCS , pages 107 -- 122 . Springer Verlag , 1999 . Jan Camenisch and Markus Michels. Proving in zero-knowledge that a number n is the product of two safe primes. In Jacques Stern, editor, Advances in Cryptology | EUROCRYPT '99, volume 1592 of LNCS, pages 107--122. Springer Verlag, 1999."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.5555\/874063.875553"},{"key":"e_1_3_2_1_23_1","volume-title":"Vector commitments and their applications","author":"Catalano Dario","year":"2013","unstructured":"Dario Catalano and Dario Fiore . Vector commitments and their applications , 2013 . Dario Catalano and Dario Fiore. Vector commitments and their applications, 2013."},{"key":"e_1_3_2_1_24_1","series-title":"LNCS","first-page":"89","volume-title":"CRYPTO '92","author":"Chaum D.","year":"1993","unstructured":"D. Chaum and T. Pedersen . Wallet databases with observers . In CRYPTO '92 , volume 740 of LNCS , pages 89 -- 105 , 1993 . D. Chaum and T. Pedersen. Wallet databases with observers. In CRYPTO '92, volume 740 of LNCS, pages 89--105, 1993."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-00468-1_28"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.5555\/646759.705842"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-31680-7_2"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"crossref","unstructured":"A.\n      Fiat\n     and \n      A.\n      Shamir\n  . \n  How to prove yourself: Practical solutions to identification and signature problems\n  . In A. Odlyzko editor CRYPTO volume \n  263\n   of \n  LNCS 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. Odlyzko editor CRYPTO volume 263 of LNCS pages 186--194. Springer 1986.","DOI":"10.1007\/3-540-47721-7_12"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/11818175_4"},{"key":"e_1_3_2_1_31_1","volume-title":"Gnuc: A new universal composability framework. IACR Cryptology ePrint Archive","author":"Hofheinz Dennis","year":"2011","unstructured":"Dennis Hofheinz and Victor Shoup . Gnuc: A new universal composability framework. IACR Cryptology ePrint Archive , 2011 :303, 2011. Dennis Hofheinz and Victor Shoup. Gnuc: A new universal composability framework. IACR Cryptology ePrint Archive, 2011:303, 2011."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.5555\/1531954"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"crossref","unstructured":"Aniket\n      Kate Gregory M.\n      Zaverucha and \n      Ian\n      Goldberg\n    .\n  Constant-size commitments to polynomials and their applications\n  . In Masayuki Abe editor ASIACRYPT volume \n  6477\n   of \n  Lecture Notes in Computer Science pages \n  177\n  --\n  194\n  . \n  Springer 2010\n  .  Aniket Kate Gregory M. Zaverucha and Ian Goldberg. Constant-size commitments to polynomials and their applications. In Masayuki Abe editor ASIACRYPT volume 6477 of Lecture Notes in Computer Science pages 177--194. Springer 2010.","DOI":"10.1007\/978-3-642-17373-8_11"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"crossref","unstructured":"Benot\n      Libert Thomas\n      Peters and \n      Moti\n      Yung\n    .\n  Group signatures with almost-for-free revocation\n  . In Reihaneh Safavi-Naini and Ran Canetti editors CRYPTO volume \n  7417\n   of \n  Lecture Notes in Computer Science pages \n  571\n  --\n  589\n  . \n  Springer 2012\n  .  Benot Libert Thomas Peters and Moti Yung. Group signatures with almost-for-free revocation. In Reihaneh Safavi-Naini and Ran Canetti editors CRYPTO volume 7417 of Lecture Notes in Computer Science pages 571--589. Springer 2012.","DOI":"10.1007\/978-3-642-32009-5_34"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-11799-2_30"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2013.34"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00196725"},{"key":"e_1_3_2_1_38_1","volume-title":"Security and Trust Management - 9th International Workshop (STM","author":"Sultana Nik","year":"2013","unstructured":"Nik Sultana , Moritz Y. Becker , and Markulf Kohlweiss . Selective disclosure in datalog-based trust management . In Security and Trust Management - 9th International Workshop (STM 2013 ), 2013. Nik Sultana, Moritz Y. Becker, and Markulf Kohlweiss. Selective disclosure in datalog-based trust management. In Security and Trust Management - 9th International Workshop (STM 2013), 2013."}],"event":{"name":"CCS'13: 2013 ACM SIGSAC Conference on Computer and Communications Security","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"],"location":"Berlin Germany","acronym":"CCS'13"},"container-title":["Proceedings of the 12th ACM workshop on Workshop on privacy in the electronic society"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2517840.2517857","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2517840.2517857","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:34:14Z","timestamp":1750232054000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2517840.2517857"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,11,4]]},"references-count":35,"alternative-id":["10.1145\/2517840.2517857","10.1145\/2517840"],"URL":"https:\/\/doi.org\/10.1145\/2517840.2517857","relation":{},"subject":[],"published":{"date-parts":[[2013,11,4]]},"assertion":[{"value":"2013-11-04","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}