{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,16]],"date-time":"2026-05-16T04:00:26Z","timestamp":1778904026560,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":48,"publisher":"ACM","license":[{"start":{"date-parts":[[2016,5,30]],"date-time":"2016-05-30T00:00:00Z","timestamp":1464566400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"European Research Council CryptoCloud project","award":["FP7\/2007-2013 Grant Agreement no. 339563 -- CryptoCloud"],"award-info":[{"award-number":["FP7\/2007-2013 Grant Agreement no. 339563 -- CryptoCloud"]}]},{"name":"Programme Avenir Lyon Saint-Etienne de l'Universit? de Lyon programme ``Investissements d'Avenir'","award":["ANR-11-IDEX-0007"],"award-info":[{"award-number":["ANR-11-IDEX-0007"]}]},{"name":"F.R.S.-F.N.R.S. (Belgium)"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2016,5,30]]},"DOI":"10.1145\/2897845.2897898","type":"proceedings-article","created":{"date-parts":[[2016,5,27]],"date-time":"2016-05-27T12:37:36Z","timestamp":1464352656000},"page":"511-522","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":20,"title":["Practical \"Signatures with Efficient Protocols\" from Simple Assumptions"],"prefix":"10.1145","author":[{"given":"Beno\u00eet","family":"Libert","sequence":"first","affiliation":[{"name":"Ecole Normale Sup\u00e9rieure de Lyon, Lyon, France"}]},{"given":"Fabrice","family":"Mouhartem","sequence":"additional","affiliation":[{"name":"Ecole Normale Sup\u00e9rieure de Lyon, Lyon, France"}]},{"given":"Thomas","family":"Peters","sequence":"additional","affiliation":[{"name":"Universit\u00e9 catholique de Louvain, Louvain-la-Neuve, Belgium"}]},{"given":"Moti","family":"Yung","sequence":"additional","affiliation":[{"name":"Snapchat and Columbia University, New York, NY, USA"}]}],"member":"320","published-online":{"date-parts":[[2016,5,30]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/1881412.1881428"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-85230-8_25"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/646765.759593"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/11832072_8"},{"key":"e_1_3_2_1_5_1","first-page":"480","volume-title":"Eurocrypt'97","author":"Baric N.","year":"1997","unstructured":"N. Baric , B. Pfitzmann . Collision-Free Accumulators and Fail-Stop Signature Schemes Without Trees . In Eurocrypt'97 , pp. 480 -- 494 , 1997 . N. Baric, B. Pfitzmann. Collision-Free Accumulators and Fail-Stop Signature Schemes Without Trees. In Eurocrypt'97, pp. 480--494, 1997."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03356-8_7"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/1802614.1802642"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.907471"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/1766171.1766225"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1180405.1180453"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30574-3_11"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/1885535.1885570"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24676-3_4"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-28628-8_3"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1653662.1653679"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/11426639_18"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/647086.715698"},{"key":"e_1_3_2_1_18_1","first-page":"268","volume-title":"SCN'04","author":"Camenisch J.","year":"2002","unstructured":"J. Camenisch , A. Lysyanskaya . A Signature Scheme with Efficient Protocols . In SCN'04 , pp. 268 -- 289 , 2002 . J. Camenisch , A. Lysyanskaya. A Signature Scheme with Efficient Protocols. In SCN'04, pp. 268--289, 2002."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-28628-8_4"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03549-4_7"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/4372.4373"},{"key":"e_1_3_2_1_22_1","first-page":"257","volume-title":"Eurocrypt'91","author":"Chaum D.","year":"1991","unstructured":"D. Chaum , E. van Heyst . Group Signatures . In Eurocrypt'91 , pp. 257 -- 265 , 1991 . D. Chaum, E. van Heyst. Group Signatures. In Eurocrypt'91, pp. 257--265, 1991."},{"key":"e_1_3_2_1_23_1","volume-title":"Modular Design of Secure, yet Practical Cryptographic Protocols. PhDThesis","author":"Cramer R.","year":"1996","unstructured":"R. Cramer . Modular Design of Secure, yet Practical Cryptographic Protocols. PhDThesis , University of Amsterdam , 1996 . R. Cramer. Modular Design of Secure, yet Practical Cryptographic Protocols. PhDThesis, University of Amsterdam, 1996."},{"key":"e_1_3_2_1_24_1","first-page":"354","volume-title":"P. MacKenzie. Efficient Zero-Knowledge Proofs of Knowledge Without Intractability Assumptions. In PKC'00","author":"Cramer R.","year":"2000","unstructured":"R. Cramer , I. Damg\u00e5rd , P. MacKenzie. Efficient Zero-Knowledge Proofs of Knowledge Without Intractability Assumptions. In PKC'00 , pp. 354 -- 372 , 2000 . R. Cramer, I. Damg\u00e5rd, P. MacKenzie. Efficient Zero-Knowledge Proofs of Knowledge Without Intractability Assumptions. In PKC'00, pp. 354--372, 2000."},{"key":"e_1_3_2_1_25_1","first-page":"13","volume-title":"Crypto'98","author":"Cramer R.","year":"1994","unstructured":"R. Cramer , V. Shoup . A Practical Public Key Cryptosystem Provably Secure Against Adaptive Chosen Ciphertext Attack . In Crypto'98 , pp. 13 -- 25 , 1994 . R. Cramer, V. Shoup. A Practical Public Key Cryptosystem Provably Secure Against Adaptive Chosen Ciphertext Attack. In Crypto'98, pp. 13--25, 1994."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.5555\/1756169.1756211"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/11958239_13"},{"key":"e_1_3_2_1_28_1","first-page":"186","volume-title":"Crypto'86","author":"Fiat A.","year":"2003","unstructured":"A. Fiat , A. Shamir . How to Prove Yourself: Practical Solutions to Identification and Signature Problems . In Crypto'86 , pp. 186 -- 194 , 2003 . A. Fiat, A. Shamir. How to Prove Yourself: Practical Solutions to Identification and Signature Problems. In Crypto'86, pp. 186--194, 2003."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13190-5_3"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.5555\/1766171.1766186"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.5555\/1781454.1781469"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.5555\/1788414.1788438"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-34961-4_4"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-42033-7_1"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-44381-1_17"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1504\/IJSN.2006.010821"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/948109.948132"},{"key":"e_1_3_2_1_38_1","first-page":"101","volume-title":"Quasi-Adaptive NIZK for Linear Subspaces Revisited In Eurocrypt'15","author":"Kiltz J.","year":"2015","unstructured":"J. Kiltz and H. Wee . Quasi-Adaptive NIZK for Linear Subspaces Revisited In Eurocrypt'15 , pp. 101 -- 128 , 2015 . J. Kiltz and H. Wee. Quasi-Adaptive NIZK for Linear Subspaces Revisited In Eurocrypt'15, pp. 101--128, 2015."},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40084-1_17"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-55220-5_29"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-48000-7_15"},{"key":"e_1_3_2_1_42_1","first-page":"184","volume-title":"Pseudonym Systems. In SAC'99","author":"Lysyanskaya A.","year":"2000","unstructured":"A. Lysyanskaya , R. L. Rivest , A. Sahai , S. Wolf . Pseudonym Systems. In SAC'99 , pp. 184 -- 199 , 2000 . A. Lysyanskaya, R. L. Rivest, A. Sahai, S. Wolf. Pseudonym Systems. In SAC'99, pp. 184--199, 2000."},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-00468-1_26"},{"key":"e_1_3_2_1_44_1","first-page":"458","volume-title":"FOCS,'97","author":"Naor M.","year":"1997","unstructured":"M. Naor , O. Reingold . Number-theoretic constructions of efficient pseudo-random functions . In FOCS,'97 , pp. 458 -- 467 , IEEE Press , 1997 . M. Naor, O. Reingold. Number-theoretic constructions of efficient pseudo-random functions. In FOCS,'97, pp. 458--467, IEEE Press, 1997."},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1007\/11681878_5"},{"key":"e_1_3_2_1_46_1","volume-title":"Short Randomizable Signatures. To appear in CT-RSA'16","author":"Pointcheval D.","year":"2016","unstructured":"D. Pointcheval and O. Sanders . Short Randomizable Signatures. To appear in CT-RSA'16 , 2016 . D. Pointcheval and O. Sanders. Short Randomizable Signatures. To appear in CT-RSA'16, 2016."},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1007\/s001450010003"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0054113"}],"event":{"name":"ASIA CCS '16: ACM Asia Conference on Computer and Communications Security","location":"Xi'an China","acronym":"ASIA CCS '16","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"]},"container-title":["Proceedings of the 11th ACM on Asia Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2897845.2897898","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2897845.2897898","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T05:07:01Z","timestamp":1750223221000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2897845.2897898"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,5,30]]},"references-count":48,"alternative-id":["10.1145\/2897845.2897898","10.1145\/2897845"],"URL":"https:\/\/doi.org\/10.1145\/2897845.2897898","relation":{},"subject":[],"published":{"date-parts":[[2016,5,30]]},"assertion":[{"value":"2016-05-30","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}