{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,9]],"date-time":"2026-08-09T16:10:20Z","timestamp":1786291820890,"version":"3.56.0"},"publisher-location":"New York, NY, USA","reference-count":100,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,11,21]],"date-time":"2024-11-21T00:00:00Z","timestamp":1732147200000},"content-version":"vor","delay-in-days":372,"URL":"http:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000185","name":"Defense Advanced Research Projects Agency","doi-asserted-by":"publisher","award":["HR00110C0086, HR00112020022"],"award-info":[{"award-number":["HR00110C0086, HR00112020022"]}],"id":[{"id":"10.13039\/100000185","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CNS-2120651, CNS-2128519, DGE?2139899"],"award-info":[{"award-number":["CNS-2120651, CNS-2128519, DGE?2139899"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,11,15]]},"DOI":"10.1145\/3576915.3623182","type":"proceedings-article","created":{"date-parts":[[2023,11,21]],"date-time":"2023-11-21T12:35:13Z","timestamp":1700570113000},"page":"1227-1241","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":17,"title":["Riggs: Decentralized Sealed-Bid Auctions"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7671-5681","authenticated-orcid":false,"given":"Nirvan","family":"Tyagi","sequence":"first","affiliation":[{"name":"Cornell University, Ithaca, NY, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0000-1009-2365","authenticated-orcid":false,"given":"Arasu","family":"Arun","sequence":"additional","affiliation":[{"name":"New York University, New York, NY, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6307-204X","authenticated-orcid":false,"given":"Cody","family":"Freitag","sequence":"additional","affiliation":[{"name":"Cornell Tech, New York, NY, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0224-1989","authenticated-orcid":false,"given":"Riad","family":"Wahby","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, PA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6349-0145","authenticated-orcid":false,"given":"Joseph","family":"Bonneau","sequence":"additional","affiliation":[{"name":"New York University, New York, NY, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1253-6449","authenticated-orcid":false,"given":"David","family":"Mazi\u00e8res","sequence":"additional","affiliation":[{"name":"Stanford University, Stanford, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2023,11,21]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Quantum-based privacy-preserving sealed-bid auction on the blockchain. Optik 242","author":"Abulkasim Hussein","year":"2021","unstructured":"Hussein Abulkasim, Atefeh Mashatan, and Shohini Ghose. 2021. Quantum-based privacy-preserving sealed-bid auction on the blockchain. Optik 242 (2021)."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.3982\/ECTA15925"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cose.2019.03.023"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2014.35"},{"key":"e_1_3_2_1_5_1","volume-title":"ASIACRYPT (3) (Lecture Notes in Computer Science","author":"Arun Arasu","unstructured":"Arasu Arun, Joseph Bonneau, and Jeremy Clark. 2022. Short-lived Zero-Knowledge Proofs and Signatures. In ASIACRYPT (3) (Lecture Notes in Computer Science, Vol. 13793). Springer, 487--516."},{"key":"e_1_3_2_1_6_1","unstructured":"avalanche [n. d.]. Avalanche. https:\/\/www.avalabs.org\/."},{"key":"e_1_3_2_1_7_1","volume-title":"Maurer","author":"Bangerter Endre","year":"2005","unstructured":"Endre Bangerter, Jan Camenisch, and Ueli M. Maurer. 2005. Efficient Proofs of Knowledge of Discrete Logarithms and Representations in Groups with Hidden Order. In Public Key Cryptography (Lecture Notes in Computer Science, Vol. 3386). Springer, 154--171."},{"key":"e_1_3_2_1_8_1","volume-title":"Barreto and Michael Naehrig","author":"Paulo S. L.","year":"2005","unstructured":"Paulo S. L. M. Barreto and Michael Naehrig. 2005. Pairing-Friendly Elliptic Curves of Prime Order. In Selected Areas in Cryptography (Lecture Notes in Computer Science, Vol. 3897). Springer, 319--331."},{"key":"e_1_3_2_1_9_1","volume-title":"CRYPTO (3) (Lecture Notes in Computer Science","author":"Ben-Sasson Eli","unstructured":"Eli Ben-Sasson, Iddo Bentov, Yinon Horesh, and Michael Riabzev. 2019. Scalable Zero Knowledge with No Trusted Setup. In CRYPTO (3) (Lecture Notes in Computer Science, Vol. 11694). Springer, 701--732."},{"key":"e_1_3_2_1_10_1","volume-title":"TCC (1) (Lecture Notes in Computer Science","author":"Benhamouda Fabrice","unstructured":"Fabrice Benhamouda, Craig Gentry, Sergey Gorbunov, Shai Halevi, Hugo Krawczyk, Chengyu Lin, Tal Rabin, and Leonid Reyzin. 2020. Can a Public Blockchain Keep a Secret?. In TCC (1) (Lecture Notes in Computer Science, Vol. 12550). Springer, 260--290."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-99073-6_5"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03549-4_20"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"crossref","unstructured":"Dan Boneh Benedikt B\u00fcnz and Ben Fisch. 2018. A Survey of Two Verifiable Delay Functions. IACR Cryptol. ePrint Arch. (2018) 712.","DOI":"10.1007\/978-3-319-96884-1_25"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-26948-7_20"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44598-6_15"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45539-6_31"},{"key":"e_1_3_2_1_17_1","volume-title":"ZEXE: Enabling Decentralized Private Computation. In IEEE Symposium on Security and Privacy. IEEE, 947--964","author":"Bowe Sean","year":"2020","unstructured":"Sean Bowe, Alessandro Chiesa, Matthew Green, Ian Miers, Pratyush Mishra, and Howard Wu. 2020. ZEXE: Enabling Decentralized Private Computation. In IEEE Symposium on Security and Privacy. IEEE, 947--964."},{"key":"e_1_3_2_1_18_1","volume-title":"International Conference on Security with Intelligent Computing and Big-data Services.","author":"Braghin Chiara","year":"2018","unstructured":"Chiara Braghin, Stelvio Cimato, Ernesto Damiani, and Michael Baronchelli. 2018. Designing smart-contract based auctions. In International Conference on Security with Intelligent Computing and Big-data Services."},{"key":"e_1_3_2_1_19_1","unstructured":"Lorenz Breidenbach Philip Daian Florian Tramer and Ari Juels. 2018. GasToken: A Journey Through Blockchain Resource Arbitrage. In CESC."},{"key":"e_1_3_2_1_20_1","volume-title":"New primality criteria and factorizations of 2m \u00b1 1. Mathematics of computation 29, 130","author":"Brillhart John","year":"1975","unstructured":"John Brillhart, Derrick H Lehmer, and John L Selfridge. 1975. New primality criteria and factorizations of 2m \u00b1 1. Mathematics of computation 29, 130 (1975), 620--647."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-51280-4_23"},{"key":"e_1_3_2_1_22_1","volume-title":"Bulletproofs: Short Proofs for Confidential Transactions and More. In IEEE Symposium on Security and Privacy. IEEE Computer Society, 315--334","author":"B\u00fcnz Benedikt","year":"2018","unstructured":"Benedikt B\u00fcnz, Jonathan Bootle, Dan Boneh, Andrew Poelstra, Pieter Wuille, and Gregory Maxwell. 2018. Bulletproofs: Short Proofs for Confidential Transactions and More. In IEEE Symposium on Security and Privacy. IEEE Computer Society, 315--334."},{"key":"e_1_3_2_1_23_1","unstructured":"Vitalik Buterin. [n. d.]. The Dawn of Hybrid Layer 2 Protocols. https:\/\/vitalik. ca\/general\/2019\/08\/28\/hybrid_layer_2.html."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-89255-7_15"},{"key":"e_1_3_2_1_25_1","volume-title":"Public Key Cryptography (2) (Lecture Notes in Computer Science","author":"Castagnos Guilhem","unstructured":"Guilhem Castagnos, Dario Catalano, Fabien Laguillaumie, Federico Savasta, and Ida Tucker. 2020. Bandwidth-Efficient Threshold EC-DSA. In Public Key Cryptography (2) (Lecture Notes in Computer Science, Vol. 12111). Springer, 266--296."},{"key":"e_1_3_2_1_26_1","volume-title":"SBRAC: Blockchain-based sealed-bid auction with bidding price privacy and public verifiability. Journal of Information Security and Applications","author":"Chen Biwen","year":"2022","unstructured":"Biwen Chen, Xue Li, Tao Xiang, and Peng Wang. 2022. SBRAC: Blockchain-based sealed-bid auction with bidding price privacy and public verifiability. Journal of Information Security and Applications (2022)."},{"key":"e_1_3_2_1_27_1","volume-title":"Ward","author":"Chiesa Alessandro","year":"2020","unstructured":"Alessandro Chiesa, Yuncong Hu, Mary Maller, Pratyush Mishra, Noah Vesely, and Nicholas P. Ward. 2020. Marlin: Preprocessing zkSNARKs with Universal and Updatable SRS. In EUROCRYPT (1) (Lecture Notes in Computer Science, Vol. 12105). Springer, 738--768."},{"key":"e_1_3_2_1_28_1","unstructured":"Tarun Chitra Matheus V. X. Ferreira and Kshitij Kulkarni. 2023. Credible Optimal Auctions via Blockchains. arXiv:2301.12532 [cs.GT]"},{"key":"e_1_3_2_1_29_1","unstructured":"christies 2021. Welcome to the future. Digital Art: NFTs. https:\/\/www.christies. com\/auctions\/christies-encrypted."},{"key":"e_1_3_2_1_30_1","volume-title":"Bulletproofs: Shorter Proofs for Privacy-Enhanced Distributed Ledger. IACR Cryptol. ePrint Arch.","author":"Chung Hee Won","year":"2020","unstructured":"Hee Won Chung, Kyoohyung Han, Chanyang Ju, Myungsun Kim, and Jae Hong Seo. 2020. Bulletproofs: Shorter Proofs for Privacy-Enhanced Distributed Ledger. IACR Cryptol. ePrint Arch. (2020), 735."},{"key":"e_1_3_2_1_31_1","volume-title":"Public Key Cryptography (Lecture Notes in Computer Science","volume":"389","author":"Clavier Christophe","year":"2012","unstructured":"Christophe Clavier, Benoit Feix, Lo\u00efc Thierry, and Pascal Paillier. 2012. Generat-ing Provable Primes Efficiently on Embedded Devices. In Public Key Cryptography (Lecture Notes in Computer Science, Vol. 7293). Springer, 372--389."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1109\/Blockchain53845.2021.00078"},{"key":"e_1_3_2_1_33_1","volume-title":"EUROCRYPT (3) (Lecture Notes in Computer Science","author":"Couteau Geoffroy","unstructured":"Geoffroy Couteau, Michael Kloo\u00df, Huang Lin, and Michael Reichle. 2021. Efficient Range Proofs with Transparent Setup from Bounded Integer Commitments. In EUROCRYPT (3) (Lecture Notes in Computer Science, Vol. 12698). Springer, 247--277."},{"key":"e_1_3_2_1_34_1","volume-title":"EUROCRYPT (2) (Lecture Notes in Computer Science","author":"Couteau Geoffroy","unstructured":"Geoffroy Couteau, Thomas Peters, and David Pointcheval. 2017. Removing the Strong RSA Assumption from Arguments over the Integers. In EUROCRYPT (2) (Lecture Notes in Computer Science, Vol. 10211). 321--350."},{"key":"e_1_3_2_1_35_1","volume-title":"ASIACRYPT (Lecture Notes in Computer Science","volume":"142","author":"Damg\u00e5rd Ivan","year":"2002","unstructured":"Ivan Damg\u00e5rd and Eiichiro Fujisaki. 2002. A Statistically-Hiding Integer Com-mitment Scheme Based on Groups with Hidden Order. In ASIACRYPT (Lecture Notes in Computer Science, Vol. 2501). Springer, 125--142."},{"key":"e_1_3_2_1_36_1","volume-title":"Ouroboros Praos: An Adaptively-Secure, Semi-synchronous Proof-of-Stake Blockchain. In EUROCRYPT (2) (Lecture Notes in Computer Science","author":"David Bernardo","year":"2018","unstructured":"Bernardo David, Peter Gazi, Aggelos Kiayias, and Alexander Russell. 2018. Ouroboros Praos: An Adaptively-Secure, Semi-synchronous Proof-of-Stake Blockchain. In EUROCRYPT (2) (Lecture Notes in Computer Science, Vol. 10821). Springer, 66--98."},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/Blockchain53845.2021.00069"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/Blockchain.2019.00014"},{"key":"e_1_3_2_1_39_1","volume-title":"ACNS (1) (Lecture Notes in Computer Science","author":"Deuber Dominic","unstructured":"Dominic Deuber, Nico D\u00f6ttling, Bernardo Magri, Giulio Malavolta, and Sri Aravinda Krishnan Thyagarajan. 2020. Minting Mechanism for Proof of Stake Blockchains. In ACNS (1) (Lecture Notes in Computer Science, Vol. 12146). Springer, 315--334."},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP40001.2021.00026"},{"key":"e_1_3_2_1_41_1","unstructured":"eos [n. d.]. EOS. https:\/\/eos.io\/."},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"crossref","unstructured":"Matheus V. X. Ferreira and S. Matthew Weinberg. 2020. Credible Truthful and Two-Round (Optimal) Auctions via Cryptographic Commitments. In EC. ACM 683--712.","DOI":"10.1145\/3391403.3399495"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1109\/32.502223"},{"key":"e_1_3_2_1_44_1","volume-title":"TCC (3) (Lecture Notes in Computer Science","author":"Freitag Cody","unstructured":"Cody Freitag, Ilan Komargodski, Rafael Pass, and Naomi Sirkin. 2021. Non-malleable Time-Lock Puzzles and Applications. In TCC (3) (Lecture Notes in Computer Science, Vol. 13044). Springer, 447--479."},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0052225"},{"key":"e_1_3_2_1_46_1","first-page":"953","article-title":"PLONK: Permutations over Lagrange-bases for Oecumenical Noninteractive arguments of Knowledge","volume":"2019","author":"Gabizon Ariel","year":"2019","unstructured":"Ariel Gabizon, Zachary J. Williamson, and Oana Ciobotaru. 2019. PLONK: Permutations over Lagrange-bases for Oecumenical Noninteractive arguments of Knowledge. IACR Cryptol. ePrint Arch. 2019 (2019), 953.","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"e_1_3_2_1_47_1","volume-title":"Youssef","author":"Galal Hisham S.","year":"2018","unstructured":"Hisham S. Galal and Amr M. Youssef. 2018. Verifiable Sealed-Bid Auction on the Ethereum Blockchain. Cryptology ePrint Archive, Paper 2018\/704."},{"key":"e_1_3_2_1_48_1","volume-title":"Trustee: Full Privacy Preserving Vickrey Auction on top of Ethereum. In Financial Crypto.","author":"Galal Hisham S","year":"2019","unstructured":"Hisham S Galal and Amr M Youssef. 2019. Trustee: Full Privacy Preserving Vickrey Auction on top of Ethereum. In Financial Crypto."},{"key":"e_1_3_2_1_49_1","volume-title":"Fiat-Shamir Bulletproofs are Non-Malleable (in the Algebraic Group Model)","author":"Ganesh Chaya","unstructured":"Chaya Ganesh, Claudio Orlandi, Mahak Pancholi, Akira Takahashi, and Daniel Tschudi. 2022. Fiat-Shamir Bulletproofs are Non-Malleable (in the Algebraic Group Model). In EUROCRYPT. Springer."},{"key":"e_1_3_2_1_50_1","volume-title":"Tal Rabin, and Sophia Yakoubov.","author":"Gentry Craig","year":"2021","unstructured":"Craig Gentry, Shai Halevi, Hugo Krawczyk, Bernardo Magri, Jesper Buus Nielsen, Tal Rabin, and Sophia Yakoubov. 2021. YOSO: You Only Speak Once - Secure MPC with Stateless Ephemeral Roles. In CRYPTO (2) (Lecture Notes in Computer Science, Vol. 12826). Springer, 64--93."},{"key":"e_1_3_2_1_51_1","volume-title":"Jesper Buus Nielsen, and Sophia Yakoubov","author":"Gentry Craig","year":"2021","unstructured":"Craig Gentry, Shai Halevi, Bernardo Magri, Jesper Buus Nielsen, and Sophia Yakoubov. 2021. Random-Index PIR and Applications. In TCC (3) (Lecture Notes in Computer Science, Vol. 13044). Springer, 32--61."},{"key":"e_1_3_2_1_52_1","volume-title":"CRYPTO (3) (Lecture Notes in Computer Science","author":"Ghoshal Ashrujit","unstructured":"Ashrujit Ghoshal and Stefano Tessaro. 2021. Tight State-Restoration Soundness in the Algebraic Group Model. In CRYPTO (3) (Lecture Notes in Computer Science, Vol. 12827). Springer, 64--93."},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1145\/3132747.3132757"},{"key":"e_1_3_2_1_54_1","volume-title":"regulation, and conver-gence: current trends in telecommunications policy research","author":"Gillett Sharon E","unstructured":"Sharon E Gillett and Ingo Vogelsang. 1999. Competition, regulation, and conver-gence: current trends in telecommunications policy research. Routledge."},{"key":"e_1_3_2_1_55_1","volume-title":"When the cookie meets the blockchain: Privacy risks of web payments via cryptocurrencies. PETS","author":"Goldfeder Steven","year":"2018","unstructured":"Steven Goldfeder, Harry Kalodner, Dillon Reisman, and Arvind Narayanan. 2018. When the cookie meets the blockchain: Privacy risks of web payments via cryptocurrencies. PETS (2018)."},{"key":"e_1_3_2_1_56_1","unstructured":"GoogleLawsuit 2023. Justice Department Sues Google for Monopolizing Digital Advertising Technologies. The United States Department of Justice."},{"key":"e_1_3_2_1_57_1","volume-title":"Public Key Cryptography (1) (Lecture Notes in Computer Science","author":"Goyal Vipul","unstructured":"Vipul Goyal, Abhiram Kothapalli, Elisaweta Masserova, Bryan Parno, and Yifan Song. 2022. Storing and Retrieving Secrets on a Blockchain. In Public Key Cryptography (1) (Lecture Notes in Computer Science, Vol. 13177). Springer, 252--282."},{"key":"e_1_3_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1007\/11496137_32"},{"key":"e_1_3_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-25385-0_23"},{"key":"e_1_3_2_1_60_1","volume-title":"EUROCRYPT (2) (Lecture Notes in Computer Science","author":"Groth Jens","unstructured":"Jens Groth. 2016. On the Size of Pairing-Based Non-interactive Arguments. In EUROCRYPT (2) (Lecture Notes in Computer Science, Vol. 9666). Springer, 305--326."},{"key":"e_1_3_2_1_61_1","volume-title":"An Empirical Analysis of Anonymity in Zcash. In USENIX Security Symposium. USENIX Association, 463--477","author":"Kappos George","year":"2018","unstructured":"George Kappos, Haaroon Yousaf, Mary Maller, and Sarah Meiklejohn. 2018. An Empirical Analysis of Anonymity in Zcash. In USENIX Security Symposium. USENIX Association, 463--477."},{"key":"e_1_3_2_1_62_1","volume-title":"TCC (3) (Lecture Notes in Computer Science","author":"Katz Jonathan","unstructured":"Jonathan Katz, Julian Loss, and Jiayu Xu. 2020. On the Security of Time-Lock Puzzles and Timed Commitments. In TCC (3) (Lecture Notes in Computer Science, Vol. 12552). Springer, 390--413."},{"key":"e_1_3_2_1_63_1","volume-title":"Rabin","author":"Katz Jonathan","year":"2004","unstructured":"Jonathan Katz, Rafail Ostrovsky, and Michael O. Rabin. 2004. Identity-Based Zero Knowledge. In SCN (Lecture Notes in Computer Science, Vol. 3352). Springer, 180--192."},{"key":"e_1_3_2_1_64_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-49896-5_25"},{"key":"e_1_3_2_1_65_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2016.55"},{"key":"e_1_3_2_1_66_1","doi-asserted-by":"publisher","DOI":"10.1145\/3423211.3425669"},{"key":"e_1_3_2_1_67_1","unstructured":"Pascal Lafourcade Mike Nop\u00e8re Daniela Pizzuti and \u00c9tienne Roudeix. 2018. Auctionity Yellow Paper. https:\/\/www.auctionity.com\/wp-content\/uploads\/ 2018\/09\/Auctionity-Yellow-Paper.pdf."},{"key":"e_1_3_2_1_68_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-40061-5_26"},{"key":"e_1_3_2_1_69_1","volume-title":"Blockchain-Based Sealed-Bid Domain Name Auction Protocol. In EAI International Conference on Applied Cryptography in Computer and Communications.","author":"Lu Genhua","year":"2021","unstructured":"Genhua Lu, Yi Zhang, Zhongxiang Lu, Jun Shao, and Guiyi Wei. 2021. Blockchain-Based Sealed-Bid Domain Name Auction Protocol. In EAI International Conference on Applied Cryptography in Computer and Communications."},{"key":"e_1_3_2_1_70_1","doi-asserted-by":"publisher","DOI":"10.1257\/jep.14.3.183"},{"key":"e_1_3_2_1_71_1","volume-title":"CRYPTO (1) (Lecture Notes in Computer Science","author":"Malavolta Giulio","unstructured":"Giulio Malavolta and Sri Aravinda Krishnan Thyagarajan. 2019. Homomorphic Time-Lock Puzzles and Applications. In CRYPTO (1) (Lecture Notes in Computer Science, Vol. 11692). Springer, 620--649."},{"key":"e_1_3_2_1_72_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2020.3043400"},{"key":"e_1_3_2_1_73_1","volume-title":"IEEE Symposium on Security and Privacy. IEEE Computer Society, 397--411","author":"Miers Ian","unstructured":"Ian Miers, Christina Garman, Matthew Green, and Aviel D. Rubin. 2013. Zerocoin: Anonymous Distributed E-Cash from Bitcoin. In IEEE Symposium on Security and Privacy. IEEE Computer Society, 397--411."},{"key":"e_1_3_2_1_74_1","doi-asserted-by":"publisher","DOI":"10.1145\/336992.337028"},{"key":"e_1_3_2_1_75_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01384489"},{"key":"e_1_3_2_1_76_1","volume-title":"Scaling Verifiable Computation Using Efficient Set Accumulators. In USENIX Security Symposium. USENIX Association","author":"Ozdemir Alex","year":"2020","unstructured":"Alex Ozdemir, Riad S. Wahby, Barry Whitehat, and Dan Boneh. 2020. Scaling Verifiable Computation Using Efficient Set Accumulators. In USENIX Security Symposium. USENIX Association, 2075--2092."},{"key":"e_1_3_2_1_77_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCSI.2020.2966755"},{"key":"e_1_3_2_1_78_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48910-X_16"},{"key":"e_1_3_2_1_79_1","volume-title":"Pinocchio: Nearly Practical Verifiable Computation","author":"Parno Bryan","year":"2013","unstructured":"Bryan Parno, Jon Howell, Craig Gentry, and Mariana Raykova. 2013. Pinocchio: Nearly Practical Verifiable Computation. In IEEE S&P."},{"key":"e_1_3_2_1_80_1","volume-title":"CRYPTO (Lecture Notes in Computer Science","volume":"140","author":"Pedersen Torben P.","year":"1991","unstructured":"Torben P. Pedersen. 1991. Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing. In CRYPTO (Lecture Notes in Computer Science, Vol. 576). Springer, 129--140."},{"key":"e_1_3_2_1_81_1","first-page":"1","article-title":"Simple Verifiable Delay Functions. In ITCS (LIPIcs, Vol. 124)","volume":"60","author":"Pietrzak Krzysztof","year":"2019","unstructured":"Krzysztof Pietrzak. 2019. Simple Verifiable Delay Functions. In ITCS (LIPIcs, Vol. 124). Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 60:1--60:15.","journal-title":"Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik"},{"key":"e_1_3_2_1_82_1","volume-title":"Wagner","author":"Rivest Ronald L.","year":"1996","unstructured":"Ronald L. Rivest, Adi Shamir, and David A. Wagner. 1996. Time-lock Puzzles and Timed-release Crypto. Technical Report. Massachusetts Institute of Technology."},{"key":"e_1_3_2_1_83_1","doi-asserted-by":"crossref","unstructured":"Lior Rotem and Gil Segev. 2020. Generically speeding-up repeated squaring is equivalent to factoring: sharp thresholds for all generic-ring delay functions. In CRYPTO.","DOI":"10.1007\/978-3-030-56877-1_17"},{"key":"e_1_3_2_1_84_1","doi-asserted-by":"publisher","DOI":"10.1086\/261670"},{"key":"e_1_3_2_1_85_1","volume-title":"On-Chain Auctions with Deposits. arXiv preprint arXiv:2103.16681","author":"Schlegel Jan Christoph","year":"2021","unstructured":"Jan Christoph Schlegel and Akaki Mamageishvili. 2021. On-Chain Auctions with Deposits. arXiv preprint arXiv:2103.16681 (2021)."},{"key":"e_1_3_2_1_86_1","volume-title":"Spartan: Efficient and General-Purpose zkSNARKs Without Trusted Setup. In CRYPTO (3) (Lecture Notes in Computer Science","author":"Setty Srinath","year":"2020","unstructured":"Srinath Setty. 2020. Spartan: Efficient and General-Purpose zkSNARKs Without Trusted Setup. In CRYPTO (3) (Lecture Notes in Computer Science, Vol. 12172). Springer, 704--737."},{"key":"e_1_3_2_1_87_1","volume-title":"Layer 2 Blockchain Scaling: a Survey. CoRR abs\/2107.10881","author":"Sguanci Cosimo","year":"2021","unstructured":"Cosimo Sguanci, Roberto Spatafora, and Andrea Mario Vergani. 2021. Layer 2 Blockchain Scaling: a Survey. CoRR abs\/2107.10881 (2021)."},{"key":"e_1_3_2_1_88_1","doi-asserted-by":"publisher","DOI":"10.3390\/electronics10192340"},{"key":"e_1_3_2_1_89_1","volume-title":"Sotheby's to Announce Live Bidding Increments in Ether (ETH) Cryptocurrency for Banksy's ?Trolley Hunters' and ?Love Is In The Air","unstructured":"sothebys 2021. Sotheby's to Announce Live Bidding Increments in Ether (ETH) Cryptocurrency for Banksy's ?Trolley Hunters' and ?Love Is In The Air'. Sotheby's press release."},{"key":"e_1_3_2_1_90_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-68339-9_17"},{"key":"e_1_3_2_1_91_1","unstructured":"Justin Thaler. 2020. Proofs Arguments and Zero Knowledge. https:\/\/people.cs. georgetown.edu\/jthaler\/ProofsArgsAndZK.html."},{"key":"e_1_3_2_1_92_1","doi-asserted-by":"crossref","unstructured":"Sri Aravinda Krishnan Thyagarajan Guilhem Castagnos Fabien Laguillaumie and Giulio Malavolta. 2021. Efficient CCA Timed Commitments in Class Groups. In CCS. ACM 2663--2684.","DOI":"10.1145\/3460120.3484773"},{"key":"e_1_3_2_1_93_1","doi-asserted-by":"crossref","unstructured":"Sri Aravinda Krishnan Thyagarajan Tiantian Gong Adithya Bhat Aniket Kate and Dominique Schr\u00f6der. 2021. OpenSquare: Decentralized Repeated Modular Squaring Service. In CCS. ACM 3447--3464.","DOI":"10.1145\/3460120.3484809"},{"key":"e_1_3_2_1_94_1","doi-asserted-by":"publisher","DOI":"10.1145\/3576915.3623182"},{"key":"e_1_3_2_1_95_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1540-6261.1961.tb02789.x"},{"key":"e_1_3_2_1_96_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-51280-4_24"},{"key":"e_1_3_2_1_97_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-17659-4_13"},{"key":"e_1_3_2_1_98_1","unstructured":"Barry Whitehat Alex Gluchowski HarryR Yondon Fu and Philippe Castonguay..Roll up \/ roll back snark. https:\/\/ethresear.ch\/t\/roll-up-roll-back-snark- side-chain-17000-tps\/."},{"key":"e_1_3_2_1_99_1","volume-title":"Anonymous Auction Protocol Based on Time-Released Encryption atop Consortium Blockchain. arXiv preprint arXiv:1903.03285","author":"Xiong Jie","year":"2019","unstructured":"Jie Xiong and Qi Wang. 2019. Anonymous Auction Protocol Based on Time-Released Encryption atop Consortium Blockchain. arXiv preprint arXiv:1903.03285 (2019)."},{"key":"e_1_3_2_1_100_1","unstructured":"zcash [n. d.]. ZCash. https:\/\/z.cash\/."}],"event":{"name":"CCS '23: ACM SIGSAC Conference on Computer and Communications Security","location":"Copenhagen Denmark","acronym":"CCS '23","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"]},"container-title":["Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3576915.3623182","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3576915.3623182","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3576915.3623182","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,21]],"date-time":"2025-08-21T01:46:09Z","timestamp":1755740769000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3576915.3623182"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,11,15]]},"references-count":100,"alternative-id":["10.1145\/3576915.3623182","10.1145\/3576915"],"URL":"https:\/\/doi.org\/10.1145\/3576915.3623182","relation":{},"subject":[],"published":{"date-parts":[[2023,11,15]]},"assertion":[{"value":"2023-11-21","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}