{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,29]],"date-time":"2026-01-29T21:25:15Z","timestamp":1769721915594,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":77,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,11,12]],"date-time":"2021-11-12T00:00:00Z","timestamp":1636675200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"French ANR ALAMBIC project","award":["ANR-16-CE39-0006"],"award-info":[{"award-number":["ANR-16-CE39-0006"]}]},{"name":"Deutsche Forschungsgemeinschaft (DFG)","award":["442893093"],"award-info":[{"award-number":["442893093"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,11,12]]},"DOI":"10.1145\/3460120.3484773","type":"proceedings-article","created":{"date-parts":[[2021,11,13]],"date-time":"2021-11-13T12:05:34Z","timestamp":1636805134000},"page":"2663-2684","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":19,"title":["Efficient CCA Timed Commitments in Class Groups"],"prefix":"10.1145","author":[{"given":"Sri Aravinda Krishnan","family":"Thyagarajan","sequence":"first","affiliation":[{"name":"Friedrich Alexander Universit\u00e4t Erlangen-N\u00fcrnberg, N\u00fcrnberg, Germany"}]},{"given":"Guilhem","family":"Castagnos","sequence":"additional","affiliation":[{"name":"Universit\u00e9 de Bordeaux, INRIA, CNRS, Talence, France"}]},{"given":"Fabian","family":"Laguillaumie","sequence":"additional","affiliation":[{"name":"LIRMM, Universit\u00e9 of Montpellier, CNRS, Montpellier, France"}]},{"given":"Giulio","family":"Malavolta","sequence":"additional","affiliation":[{"name":"Max Planck Institute for Security and Privacy, Bochum, Germany"}]}],"member":"320","published-online":{"date-parts":[[2021,11,13]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"crossref","unstructured":"1] Navid Alamati Pedro Branco Nico D\u00f6ttling Sanjam Garg Mohammad Hajiabadi and Sihang Pu. 2021. Laconic Private Set Intersection and Applications. Cryptology ePrint Archive Report 2021\/728. https:\/\/ia.cr\/2021\/728.","DOI":"10.1007\/978-3-030-90456-2_4"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2011.40"},{"key":"e_1_3_2_2_3_1","volume-title":"Jesper Buus Nielsen, and Sabine Oechsner","author":"Baum Carsten","year":"2020","unstructured":"Carsten Baum, Bernardo David, Rafael Dowsley, Jesper Buus Nielsen, and Sabine Oechsner. 2020. TARDIS: A Foundation of Time-Lock Puzzles in UC. Cryptology ePrint Archive, Report 2020\/537. https:\/\/eprint.iacr.org\/2020\/537."},{"key":"e_1_3_2_2_4_1","unstructured":"Eli Ben-Sasson Iddo Bentov Yinon Horesh and Michael Riabzev. 2018. Scalable transparent and post-quantum secure computational integrity. Cryptology ePrint Archive Report 2018\/046. https:\/\/eprint.iacr.org\/2018\/046."},{"key":"e_1_3_2_2_5_1","unstructured":"Iddo Bentov Ariel Gabizon and David Zuckerman. 2016. Bitcoin Beacon. arXiv:1605.04559 [cs.CR]"},{"key":"e_1_3_2_2_6_1","volume-title":"Silvester","author":"Biasse Jean-Fran\u00e7ois","year":"2010","unstructured":"Jean-Fran\u00e7ois Biasse, Michael J. Jacobson, and Alan K. Silvester. 2010. Security Estimates for Quadratic Field Based Cryptosystems. In ACISP 10 (LNCS, Vol. 6168), Ron Steinfeld and Philip Hawkes (Eds.). Springer, Heidelberg, Germany, Sydney, NSW, Australia, 233--247."},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2840728.2840745"},{"key":"e_1_3_2_2_8_1","volume-title":"Proc. IEEE Spring COMPCOM. 133--137","author":"Blum Manuel","year":"1982","unstructured":"Manuel Blum. 1982. Coin Flipping by Telephone. In Proc. IEEE Spring COMPCOM. 133--137."},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/62212.62222"},{"key":"e_1_3_2_2_10_1","volume-title":"CRYPTO","volume":"11692","author":"Boldyreva Alexandra","year":"2019","unstructured":"Alexandra Boldyreva and Daniele Micciancio (Eds.). 2019. CRYPTO 2019, Part I. LNCS, Vol. 11692. Springer, Heidelberg, Germany, Santa Barbara, CA, USA."},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978--3--319--96884--1_25"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","unstructured":"Dan Boneh Benedikt B\u00fcnz and Ben Fisch. 2019. Batching Techniques for Accumulators with Applications to IOPs and Stateless Blockchains See [10] 561--586. https:\/\/doi.org\/10.1007\/978--3-030--26948--7_20","DOI":"10.1007\/978--3-030--26948--7_20"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/3--540--44598--6_15"},{"key":"e_1_3_2_2_14_1","unstructured":"Joseph Bonneau Jeremy Clark and Steven Goldfeder. 2015. On Bitcoin as a public randomness source. Cryptology ePrint Archive Report 2015\/1015. https:\/\/eprint.iacr.org\/2015\/1015."},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-36033-7_16"},{"key":"e_1_3_2_2_16_1","unstructured":"J. Buchmann and U. Vollmer. 2007. Binary Quadratic Forms. An Algorithmic Approach. Springer."},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02351719"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-45721-1_24"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-45721-1_24"},{"key":"e_1_3_2_2_20_1","unstructured":"Benedikt B\u00fcnz Steven Goldfeder and Joseph Bonneau. 2017. Proofs-of-delay and randomness beacons in Ethereum."},{"key":"e_1_3_2_2_21_1","unstructured":"Jeffrey Burdges and Luca De Feo. 2020. Delay Encryption. Cryptology ePrint Archive Report 2020\/638. https:\/\/eprint.iacr.org\/2020\/638."},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/343477.343531"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/978--3--319--61204--1_27"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-26954-8_7"},{"key":"e_1_3_2_2_25_1","unstructured":"Guilhem Castagnos Dario Catalano Fabien Laguillaumie Federico Savasta and Ida Tucker. 2020. Bandwidth-efficient threshold EC-DSA. Cryptology ePrint Archive Report 2020\/084. https:\/\/ia.cr\/2020\/084."},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/978--3-030--45388--6_10"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/978--3--319--16715--2_26"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/978--3-030-03329--3_25"},{"key":"e_1_3_2_2_29_1","unstructured":"Jing Chen and Silvio Micali. 2017. Algorand. arXiv:1607.01341 [cs.CR]"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-56877-1_3"},{"key":"e_1_3_2_2_31_1","unstructured":"Chia Green Paper 2019. The Chia Network Blockchain. https:\/\/www.chia.net\/assets\/ChiaGreenPaper.pdf ."},{"key":"e_1_3_2_2_32_1","unstructured":"Chia VDF Competition Guide 2018. Chia VDF Competition Guide. https:\/\/medium.com\/@chia.net\/chia-vdf-competition-guide-5382e1f4bd39."},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/12130.12168"},{"key":"e_1_3_2_2_34_1","volume-title":"Primes of the form ??2 +????2","author":"Cox D. A.","unstructured":"D. A. Cox. 1999. Primes of the form ??2 +????2. John Wiley & Sons."},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44586-2_9"},{"key":"e_1_3_2_2_36_1","volume-title":"Codes, Cryptology and Information Security","author":"Das Parthasarathi","unstructured":"Parthasarathi Das, Michael J. Jacobson Jr., and Renate Scheidler. 2019. Improved Efficiency of a Linearly Homomorphic Cryptosystem. In Codes, Cryptology and Information Security. Springer, To appear."},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1007\/978--3--319--78375--8_3"},{"key":"e_1_3_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.1007\/978--3-030--34578--5_10"},{"key":"e_1_3_2_2_39_1","doi-asserted-by":"crossref","unstructured":"Cyprien Delpech de Saint Guilhem Eleftheria Makri Dragos Rotaru and Titouan Tanguy. 2021. The return of Eratosthenes: Secure Generation of RSA Moduli using Distributed Sieving. Cryptology ePrint Archive Report 2021\/565. https:\/\/eprint.iacr.org\/2021\/565.","DOI":"10.1145\/3460120.3484754"},{"key":"e_1_3_2_2_40_1","unstructured":"Samuel Dobson Steven D. Galbraith and Benjamin Smith. 2020. Trustless Groups of Unknown Order with Hyperelliptic Curves. Cryptology ePrint Archive Report 2020\/196. https:\/\/eprint.iacr.org\/2020\/196."},{"key":"e_1_3_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2019.00024"},{"key":"e_1_3_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2000.892117"},{"key":"e_1_3_2_2_43_1","unstructured":"Naomi Ephraim Cody Freitag Ilan Komargodski and Rafael Pass. 2020. Non-Malleable Time-Lock Puzzles and Applications. Cryptology ePrint Archive Report 2020\/779. https:\/\/eprint.iacr.org\/2020\/779."},{"key":"e_1_3_2_2_44_1","doi-asserted-by":"publisher","DOI":"10.1007\/11935230_29"},{"key":"e_1_3_2_2_45_1","unstructured":"Timo Hanke Mahnush Movahedi and Dominic Williams. 2018. DFINITY Technology Overview Series Consensus System. arXiv:1805.04548 [cs.DC]"},{"key":"e_1_3_2_2_46_1","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0054134"},{"key":"e_1_3_2_2_47_1","doi-asserted-by":"publisher","DOI":"10.1007\/978--3-030--64381--2_14"},{"key":"e_1_3_2_2_48_1","doi-asserted-by":"publisher","DOI":"10.1007\/978--3--319--63688--7_12"},{"key":"e_1_3_2_2_49_1","doi-asserted-by":"publisher","DOI":"10.1016\/0196--6774(80)90021--8"},{"key":"e_1_3_2_2_50_1","doi-asserted-by":"publisher","DOI":"10.1007\/978--3-030--26948--7_19"},{"key":"e_1_3_2_2_51_1","volume-title":"Lenstra and Benjamin Wesolowski","author":"Arjen","year":"2015","unstructured":"Arjen K. Lenstra and Benjamin Wesolowski. 2015. A random zoo: sloth, unicorn, and trx. Cryptology ePrint Archive, Report 2015\/366. https:\/\/eprint.iacr.org\/2015\/366."},{"key":"e_1_3_2_2_52_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2017.59"},{"key":"e_1_3_2_2_53_1","doi-asserted-by":"publisher","DOI":"10.1145\/3243734.3243788"},{"key":"e_1_3_2_2_54_1","doi-asserted-by":"publisher","DOI":"10.1007\/978--3--642--31284--7_14"},{"key":"e_1_3_2_2_55_1","doi-asserted-by":"publisher","unstructured":"Giulio Malavolta and Sri Aravinda Krishnan Thyagarajan. 2019. Homomorphic Time-Lock Puzzles and Applications See [10] 620--649. https:\/\/doi.org\/10.1007\/978--3-030--26948--7_22","DOI":"10.1007\/978--3-030--26948--7_22"},{"key":"e_1_3_2_2_56_1","volume-title":"Number Theory and Applications (Proc. NATO Advanced Study Inst. on Number Theory and Applications","author":"McCurley Kevin S.","year":"1988","unstructured":"Kevin S. McCurley. 1989. Cryptographic key distribution and computation in class groups. In Number Theory and Applications (Proc. NATO Advanced Study Inst. on Number Theory and Applications, Banff, 1988), Richard A. Molin (Ed.). Kluwer, Boston."},{"key":"e_1_3_2_2_57_1","unstructured":"Minimal VDF Randomness Beacon 2018. Minimal VDF Randomness Beacon. https:\/\/ethresear.ch\/t\/minimal-vdf-randomness-beacon\/3566."},{"key":"e_1_3_2_2_58_1","doi-asserted-by":"publisher","DOI":"10.1145\/100216.100273"},{"key":"e_1_3_2_2_59_1","doi-asserted-by":"publisher","DOI":"10.1007\/3--540--48910-X_16"},{"key":"e_1_3_2_2_60_1","unstructured":"PARI Group 2020. PARI\/GP version 2.11.4. PARI Group Univ. Bordeaux. available from http:\/\/pari.math.u-bordeaux.fr\/."},{"key":"e_1_3_2_2_61_1","unstructured":"Cecile Pierrot and Benjamin Wesolowski. 2016. Malleability of the blockchain's entropy. Cryptology ePrint Archive Report 2016\/370. https:\/\/eprint.iacr.org\/2016\/370."},{"key":"e_1_3_2_2_62_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ITCS.2019.60"},{"key":"e_1_3_2_2_63_1","doi-asserted-by":"publisher","DOI":"10.1007\/3--540--68339--9_33"},{"key":"e_1_3_2_2_64_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1983.48"},{"key":"e_1_3_2_2_65_1","unstructured":"Randao++ 2016. Randao++. https:\/\/www.reddit.com\/comments\/4mdkku."},{"key":"e_1_3_2_2_66_1","unstructured":"R. L. Rivest A. Shamir and D. A. Wagner. 1996. Time-lock Puzzles and Timed-release Crypto. Technical Report. Cambridge MA USA."},{"key":"e_1_3_2_2_67_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFFCS.1999.814628"},{"key":"e_1_3_2_2_68_1","first-page":"942","article-title":"RandRunner: Distributed Randomness from Trapdoor VDFs with Strong Uniqueness","volume":"2020","author":"Schindler Philipp","year":"2020","unstructured":"Philipp Schindler, Aljosha Judmayer, Markus Hittmeir, Nicholas Stifter, and E. Weippl. 2020. RandRunner: Distributed Randomness from Trapdoor VDFs with Strong Uniqueness. IACR Cryptol. ePrint Arch. 2020 (2020), 942.","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"e_1_3_2_2_69_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP40000.2020.00003"},{"key":"e_1_3_2_2_70_1","doi-asserted-by":"publisher","DOI":"10.1007\/0--387--34805-0_22"},{"key":"e_1_3_2_2_71_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2017.45"},{"key":"e_1_3_2_2_72_1","doi-asserted-by":"publisher","DOI":"10.1145\/3372297.3417263"},{"key":"e_1_3_2_2_73_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2018.00060"},{"key":"e_1_3_2_2_74_1","doi-asserted-by":"publisher","DOI":"10.1007\/978--3-030--17659--4_13"},{"key":"e_1_3_2_2_75_1","doi-asserted-by":"publisher","DOI":"10.1109\/APCCAS50809.2020.9301680"},{"key":"e_1_3_2_2_76_1","unstructured":"zk-SNARKS and zk-STARKS Explained 2021. https:\/\/academy.binance.com\/en\/articles\/zk-snarks-and-zk-starks-explained."},{"key":"e_1_3_2_2_77_1","volume-title":"even against Quantum Computers","author":"Create Verifiable Trust Ks","year":"2018","unstructured":"ZK-STARKs - Create Verifiable Trust, even against Quantum Computers 2018. https:\/\/tinyurl.com\/6c2ydjx2."}],"event":{"name":"CCS '21: 2021 ACM SIGSAC Conference on Computer and Communications Security","location":"Virtual Event Republic of Korea","acronym":"CCS '21","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"]},"container-title":["Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3460120.3484773","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3460120.3484773","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T20:51:08Z","timestamp":1763499068000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3460120.3484773"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,11,12]]},"references-count":77,"alternative-id":["10.1145\/3460120.3484773","10.1145\/3460120"],"URL":"https:\/\/doi.org\/10.1145\/3460120.3484773","relation":{},"subject":[],"published":{"date-parts":[[2021,11,12]]},"assertion":[{"value":"2021-11-13","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}