{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,16]],"date-time":"2026-05-16T04:00:17Z","timestamp":1778904017436,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":23,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,5,30]],"date-time":"2022-05-30T00:00:00Z","timestamp":1653868800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"ANR","award":["ANR-18-CE-39-0019-02"],"award-info":[{"award-number":["ANR-18-CE-39-0019-02"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,5,30]]},"DOI":"10.1145\/3488932.3517392","type":"proceedings-article","created":{"date-parts":[[2022,5,24]],"date-time":"2022-05-24T04:23:26Z","timestamp":1653366206000},"page":"1126-1138","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["EPID with Efficient Proof of Non-Revocation"],"prefix":"10.1145","author":[{"given":"Olivier","family":"Sanders","sequence":"first","affiliation":[{"name":"Orange Labs, Cesson-Sevigne, France"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2022,5,30]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-56880-1_5"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-39200-9_38"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30574-3_11"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-007-9005-7"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1030083.1030106"},{"key":"e_1_3_2_2_6_1","unstructured":"Sean Bowe. 2017. BLS12-381: New zk-SNARK Elliptic Curve Construction. https:\/\/electriccoin.co\/blog\/new-snark-curve\/.  Sean Bowe. 2017. BLS12-381: New zk-SNARK Elliptic Curve Construction. https:\/\/electriccoin.co\/blog\/new-snark-curve\/."},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1314333.1314337"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/SocialCom.2010.118"},{"key":"e_1_3_2_2_9_1","volume-title":"Enhanced Privacy ID: A Direct Anonymous Attestation Scheme with Enhanced Revocation Capabilities","author":"Brickell Ernie","year":"2012","unstructured":"Ernie Brickell and Jiangtao Li . 2012 . Enhanced Privacy ID: A Direct Anonymous Attestation Scheme with Enhanced Revocation Capabilities . IEEE Trans. Dependable Secur. Comput . (2012). Ernie Brickell and Jiangtao Li. 2012. Enhanced Privacy ID: A Direct Anonymous Attestation Scheme with Enhanced Revocation Capabilities. IEEE Trans. Dependable Secur. Comput. (2012)."},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1030083.1030103"},{"key":"e_1_3_2_2_11_1","volume-title":"Practical Verifiable Encryption and Decryption of Discrete Logarithms. In CRYPTO 2003 (LNCS","volume":"144","author":"Camenisch Jan","year":"2003","unstructured":"Jan Camenisch and Victor Shoup . 2003 . Practical Verifiable Encryption and Decryption of Discrete Logarithms. In CRYPTO 2003 (LNCS , Vol. 2729),, Dan Boneh (Ed.). Springer, Heidelberg, 126-- 144 . https:\/\/doi.org\/10.1007\/978-3-540-45146-4_8 10.1007\/978-3-540-45146-4_8 Jan Camenisch and Victor Shoup. 2003. Practical Verifiable Encryption and Decryption of Discrete Logarithms. In CRYPTO 2003 (LNCS, Vol. 2729),, Dan Boneh (Ed.). Springer, Heidelberg, 126--144. https:\/\/doi.org\/10.1007\/978-3-540-45146-4_8"},{"key":"e_1_3_2_2_12_1","volume-title":"Group Signatures. In EUROCRYPT'91 (LNCS","volume":"265","author":"Chaum David","year":"1991","unstructured":"David Chaum and Eug\u00e8ne van Heyst . 1991 . Group Signatures. In EUROCRYPT'91 (LNCS , Vol. 547), Donald W. Davies (Ed.). Springer, Heidelberg, 257-- 265 . https:\/\/doi.org\/10.1007\/3-540-46416-6_22 10.1007\/3-540-46416-6_22 David Chaum and Eug\u00e8ne van Heyst. 1991. Group Signatures. In EUROCRYPT'91 (LNCS, Vol. 547), Donald W. Davies (Ed.). Springer, Heidelberg, 257--265. https:\/\/doi.org\/10.1007\/3-540-46416-6_22"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30580-4_28"},{"key":"e_1_3_2_2_14_1","volume-title":"CRYPTO'86 (LNCS","volume":"194","author":"Fiat Amos","year":"1987","unstructured":"Amos Fiat and Adi Shamir . 1987 . How to Prove Yourself: Practical Solutions to Identification and Signature Problems . In CRYPTO'86 (LNCS , Vol. 263), Andrew M. Odlyzko (Ed.). Springer, Heidelberg, 186-- 194 . https:\/\/doi.org\/10.1007\/3-540-47721-7_12 10.1007\/3-540-47721-7_12 Amos Fiat and Adi Shamir. 1987. How to Prove Yourself: Practical Solutions to Identification and Signature Problems. In CRYPTO'86 (LNCS, Vol. 263), Andrew M. Odlyzko (Ed.). Springer, Heidelberg, 186--194. https:\/\/doi.org\/10.1007\/3-540-47721-7_12"},{"key":"e_1_3_2_2_15_1","volume-title":"Communication-Efficient Non-interactive Proofs of Knowledge with Online Extractors. In CRYPTO 2005 (LNCS","volume":"168","author":"Fischlin Marc","year":"2005","unstructured":"Marc Fischlin . 2005 . Communication-Efficient Non-interactive Proofs of Knowledge with Online Extractors. In CRYPTO 2005 (LNCS , Vol. 3621),, Victor Shoup (Ed.). Springer, Heidelberg, 152-- 168 . https:\/\/doi.org\/10.1007\/11535218_10 10.1007\/11535218_10 Marc Fischlin. 2005. Communication-Efficient Non-interactive Proofs of Knowledge with Online Extractors. In CRYPTO 2005 (LNCS, Vol. 3621),, Victor Shoup (Ed.). Springer, Heidelberg, 152--168. https:\/\/doi.org\/10.1007\/11535218_10"},{"key":"e_1_3_2_2_16_1","volume-title":"Smart","author":"Galbraith Steven D.","year":"2008","unstructured":"Steven D. Galbraith , Kenneth G. Paterson , and Nigel P . Smart . 2008 . Pairings for cryptographers. Discret. Appl. Math . (2008). Steven D. Galbraith, Kenneth G. Paterson, and Nigel P. Smart. 2008. Pairings for cryptographers. Discret. Appl. Math. (2008)."},{"key":"e_1_3_2_2_17_1","unstructured":"Intel. 2016. A Cost-Effective Foundation for End-to-End IoT Security White Paper. https:\/\/www.intel.ca\/content\/www\/ca\/en\/internet-of-things\/white-papers\/iot-identity-intel-epid-iot-security-white-paper.html.  Intel. 2016. A Cost-Effective Foundation for End-to-End IoT Security White Paper. https:\/\/www.intel.ca\/content\/www\/ca\/en\/internet-of-things\/white-papers\/iot-identity-intel-epid-iot-security-white-paper.html."},{"key":"e_1_3_2_2_18_1","unstructured":"ISO\/IEC. 2013. ISO\/IEC 20008--2:2013 Information technology - Security techniques - Anonymous digital signatures - Part 2: Mechanisms using a group public key. https:\/\/www.iso.org\/standard\/56916.html.  ISO\/IEC. 2013. ISO\/IEC 20008--2:2013 Information technology - Security techniques - Anonymous digital signatures - Part 2: Mechanisms using a group public key. https:\/\/www.iso.org\/standard\/56916.html."},{"key":"e_1_3_2_2_19_1","volume-title":"WISTP","author":"Kassem Nada El","year":"2019","unstructured":"Nada El Kassem , Lu\u00eds Fiolhais , Paulo Martins , Liqun Chen , and Leonel Sousa .2019. A Lattice-Based Enhanced Privacy ID . In WISTP 2019 . Nada El Kassem, Lu\u00eds Fiolhais, Paulo Martins, Liqun Chen, and Leonel Sousa.2019. A Lattice-Based Enhanced Privacy ID. In WISTP 2019."},{"key":"e_1_3_2_2_20_1","volume-title":"Progression-Free Sets and Sublinear Pairing-Based Non-Interactive Zero-Knowledge Arguments. In TCC 2012 (LNCS","volume":"189","author":"Lipmaa Helger","year":"2012","unstructured":"Helger Lipmaa . 2012 . Progression-Free Sets and Sublinear Pairing-Based Non-Interactive Zero-Knowledge Arguments. In TCC 2012 (LNCS , Vol. 7194), Ronald Cramer (Ed.). Springer, Heidelberg, 169-- 189 . https:\/\/doi.org\/10.1007\/978-3-642-28914-9_10 10.1007\/978-3-642-28914-9_10 Helger Lipmaa. 2012. Progression-Free Sets and Sublinear Pairing-Based Non-Interactive Zero-Knowledge Arguments. In TCC 2012 (LNCS, Vol. 7194), Ronald Cramer (Ed.). Springer, Heidelberg, 169--189. https:\/\/doi.org\/10.1007\/978-3-642-28914-9_10"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-29485-8_7"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-75539-3_8"},{"key":"e_1_3_2_2_23_1","volume-title":"Efficient Identification and Signatures for Smart Cards. In CRYPTO'89 (LNCS","volume":"252","author":"Schnorr Claus-Peter","year":"1990","unstructured":"Claus-Peter Schnorr . 1990 . Efficient Identification and Signatures for Smart Cards. In CRYPTO'89 (LNCS , Vol. 435),, Gilles Brassard (Ed.). Springer, Heidelberg, 239-- 252 . https:\/\/doi.org\/10.1007\/0-387-34805-0_22 10.1007\/0-387-34805-0_22 Claus-Peter Schnorr. 1990. Efficient Identification and Signatures for Smart Cards. In CRYPTO'89 (LNCS, Vol. 435),, Gilles Brassard (Ed.). Springer, Heidelberg, 239--252. https:\/\/doi.org\/10.1007\/0-387-34805-0_22"}],"event":{"name":"ASIA CCS '22: ACM Asia Conference on Computer and Communications Security","location":"Nagasaki Japan","acronym":"ASIA CCS '22","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"]},"container-title":["Proceedings of the 2022 ACM on Asia Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3488932.3517392","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3488932.3517392","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:48:29Z","timestamp":1750193309000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3488932.3517392"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,5,30]]},"references-count":23,"alternative-id":["10.1145\/3488932.3517392","10.1145\/3488932"],"URL":"https:\/\/doi.org\/10.1145\/3488932.3517392","relation":{},"subject":[],"published":{"date-parts":[[2022,5,30]]},"assertion":[{"value":"2022-05-30","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}