{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T21:04:40Z","timestamp":1757624680469,"version":"3.44.0"},"publisher-location":"Cham","reference-count":55,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783032018779"},{"type":"electronic","value":"9783032018786"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-3-032-01878-6_5","type":"book-chapter","created":{"date-parts":[[2025,8,18]],"date-time":"2025-08-18T09:20:46Z","timestamp":1755508846000},"page":"135-169","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Foundations of\u00a0Platform-Assisted Auctions"],"prefix":"10.1007","author":[{"given":"Hao","family":"Chung","sequence":"first","affiliation":[]},{"given":"Ke","family":"Wu","sequence":"additional","affiliation":[]},{"given":"Elaine","family":"Shi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,8,17]]},"reference":[{"key":"5_CR1","doi-asserted-by":"crossref","unstructured":"Ajtai, M., Koml\u00f3s, J., Szemer\u00e9di, E.: An O(n log n) sorting network. In: STOC (1983)","DOI":"10.1145\/800061.808726"},{"key":"5_CR2","doi-asserted-by":"crossref","unstructured":"Akbarpour, M., Li, S.: Credible auctions: a trilemma. Econometric Soc. Econometrica (2020)","DOI":"10.3982\/ECTA15925"},{"key":"5_CR3","doi-asserted-by":"publisher","unstructured":"Alvarez, R., Nojoumian, M.: Comprehensive survey on privacy-preserving protocols for sealed-bid auctions. Comput. Secur. 88, 101502 (2020). https:\/\/doi.org\/10.1016\/j.cose.2019.03.023, https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0167404818306631","DOI":"10.1016\/j.cose.2019.03.023"},{"key":"5_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1007\/978-3-642-29011-4_29","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2012","author":"G Asharov","year":"2012","unstructured":"Asharov, G., Jain, A., L\u00f3pez-Alt, A., Tromer, E., Vaikuntanathan, V., Wichs, D.: Multiparty computation with low communication, computation and interaction via threshold FHE. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol. 7237, pp. 483\u2013501. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29011-4_29"},{"key":"5_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1007\/978-3-030-26954-8_23","volume-title":"Advances in Cryptology \u2013 CRYPTO 2019","author":"E Ben-Sasson","year":"2019","unstructured":"Ben-Sasson, E., Bentov, I., Horesh, Y., Riabzev, M.: Scalable zero knowledge with no trusted setup. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019. LNCS, vol. 11694, pp. 701\u2013732. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26954-8_23"},{"key":"5_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/978-3-030-17653-2_4","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2019","author":"E Ben-Sasson","year":"2019","unstructured":"Ben-Sasson, E., Chiesa, A., Riabzev, M., Spooner, N., Virza, M., Ward, N.P.: Aurora: transparent succinct arguments for R1CS. In: Ishai, Y., Rijmen, V. (eds.) EUROCRYPT 2019. LNCS, vol. 11476, pp. 103\u2013128. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17653-2_4"},{"issue":"2","key":"5_CR7","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1137\/050646445","volume":"38","author":"E Ben-Sasson","year":"2008","unstructured":"Ben-Sasson, E., Sudan, M.: Short PCPS with polylog query complexity. SIAM J. Comput. 38(2), 551\u2013607 (2008)","journal-title":"SIAM J. Comput."},{"key":"5_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/978-3-319-99073-6_5","volume-title":"Computer Security","author":"E-O Blass","year":"2018","unstructured":"Blass, E.-O., Kerschbaum, F.: Strain: a secure auction for blockchains. In: Lopez, J., Zhou, J., Soriano, M. (eds.) ESORICS 2018. LNCS, vol. 11098, pp. 87\u2013110. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-99073-6_5"},{"key":"5_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/978-3-642-03549-4_20","volume-title":"Financial Cryptography and Data Security","author":"P Bogetoft","year":"2009","unstructured":"Bogetoft, P., et al.: Secure multiparty computation goes live. In: Dingledine, R., Golle, P. (eds.) FC 2009. LNCS, vol. 5628, pp. 325\u2013343. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-03549-4_20"},{"key":"5_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1007\/978-3-319-96884-1_19","volume-title":"Advances in Cryptology \u2013 CRYPTO 2018","author":"D Boneh","year":"2018","unstructured":"Boneh, D., et al.: Threshold cryptosystems from threshold fully homomorphic encryption. In: Shacham, H., Boldyreva, A. (eds.) CRYPTO 2018. LNCS, vol. 10991, pp. 565\u2013596. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96884-1_19"},{"key":"5_CR11","doi-asserted-by":"publisher","unstructured":"Bowers, K.D., Juels, A., Oprea, A.: Proofs of retrievability: theory and implementation. In: Proceedings of the 2009 ACM Workshop on Cloud Computing Security, pp. 43\u201354. CCSW 2009. Association for Computing Machinery, New York (2009). https:\/\/doi.org\/10.1145\/1655008.1655015","DOI":"10.1145\/1655008.1655015"},{"key":"5_CR12","doi-asserted-by":"crossref","unstructured":"Canetti, R.: Universally composable security: a new paradigm for cryptographic protocols. In: FOCS (2001)","DOI":"10.1109\/SFCS.2001.959888"},{"key":"5_CR13","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/s001459910006","volume":"13","author":"R Canetti","year":"2000","unstructured":"Canetti, R.: Security and composition of multiparty cryptographic protocols. J. Cryptology 13, 143\u2013202 (2000)","journal-title":"J. Cryptology"},{"key":"5_CR14","doi-asserted-by":"crossref","unstructured":"Chakraborty, I., Kosmopoulou, G.: Auctions with shill bidding. Econ. Theory 24(2), 271\u2013287 (2004). http:\/\/www.jstor.org\/stable\/25055814","DOI":"10.1007\/s00199-003-0423-y"},{"key":"5_CR15","doi-asserted-by":"publisher","unstructured":"Chen, B., B\u00fcnz, B., Boneh, D., Zhang, Z.: Hyperplonk: plonk with linear-time prover and high-degree custom gates. In: Advances in Cryptology \u2013 EUROCRYPT 2023, pp. 499\u2013530. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-30617-4_17","DOI":"10.1007\/978-3-031-30617-4_17"},{"key":"5_CR16","doi-asserted-by":"crossref","unstructured":"Chiesa, A., Dall\u2019Agnol, M., Guan, Z., Spooner, N., Yogev, E.: Untangling the security of kilian\u2019s protocol: upper and lower bounds. In: TCC (2024)","DOI":"10.1007\/978-3-031-78011-0_6"},{"key":"5_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"738","DOI":"10.1007\/978-3-030-45721-1_26","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2020","author":"A Chiesa","year":"2020","unstructured":"Chiesa, A., Hu, Y., Maller, M., Mishra, P., Vesely, N., Ward, N.: Marlin: preprocessing zkSNARKs with universal and updatable SRS. In: Canteaut, A., Ishai, Y. (eds.) EUROCRYPT 2020. LNCS, vol. 12105, pp. 738\u2013768. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45721-1_26"},{"key":"5_CR18","unstructured":"Chitra, T., Ferreira, M.V., Kulkarni, K.: Credible, optimal auctions via blockchains. arXiv preprint arXiv:2301.12532 (2023)"},{"key":"5_CR19","doi-asserted-by":"crossref","unstructured":"Chung, H., Roughgarden, T., Shi, E.: Collusion-resilience in transaction fee mechanism design. In: EC (2024)","DOI":"10.1145\/3670865.3673550"},{"key":"5_CR20","doi-asserted-by":"crossref","unstructured":"Chung, H., Shi, E.: Foundations of transaction fee mechanism design. In: SODA (2023)","DOI":"10.1137\/1.9781611977554.ch150"},{"key":"5_CR21","doi-asserted-by":"publisher","unstructured":"Chvojka, P., Jager, T.: Simple, fast, efficient, and tightly-secure non-malleable non-interactive timed commitments. In: Boldyreva, A., Kolesnikov, V. (eds.) Public-Key Cryptography \u2013 PKC 2023: 26th IACR International Conference on Practice and Theory of Public-Key Cryptography, Atlanta, GA, USA, May 7\u201310, 2023, Proceedings, Part I, pp. 500\u2013529. Springer, Heidelberg (2023). https:\/\/doi.org\/10.1007\/978-3-031-31368-4_18","DOI":"10.1007\/978-3-031-31368-4_18"},{"key":"5_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/978-3-662-48000-7_4","volume-title":"Advances in Cryptology \u2013 CRYPTO 2015","author":"S Dov Gordon","year":"2015","unstructured":"Dov Gordon, S., Liu, F.-H., Shi, E.: Constant-round MPC with fairness and guarantee of output delivery. In: Gennaro, R., Robshaw, M. (eds.) CRYPTO 2015. LNCS, vol. 9216, pp. 63\u201382. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48000-7_4"},{"key":"5_CR23","unstructured":"Elkind, E.: Designing and learning optimal finite support auctions (2007)"},{"key":"5_CR24","doi-asserted-by":"crossref","unstructured":"Ferreira, M.V.X., Weinberg, S.M.: Credible, truthful, and two-round (optimal) auctions via cryptographic commitments. In: EC (2020)","DOI":"10.1145\/3391403.3399495"},{"key":"5_CR25","unstructured":"Gabizon, A., Williamson, Z.J., Ciobotaru, O.: PLONK: permutations over lagrange-bases for oecumenical noninteractive arguments of knowledge. Cryptology ePrint Archive, Paper 2019\/953 (2019). https:\/\/eprint.iacr.org\/2019\/953"},{"key":"5_CR26","doi-asserted-by":"crossref","unstructured":"Garg, S., Gentry, C., Halevi, S., Raykova, M., Sahai, A., Waters, B.: Candidate indistinguishability obfuscation and functional encryption for all circuits. In: IEEE Symposium on Foundations of Computer Science (FOCS) (2013)","DOI":"10.1109\/FOCS.2013.13"},{"key":"5_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"626","DOI":"10.1007\/978-3-642-38348-9_37","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2013","author":"R Gennaro","year":"2013","unstructured":"Gennaro, R., Gentry, C., Parno, B., Raykova, M.: Quadratic span programs and succinct NIZKs without PCPs. In: Johansson, T., Nguyen, P.Q. (eds.) EUROCRYPT 2013. LNCS, vol. 7881, pp. 626\u2013645. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38348-9_37"},{"key":"5_CR28","unstructured":"Goldberg, A.V., Hartline, J.D.: Collusion-resistant mechanisms for single-parameter agents. In: SODA 2005, pp. 620\u2013629 (2005)"},{"key":"5_CR29","doi-asserted-by":"crossref","unstructured":"Goyal, V., Li, J., Misra, A.K., Ostrovsky, R., Song, Y., Weng, C.: Dishonest majority constant-round MPC with linear communication from DDH. In: Asiacrypt (2024)","DOI":"10.1007\/978-981-96-0938-3_6"},{"key":"5_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/978-3-662-49896-5_11","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2016","author":"J Groth","year":"2016","unstructured":"Groth, J.: On the size of pairing-based non-interactive arguments. In: Fischlin, M., Coron, J.-S. (eds.) EUROCRYPT 2016. LNCS, vol. 9666, pp. 305\u2013326. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49896-5_11"},{"key":"5_CR31","doi-asserted-by":"publisher","unstructured":"Hubacek, P., Wichs, D.: On the communication complexity of secure function evaluation with long output. In: Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science, pp. 163\u2013172. ITCS 2015. Association for Computing Machinery, New York (2015). https:\/\/doi.org\/10.1145\/2688073.2688105","DOI":"10.1145\/2688073.2688105"},{"key":"5_CR32","doi-asserted-by":"crossref","unstructured":"Jain, A., Lin, H., Sahai, A.: Indistinguishability obfuscation from well-founded assumptions. In: STOC 2021, Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing, pp. 60\u201373. Association for Computing Machinery (2021)","DOI":"10.1145\/3406325.3451093"},{"key":"5_CR33","unstructured":"Justice, U.D.: Justice department sues google for monopolizing digital advertising technologies (2023). https:\/\/www.justice.gov\/opa\/pr\/justice-department-sues-googlemonopolizing-digital-advertising-technologies"},{"key":"5_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1007\/978-3-030-64381-2_14","volume-title":"Theory of Cryptography","author":"J Katz","year":"2020","unstructured":"Katz, J., Loss, J., Xu, J.: On the security of time-lock puzzles and timed commitments. In: Pass, R., Pietrzak, K. (eds.) TCC 2020. LNCS, vol. 12552, pp. 390\u2013413. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64381-2_14"},{"key":"5_CR35","doi-asserted-by":"crossref","unstructured":"Kilian, J.: A note on efficient zero-knowledge proofs and arguments (extended abstract). In: STOC 1992, Proceedings of the Twenty-Fourth Annual ACM Symposium on Theory of Computing, pp. 723\u2013732. Association for Computing Machinery, New York (1992)","DOI":"10.1145\/129712.129782"},{"key":"5_CR36","doi-asserted-by":"publisher","unstructured":"Kosba, A., Miller, A., Shi, E., Wen, Z., Papamanthou, C.: Hawk: the blockchain model of cryptography and privacy-preserving smart contracts. In: 2016 IEEE Symposium on Security and Privacy (SP), pp. 839\u2013858 (2016). https:\/\/doi.org\/10.1109\/SP.2016.55","DOI":"10.1109\/SP.2016.55"},{"key":"5_CR37","doi-asserted-by":"crossref","unstructured":"Malavolta, G., Thyagarajan, S.A.K.: Homomorphic time-lock puzzles and applications. In: Advances in Cryptology \u2013 CRYPTO 2019: 39th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 18\u201322, 2019, Proceedings, Part I, pp. 620\u2013649. Springer, Heidelberg (2019)","DOI":"10.1007\/978-3-030-26948-7_22"},{"key":"5_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1007\/0-387-34805-0_21","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 89 Proceedings","author":"RC Merkle","year":"1990","unstructured":"Merkle, R.C.: A certified digital signature. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 218\u2013238. Springer, New York (1990). https:\/\/doi.org\/10.1007\/0-387-34805-0_21"},{"key":"5_CR39","doi-asserted-by":"publisher","unstructured":"Milionis, J., Hirsch, D., Arditi, A., Garimidi, P.: A framework for single-item NFT auction mechanism design. In: DeFi 2022, Proceedings of the 2022 ACM CCS Workshop on Decentralized Finance and Security, pp. 31\u201338. Association for Computing Machinery, New York (2022). https:\/\/doi.org\/10.1145\/3560832.3563436","DOI":"10.1145\/3560832.3563436"},{"key":"5_CR40","unstructured":"Montoya, K.: How google manipulated digital ad prices and hurt publishers (2023). https:\/\/www.techpolicy.press\/how-google-manipulated-digital-ad-prices-and-hurt-publishers-per-doj\/"},{"key":"5_CR41","doi-asserted-by":"crossref","unstructured":"Myerson, R.B.: Optimal auction design. Math. Oper. Res. 6(1), 58 (1981)","DOI":"10.1287\/moor.6.1.58"},{"key":"5_CR42","doi-asserted-by":"publisher","unstructured":"Naor, M., Pinkas, B., Sumner, R.: Privacy preserving auctions and mechanism design. In: EC 1999, Proceedings of the 1st ACM Conference on Electronic Commerce, pp. 129\u2013139. Association for Computing Machinery, New York (1999). https:\/\/doi.org\/10.1145\/336992.337028","DOI":"10.1145\/336992.337028"},{"key":"5_CR43","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511800481","volume-title":"Algorithmic Game Theory","author":"N Nisan","year":"2007","unstructured":"Nisan, N., Roughgarden, T., Tardos, E., Vazirani, V.V.: Algorithmic Game Theory. Cambridge University Press, USA (2007)"},{"key":"5_CR44","unstructured":"OpenSea: How to sell an NFT (2023)"},{"key":"5_CR45","unstructured":"Panguluri, R.: Taylor swift ticket sales should be decentralized. blockchain could make that possible (2022). https:\/\/dbknews.com\/2022\/11\/21\/ticketmaster-antitrust-potential-solution-is-blockchain-technology\/"},{"key":"5_CR46","unstructured":"Roughgarden, T.: Transaction fee mechanism design for the Ethereum blockchain: an economic analysis of EIP-1559. Manuscript (2020). https:\/\/timroughgarden.org\/papers\/eip1559.pdf"},{"key":"5_CR47","doi-asserted-by":"crossref","unstructured":"Roughgarden, T.: Transaction fee mechanism design. In: EC (2021)","DOI":"10.1145\/3465456.3467591"},{"key":"5_CR48","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"704","DOI":"10.1007\/978-3-030-56877-1_25","volume-title":"Advances in Cryptology \u2013 CRYPTO 2020","author":"S Setty","year":"2020","unstructured":"Setty, S.: Spartan: efficient and general-purpose zkSNARKs without trusted setup. In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO 2020. LNCS, vol. 12172, pp. 704\u2013737. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56877-1_25"},{"key":"5_CR49","doi-asserted-by":"crossref","unstructured":"Shacham, H., Waters, B.: Compact proofs of retrievability. J. Cryptol. 26(3), 442\u2013483 (2013)","DOI":"10.1007\/s00145-012-9129-2"},{"key":"5_CR50","unstructured":"Shi, E., Chung, H., Wu, K.: What can cryptography do for decentralized mechanism design. In: ITCS (2023)"},{"key":"5_CR51","doi-asserted-by":"crossref","unstructured":"Tyagi, N., Arun, A., Freitag, C., Wahby, R., Bonneau, J., Mazi\u00e8res, D.: Riggs: decentralized sealed-bid auctions. In: CCS 2023, Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security, pp. 1227\u20131241. Association for Computing Machinery, New York (2023)","DOI":"10.1145\/3576915.3623182"},{"key":"5_CR52","doi-asserted-by":"crossref","unstructured":"Vickrey, W.: Counterspeculation, auctions, and competitive sealed tenders. J. Finance 16(1), 8\u201337 (1961). j.1540-6261.1961.tb02789. https:\/\/ideas.repec.org\/a\/bla\/jfinan\/v16y1961i1p8-37.html","DOI":"10.1111\/j.1540-6261.1961.tb02789.x"},{"key":"5_CR53","doi-asserted-by":"publisher","unstructured":"Wu, K., Shi, E., Chung, H.: Maximizing miner revenue in transaction fee mechanism design. In: Guruswami, V. (ed.) 15th Innovations in Theoretical Computer Science Conference (ITCS 2024). Leibniz International Proceedings in Informatics (LIPIcs), vol.\u00a0287, pp. 98:1\u201398:23. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, Germany (2024). https:\/\/doi.org\/10.4230\/LIPIcs.ITCS.2024.98, https:\/\/drops.dagstuhl.de\/entities\/document\/10.4230\/LIPIcs.ITCS.2024.98","DOI":"10.4230\/LIPIcs.ITCS.2024.98"},{"key":"5_CR54","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"733","DOI":"10.1007\/978-3-030-26954-8_24","volume-title":"Advances in Cryptology \u2013 CRYPTO 2019","author":"T Xie","year":"2019","unstructured":"Xie, T., Zhang, J., Zhang, Y., Papamanthou, C., Song, D.: Libra: succinct zero-knowledge proofs with optimal prover computation. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019. LNCS, vol. 11694, pp. 733\u2013764. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26954-8_24"},{"key":"5_CR55","doi-asserted-by":"crossref","unstructured":"Zhang, J., Xie, T., Zhang, Y., Song, D.: Transparent polynomial delegation and its applications to zero knowledge proof. In: 2020 IEEE Symposium on Security and Privacy (S &P), pp. 859\u2013876 (2020)","DOI":"10.1109\/SP40000.2020.00052"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2025"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-01878-6_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,9]],"date-time":"2025-09-09T15:13:15Z","timestamp":1757430795000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-01878-6_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783032018779","9783032018786"],"references-count":55,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-01878-6_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"17 August 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CRYPTO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Cryptology Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Santa Barbara, CA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 August 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 August 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"45","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"crypto2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/crypto.iacr.org\/2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}