{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,7]],"date-time":"2025-12-07T13:09:28Z","timestamp":1765112968223,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":25,"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"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,5,30]]},"DOI":"10.1145\/3488932.3517424","type":"proceedings-article","created":{"date-parts":[[2022,5,24]],"date-time":"2022-05-24T04:23:26Z","timestamp":1653366206000},"page":"652-666","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["Veksel"],"prefix":"10.1145","author":[{"given":"Matteo","family":"Campanelli","sequence":"first","affiliation":[{"name":"Protocol Labs, Wilmington, DE, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mathias","family":"Hall-Andersen","sequence":"additional","affiliation":[{"name":"Aarhus University, Aarhus, Denmark"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2022,5,30]]},"reference":[{"key":"e_1_3_2_2_1_1","unstructured":"Monero block size (estimated from several blocks). https:\/\/localmonero.co\/blocks\/tx\/6a76504dc8f2e2cc05c533f8155d51710c9d3bee932192c251d4b0a992cf84a1.  Monero block size (estimated from several blocks). https:\/\/localmonero.co\/blocks\/tx\/6a76504dc8f2e2cc05c533f8155d51710c9d3bee932192c251d4b0a992cf84a1."},{"key":"e_1_3_2_2_2_1","unstructured":"Veksel implementation. https:\/\/github.com\/matteocam\/veksel.  Veksel implementation. https:\/\/github.com\/matteocam\/veksel."},{"key":"e_1_3_2_2_3_1","unstructured":"Zcash parameter generation. https:\/\/z.cash\/technology\/paramgen\/.  Zcash parameter generation. https:\/\/z.cash\/technology\/paramgen\/."},{"key":"e_1_3_2_2_4_1","first-page":"480","volume-title":"International conference on the theory and applications of cryptographic techniques","author":"Bari\u0107 N.","year":"1997","unstructured":"Bari\u0107 , N. , and Pfitzmann , B . Collision-free accumulators and fail-stop signature schemes without trees . In International conference on the theory and applications of cryptographic techniques ( 1997 ), Springer , pp. 480 -- 494 . Bari\u0107, N., and Pfitzmann, B. Collision-free accumulators and fail-stop signature schemes without trees. In International conference on the theory and applications of cryptographic techniques (1997), Springer, pp. 480--494."},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45682-1_33"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2014.36"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-64322-8_19"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-76900-2_3"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-26948-7_20"},{"key":"e_1_3_2_2_10_1","first-page":"1","volume-title":"Public-Key Cryptography and Computational Number Theory","author":"Buchmann J.","year":"2011","unstructured":"Buchmann , J. , and Hamdy , S . A survey on iq cryptography . In Public-Key Cryptography and Computational Number Theory ( 2011 ), pp. 1 -- 15 . Buchmann, J., and Hamdy, S. A survey on iq cryptography. In Public-Key Cryptography and Computational Number Theory (2011), pp. 1--15."},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2018.00020"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45708-9_5"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/3319535.3339820"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2001.959888"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0273-0979-07-01153-6"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-34578-5_23"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-49096-9_21"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/11935230_29"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-49896-5_11"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-46803-6_9"},{"key":"e_1_3_2_2_24_1","volume-title":"Zcash protocol specification, version","author":"Hopwood D.","year":"2020","unstructured":"Hopwood , D. , Bowe , S. , Hornby , T. , and Wilcox , N . Zcash protocol specification, version 2020 .1.15, 2020. Hopwood, D., Bowe, S., Hornby, T., and Wilcox, N. Zcash protocol specification, version 2020.1.15, 2020."},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/3319535.3345655"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2013.34"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-4139-7_10"},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-51280-4_25"}],"event":{"name":"ASIA CCS '22: ACM Asia Conference on Computer and Communications Security","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"],"location":"Nagasaki Japan","acronym":"ASIA CCS '22"},"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.3517424","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3488932.3517424","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:31:27Z","timestamp":1750188687000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3488932.3517424"}},"subtitle":["Simple, Efficient, Anonymous Payments with Large Anonymity Sets from Well-Studied Assumptions"],"short-title":[],"issued":{"date-parts":[[2022,5,30]]},"references-count":25,"alternative-id":["10.1145\/3488932.3517424","10.1145\/3488932"],"URL":"https:\/\/doi.org\/10.1145\/3488932.3517424","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"}}]}}