{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,28]],"date-time":"2026-08-28T23:54:42Z","timestamp":1787961282444,"version":"build-2784847793"},"publisher-location":"New York, NY, USA","reference-count":39,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,7,1]],"date-time":"2024-07-01T00:00:00Z","timestamp":1719792000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100014748","name":"Clarendon Fund","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100014748","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,7]]},"DOI":"10.1145\/3634737.3637641","type":"proceedings-article","created":{"date-parts":[[2024,6,28]],"date-time":"2024-06-28T11:51:38Z","timestamp":1719575498000},"page":"1708-1723","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["ALLOSAUR: Accumulator with Low-Latency Oblivious Sublinear Anonymous credential Updates with Revocations"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0966-8114","authenticated-orcid":false,"given":"Samuel","family":"Jaques","sequence":"first","affiliation":[{"name":"University of Waterloo, Waterloo, Canada"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8907-5791","authenticated-orcid":false,"given":"Hart","family":"Montgomery","sequence":"additional","affiliation":[{"name":"The Linux Foundation, San Francisco, United States of America"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0005-6784-5889","authenticated-orcid":false,"given":"Michael","family":"Lodder","sequence":"additional","affiliation":[{"name":"Dakota State University, Madison, South Dakota, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2024,7]]},"reference":[{"key":"e_1_3_2_2_2_1","volume-title":"SCN 06 (LNCS","author":"Au Man Ho","unstructured":"Man Ho Au, Willy Susilo, and Yi Mu. 2006. Constant-Size Dynamic k-TAA. In SCN 06 (LNCS, Vol. 4116), Roberto De Prisco and Moti Yung (Eds.). Springer, Heidelberg, 111--125."},{"key":"e_1_3_2_2_3_1","volume-title":"2017 IEEE European Symposium on Security and Privacy (EuroS P). 301--315","author":"Baldimtsi Foteini","year":"2017","unstructured":"Foteini Baldimtsi, Jan Camenisch, Maria Dubovitskaya, Anna Lysyanskaya, Leonid Reyzin, Kai Samelin, and Sophia Yakoubov. 2017. Accumulators with Applications to Anonymity-Preserving Revocation. In 2017 IEEE European Symposium on Security and Privacy (EuroS P). 301--315. 10.1109\/EuroSP.2017.13"},{"key":"e_1_3_2_2_4_1","volume-title":"CT-RSA 2020 (LNCS","volume":"666","author":"Baldimtsi Foteini","year":"2020","unstructured":"Foteini Baldimtsi, Ran Canetti, and Sophia Yakoubov. 2020. Universally Composable Accumulators. In CT-RSA 2020 (LNCS, Vol. 12006), Stanislaw Jarecki (Ed.). Springer, Heidelberg, 638--666."},{"key":"e_1_3_2_2_5_1","volume-title":"SCN 02 (LNCS","author":"Barreto Paulo S. L. M.","unstructured":"Paulo S. L. M. Barreto, Ben Lynn, and Michael Scott. 2003. Constructing Elliptic Curves with Prescribed Embedding Degrees. In SCN 02 (LNCS, Vol. 2576), Stelvio Cimato, Clemente Galdi, and Giuseppe Persiano (Eds.). Springer, Heidelberg, 257--267."},{"key":"e_1_3_2_2_6_1","volume-title":"Foundations of Secure Interactive Computing. In CRYPTO'91 (LNCS","volume":"391","author":"Beaver Donald","year":"1992","unstructured":"Donald Beaver. 1992. Foundations of Secure Interactive Computing. In CRYPTO'91 (LNCS, Vol. 576), Joan Feigenbaum (Ed.). Springer, Heidelberg, 377--391."},{"key":"e_1_3_2_2_7_1","volume-title":"EURO-CRYPT'93 (LNCS","author":"Benaloh Josh Cohen","unstructured":"Josh Cohen Benaloh and Michael de Mare. 1994. One-Way Accumulators: A Decentralized Alternative to Digital Sinatures (Extended Abstract). In EURO-CRYPT'93 (LNCS, Vol. 765), Tor Helleseth (Ed.). Springer, Heidelberg, 274--285."},{"key":"e_1_3_2_2_8_1","volume-title":"Succinct","author":"Benarroch Daniel","unstructured":"Daniel Benarroch, Matteo Campanelli, Dario Fiore, Kobi Gurkan, and Dimitris Kolonelos. 2021. Zero-Knowledge Proofs for Set Membership: Efficient, Succinct, Modular. In Financial Cryptography and Data Security, Nikita Borisov and Claudia Diaz (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg, 393--414."},{"key":"e_1_3_2_2_9_1","volume-title":"CT-RSA 2021 (LNCS","volume":"298","author":"Biryukov Alex","year":"2021","unstructured":"Alex Biryukov, Aleksei Udovenko, and Giuseppe Vitto. 2021. Cryptanalysis of a Dynamic Universal Accumulator over Bilinear Groups. In CT-RSA 2021 (LNCS, Vol. 12704), Kenneth G. Paterson (Ed.). Springer, Heidelberg, 276--298."},{"key":"e_1_3_2_2_10_1","volume-title":"ACM CCS","author":"Bl\u00f6mer Johannes","year":"2019","unstructured":"Johannes Bl\u00f6mer, Jan Bobolz, Denis Diemert, and Fabian Eidens. 2019. Updatable Anonymous Credentials and Applications to Incentive Systems. In ACM CCS 2019, Lorenzo Cavallaro, Johannes Kinder, XiaoFeng Wang, and Jonathan Katz (Eds.). ACM Press, 1671--1685."},{"key":"e_1_3_2_2_11_1","volume-title":"Kaoutar Elkhiyaoui, and Bj\u00f6rn Tackmann.","author":"Bogatov Dmytro","year":"2019","unstructured":"Dmytro Bogatov, Angelo De Caro, Kaoutar Elkhiyaoui, and Bj\u00f6rn Tackmann. 2019. Anonymous Transactions with Revocation and Auditing in Hyperledger Fabric. Cryptology ePrint Archive, Report 2019\/1097. https:\/\/eprint.iacr.org\/2019\/1097."},{"key":"e_1_3_2_2_12_1","volume-title":"Short Group Signatures. In CRYPTO 2004 (LNCS","volume":"55","author":"Boneh Dan","year":"2004","unstructured":"Dan Boneh, Xavier Boyen, and Hovav Shacham. 2004. Short Group Signatures. In CRYPTO 2004 (LNCS, Vol. 3152), Matthew Franklin (Ed.). Springer, Heidelberg, 41--55."},{"key":"e_1_3_2_2_13_1","volume-title":"On the Impossibility of Batch Update for Cryptographic Accumulators. In LATINCRYPT 2010 (LNCS","author":"Camacho Philippe","year":"2010","unstructured":"Philippe Camacho and Alejandro Hevia. 2010. On the Impossibility of Batch Update for Cryptographic Accumulators. In LATINCRYPT 2010 (LNCS, Vol. 6212), Michel Abdalla and Paulo S. L. M. Barreto (Eds.). Springer, Heidelberg, 178--188."},{"key":"e_1_3_2_2_14_1","volume-title":"An Accumulator Based on Bilinear Maps and Efficient Revocation for Anonymous Credentials. In PKC 2009 (LNCS","volume":"500","author":"Camenisch Jan","year":"2009","unstructured":"Jan Camenisch, Markulf Kohlweiss, and Claudio Soriente. 2009. An Accumulator Based on Bilinear Maps and Efficient Revocation for Anonymous Credentials. In PKC 2009 (LNCS, Vol. 5443), Stanislaw Jarecki and Gene Tsudik (Eds.). Springer, Heidelberg, 481--500."},{"key":"e_1_3_2_2_15_1","volume-title":"CRYPTO 2002 (LNCS","volume":"76","author":"Camenisch Jan","year":"2002","unstructured":"Jan Camenisch and Anna Lysyanskaya. 2002. Dynamic Accumulators and Application to Efficient Revocation of Anonymous Credentials. In CRYPTO 2002 (LNCS, Vol. 2442), Moti Yung (Ed.). Springer, Heidelberg, 61--76."},{"key":"e_1_3_2_2_16_1","volume-title":"42nd","author":"Canetti Ran","unstructured":"Ran Canetti. 2001. Universally Composable Security: A New Paradigm for Cryptographic Protocols. In 42nd FOCS. IEEE Computer Society Press, 136--145."},{"key":"e_1_3_2_2_17_1","volume-title":"36th","author":"Chor Benny","unstructured":"Benny Chor, Oded Goldreich, Eyal Kushilevitz, and Madhu Sudan. 1995. Private Information Retrieval. In 36th FOCS. IEEE Computer Society Press, 41--50."},{"key":"e_1_3_2_2_18_1","volume-title":"EURO-CRYPT","author":"Corrigan-Gibbs Henry","year":"2022","unstructured":"Henry Corrigan-Gibbs, Alexandra Henzinger, and Dmitry Kogan. 2022. SingleServer Private Information Retrieval with Sublinear Amortized Time. In EURO-CRYPT 2022, Part II (LNCS). Springer, Heidelberg, 3--33."},{"key":"e_1_3_2_2_19_1","volume-title":"Practical Covertly Secure MPC for Dishonest Majority - Or: Breaking the SPDZ Limits. In ESORICS 2013 (LNCS","volume":"18","author":"Damg\u00e5rd Ivan","unstructured":"Ivan Damg\u00e5rd, Marcel Keller, Enrique Larraia, Valerio Pastro, Peter Scholl, and Nigel P. Smart. 2013. Practical Covertly Secure MPC for Dishonest Majority - Or: Breaking the SPDZ Limits. In ESORICS 2013 (LNCS, Vol. 8134), Jason Crampton, Sushil Jajodia, and Keith Mayes (Eds.). Springer, Heidelberg, 1--18."},{"key":"e_1_3_2_2_20_1","volume-title":"Single Database Private Information Retrieval Implies Oblivious Transfer. In EUROCRYPT 2000 (LNCS","volume":"138","author":"Crescenzo Giovanni Di","year":"2000","unstructured":"Giovanni Di Crescenzo, Tal Malkin, and Rafail Ostrovsky. 2000. Single Database Private Information Retrieval Implies Oblivious Transfer. In EUROCRYPT 2000 (LNCS, Vol. 1807), Bart Preneel (Ed.). Springer, Heidelberg, 122--138."},{"key":"e_1_3_2_2_21_1","volume-title":"ION - We Have Liftoff!","author":"Dingle Pamela","year":"2021","unstructured":"Pamela Dingle. 2021. ION - We Have Liftoff! (2021). https:\/\/techcommunity.microsoft.com\/t5\/identity-standards-blog\/ion-we-have-liftoff\/ba-p\/1441555"},{"key":"e_1_3_2_2_22_1","volume-title":"Syverson","author":"Dingledine Roger","year":"2004","unstructured":"Roger Dingledine, Nick Mathewson, and Paul F. Syverson. 2004. Tor: The Second-Generation Onion Router. In USENIX Security 2004, Matt Blaze (Ed.). USENIX Association, 303--320."},{"key":"e_1_3_2_2_23_1","unstructured":"Sovrin Foundation. 2019. Sovrin Network Now Ready for Digital Credential Issuers. (2019). https:\/\/sovrin.org\/sovrin-network-now-ready-for-digital-credential-issuers\/"},{"key":"e_1_3_2_2_24_1","volume-title":"EUROCRYPT","author":"Garay Juan A.","year":"2015","unstructured":"Juan A. Garay, Aggelos Kiayias, and Nikos Leonardos. 2015. The Bitcoin Backbone Protocol: Analysis and Applications. In EUROCRYPT 2015, Part II (LNCS, Vol. 9057), Elisabeth Oswald and Marc Fischlin (Eds.). Springer, Heidelberg, 281--310."},{"key":"e_1_3_2_2_25_1","volume-title":"CT-RSA 2021 (LNCS","volume":"551","author":"Helminger Lukas","year":"2021","unstructured":"Lukas Helminger, Daniel Kales, Sebastian Ramacher, and Roman Walch. 2021. Multi-party Revocation in Sovrin: Performance through Distributed Trust. In CT-RSA 2021 (LNCS, Vol. 12704), Kenneth G. Paterson (Ed.). Springer, Heidelberg, 527--551."},{"key":"e_1_3_2_2_26_1","unstructured":"Nader Helmy. 2021. Why we're launching MATTR VII. (2021). https:\/\/medium.com\/mattr-global\/launching-mattr-vii-4e11bcb9aaef"},{"key":"e_1_3_2_2_27_1","volume-title":"Proceedings of the 33rd Annual ACM Symposium on Applied Computing","author":"H\u00f6lzl Michael","year":"2018","unstructured":"Michael H\u00f6lzl, Michael Roland, Omid Mir, and Ren\u00e9 Mayrhofer. 2018. Bridging the Gap in Privacy-Preserving Revocation: Practical and Scalable Revocation of Mobile EIDs. In Proceedings of the 33rd Annual ACM Symposium on Applied Computing (Pau, France) (SAC '18). Association for Computing Machinery, New York, NY, USA, 1601--1609. 10.1145\/3167132.3167303"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10207-019-00458-7"},{"key":"e_1_3_2_2_29_1","volume-title":"CRYPTO","author":"Ishai Yuval","year":"2014","unstructured":"Yuval Ishai, Rafail Ostrovsky, and Vassilis Zikas. 2014. Secure Multi-Party Computation with Identifiable Abort. In CRYPTO 2014, Part II (LNCS, Vol. 8617), Juan A. Garay and Rosario Gennaro (Eds.). Springer, Heidelberg, 369--386."},{"key":"e_1_3_2_2_30_1","volume-title":"Efficient Constructions of Pairing Based Accumulators. In CSF 2021 Computer Security Foundations Symposium, Ralf K\u00fcsters and Dave Naumann (Eds.). IEEE Computer Society Press, 1--16","author":"Karantaidou Ioanna","year":"2021","unstructured":"Ioanna Karantaidou and Foteini Baldimtsi. 2021. Efficient Constructions of Pairing Based Accumulators. In CSF 2021 Computer Security Foundations Symposium, Ralf K\u00fcsters and Dave Naumann (Eds.). IEEE Computer Society Press, 1--16."},{"key":"e_1_3_2_2_31_1","volume-title":"MASCOT: Faster Malicious Arithmetic Secure Computation with Oblivious Transfer. In ACM CCS","author":"Keller Marcel","year":"2016","unstructured":"Marcel Keller, Emmanuela Orsini, and Peter Scholl. 2016. MASCOT: Faster Malicious Arithmetic Secure Computation with Oblivious Transfer. In ACM CCS 2016, Edgar R. Weippl, Stefan Katzenbeisser, Christopher Kruegel, Andrew C. Myers, and Shai Halevi (Eds.). ACM Press, 830--842."},{"key":"e_1_3_2_2_32_1","unstructured":"Michael Lodder. 2021. accumulator-rs. https:\/\/github.com\/mikelodder7\/accumulator-rs."},{"key":"e_1_3_2_2_33_1","volume-title":"CRYPTO'87 (LNCS","volume":"378","author":"Merkle Ralph C.","year":"1988","unstructured":"Ralph C. Merkle. 1988. A Digital Signature Based on a Conventional Encryption Function. In CRYPTO'87 (LNCS, Vol. 293), Carl Pomerance (Ed.). Springer, Heidelberg, 369--378."},{"key":"e_1_3_2_2_34_1","volume-title":"CT-RSA 2005 (LNCS","volume":"292","author":"Nguyen Lan","year":"2005","unstructured":"Lan Nguyen. 2005. Accumulators from Bilinear Pairings and Applications. In CT-RSA 2005 (LNCS, Vol. 3376), Alfred Menezes (Ed.). Springer, Heidelberg, 275--292."},{"key":"e_1_3_2_2_35_1","volume-title":"Confidential Communication Online.","author":"British Columbia Government","year":"2022","unstructured":"Government of British Columbia. 2022. BC Digital Trust: Confident, Confidential Communication Online. (2022). https:\/\/digital.gov.bc.ca\/digital-trust\/"},{"key":"e_1_3_2_2_36_1","unstructured":"Government of British Columbia. 2023. BC aims to cut government red tape with Hyperledger Indy. (2023). https:\/\/www.hyperledger.org\/learn\/publications\/orgbook-case-study"},{"key":"e_1_3_2_2_37_1","unstructured":"Government of Ontario. 2021. Digital ID in Ontario. (2021). https:\/\/www.ontario.ca\/page\/digital-id-ontario"},{"key":"e_1_3_2_2_38_1","volume-title":"Zero-knowledge identity for Web3.","author":"Team Polygon","year":"2022","unstructured":"Polygon Team. 2022. Introducing Polygon ID, Zero-knowledge identity for Web3. (2022). https:\/\/blog.polygon.technology\/introducing-polygon-id-zero-knowledge-own-your-identity-for-web3\/"},{"key":"e_1_3_2_2_39_1","unstructured":"Elizabeth M. Tanner. 2021. State of Rhode Island: Digital Government with Identity Blockchain. (2021). https:\/\/wiki.hyperledger.org\/download\/attachments\/2392775\/pssig-210702%20Blockchain%20presentation%20July%202%202021-FINAL.pdf"},{"key":"e_1_3_2_2_41_1","unstructured":"Laura Vuorenoja. 2021. Announcing Findy Agency. (2021). https:\/\/medium.com\/@lauravuo\/announcing-findy-agency-4107b467036f"}],"event":{"name":"ASIA CCS '24: 19th ACM Asia Conference on Computer and Communications Security","location":"Singapore Singapore","acronym":"ASIA CCS '24","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"]},"container-title":["Proceedings of the 19th ACM Asia Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3634737.3637641","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T23:44:05Z","timestamp":1750290245000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3634737.3637641"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7]]},"references-count":39,"alternative-id":["10.1145\/3634737.3637641","10.1145\/3634737"],"URL":"https:\/\/doi.org\/10.1145\/3634737.3637641","relation":{},"subject":[],"published":{"date-parts":[[2024,7]]},"assertion":[{"value":"2024-07-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}