{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,26]],"date-time":"2025-04-26T11:25:55Z","timestamp":1745666755111,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":72,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819609345"},{"type":"electronic","value":"9789819609352"}],"license":[{"start":{"date-parts":[[2024,12,9]],"date-time":"2024-12-09T00:00:00Z","timestamp":1733702400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,12,9]],"date-time":"2024-12-09T00:00:00Z","timestamp":1733702400000},"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-981-96-0935-2_8","type":"book-chapter","created":{"date-parts":[[2024,12,8]],"date-time":"2024-12-08T18:01:24Z","timestamp":1733680884000},"page":"236-265","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["MuxProofs: Succinct Arguments for\u00a0Machine Computation from\u00a0Vector Lookups"],"prefix":"10.1007","author":[{"given":"Zijing","family":"Di","sequence":"first","affiliation":[]},{"given":"Lucas","family":"Xia","sequence":"additional","affiliation":[]},{"given":"Wilson","family":"Nguyen","sequence":"additional","affiliation":[]},{"given":"Nirvan","family":"Tyagi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,12,9]]},"reference":[{"key":"8_CR1","unstructured":"Polygon zkevm, https:\/\/wiki.polygon.technology\/docs\/zkEVM\/introduction"},{"key":"8_CR2","unstructured":"Risc zero, https:\/\/www.risczero.com\/docs\/explainers"},{"key":"8_CR3","unstructured":"zksync, https:\/\/v2-docs.zksync.io\/dev\/"},{"key":"8_CR4","unstructured":"zkwasm, https:\/\/github.com\/DelphinusLab\/zkWasm"},{"key":"8_CR5","doi-asserted-by":"crossref","unstructured":"Abe, M., Ohkubo, M., Suzuki, K.: 1-out-of-n signatures from a variety of keys. In: ASIACRYPT. Lecture Notes in Computer Science, vol.\u00a02501, pp. 415\u2013432. Springer (2002)","DOI":"10.1007\/3-540-36178-2_26"},{"key":"8_CR6","unstructured":"Aranha, D.F., Housni, Y.E., Guillevic, A.: A survey of elliptic curves for proof systems. IACR Cryptol. ePrint Arch. p.\u00a0586 (2022), https:\/\/eprint.iacr.org\/2022\/586"},{"key":"8_CR7","doi-asserted-by":"crossref","unstructured":"Arun, A., Setty, S.T.V., Thaler, J.: Jolt: Snarks for virtual machines via lookups. IACR Cryptol. ePrint Arch. p.\u00a01217 (2023)","DOI":"10.1007\/978-3-031-58751-1_1"},{"key":"8_CR8","doi-asserted-by":"crossref","unstructured":"Attema, T., Cramer, R., Fehr, S.: Compressing proofs of k-out-of-n partial knowledge. In: CRYPTO (4). Lecture Notes in Computer Science, vol. 12828, pp. 65\u201391. Springer (2021)","DOI":"10.1007\/978-3-030-84259-8_3"},{"key":"8_CR9","doi-asserted-by":"crossref","unstructured":"Baum, C., Malozemoff, A.J., Rosen, M.B., Scholl, P.: Mac\u2019n\u2019cheese: Zero-knowledge proofs for boolean and arithmetic circuits with nested disjunctions. In: CRYPTO (4). Lecture Notes in Computer Science, vol. 12828, pp. 92\u2013122. Springer (2021)","DOI":"10.1007\/978-3-030-84259-8_4"},{"key":"8_CR10","doi-asserted-by":"crossref","unstructured":"Ben-Sasson, E., Chiesa, A., Genkin, D., Tromer, E., Virza, M.: Snarks for C: verifying program executions succinctly and in zero knowledge. In: CRYPTO (2). Lecture Notes in Computer Science, vol.\u00a08043, pp. 90\u2013108. Springer (2013)","DOI":"10.1007\/978-3-642-40084-1_6"},{"key":"8_CR11","doi-asserted-by":"crossref","unstructured":"Ben-Sasson, E., Chiesa, A., Goldberg, L., Gur, T., Riabzev, M., Spooner, N.: Linear-size constant-query iops for delegating computation. In: TCC (2). Lecture Notes in Computer Science, vol. 11892, pp. 494\u2013521. Springer (2019)","DOI":"10.1007\/978-3-030-36033-7_19"},{"key":"8_CR12","doi-asserted-by":"crossref","unstructured":"Ben-Sasson, E., Chiesa, A., Tromer, E., Virza, M.: Scalable zero knowledge via cycles of elliptic curves. In: CRYPTO (2). Lecture Notes in Computer Science, vol.\u00a08617, pp. 276\u2013294. Springer (2014)","DOI":"10.1007\/978-3-662-44381-1_16"},{"key":"8_CR13","unstructured":"Ben-Sasson, E., Chiesa, A., Tromer, E., Virza, M.: Succinct non-interactive zero knowledge for a von neumann architecture. In: USENIX Security Symposium. pp. 781\u2013796. USENIX Association (2014)"},{"key":"8_CR14","doi-asserted-by":"crossref","unstructured":"Bitansky, N., Canetti, R., Chiesa, A., Tromer, E.: From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again. In: ITCS. pp. 326\u2013349. ACM (2012)","DOI":"10.1145\/2090236.2090263"},{"key":"8_CR15","doi-asserted-by":"crossref","unstructured":"Bitansky, N., Canetti, R., Chiesa, A., Tromer, E.: Recursive composition and bootstrapping for SNARKS and proof-carrying data. In: STOC. pp. 111\u2013120. ACM (2013)","DOI":"10.1145\/2488608.2488623"},{"key":"8_CR16","doi-asserted-by":"crossref","unstructured":"Blum, M., Evans, W.S., Gemmell, P., Kannan, S., Naor, M.: Checking the correctness of memories. In: FOCS. pp. 90\u201399. IEEE Computer Society (1991)","DOI":"10.1109\/SFCS.1991.185352"},{"key":"8_CR17","doi-asserted-by":"crossref","unstructured":"Boneh, D., Drake, J., Fisch, B., Gabizon, A.: Halo infinite: Proof-carrying data from additive polynomial commitments. In: CRYPTO (1). Lecture Notes in Computer Science, vol. 12825, pp. 649\u2013680. Springer (2021)","DOI":"10.1007\/978-3-030-84242-0_23"},{"key":"8_CR18","doi-asserted-by":"crossref","unstructured":"Bootle, J., Cerulli, A., Groth, J., Jakobsen, S.K., Maller, M.: Arya: Nearly linear-time zero-knowledge proofs for correct program execution. In: ASIACRYPT (1). Lecture Notes in Computer Science, vol. 11272, pp. 595\u2013626. Springer (2018)","DOI":"10.1007\/978-3-030-03326-2_20"},{"key":"8_CR19","doi-asserted-by":"crossref","unstructured":"Bowe, S., Chiesa, A., Green, M., Miers, I., Mishra, P., Wu, H.: ZEXE: enabling decentralized private computation. In: IEEE Symposium on Security and Privacy. pp. 947\u2013964. IEEE (2020)","DOI":"10.1109\/SP40000.2020.00050"},{"key":"8_CR20","unstructured":"Bowe, S., Grigg, J., Hopwood, D.: Halo: Recursive proof composition without a trusted setup. IACR Cryptol. ePrint Arch. p.\u00a01021 (2019)"},{"key":"8_CR21","doi-asserted-by":"crossref","unstructured":"Braun, B., Feldman, A.J., Ren, Z., Setty, S.T.V., Blumberg, A.J., Walfish, M.: Verifying computations with state. In: SOSP. pp. 341\u2013357. ACM (2013)","DOI":"10.1145\/2517349.2522733"},{"key":"8_CR22","doi-asserted-by":"crossref","unstructured":"B\u00fcnz, B., Chen, B.: Protostar: Generic efficient accumulation\/folding for special sound protocols. IACR Cryptol. ePrint Arch. p.\u00a0620 (2023)","DOI":"10.1007\/978-981-99-8724-5_3"},{"key":"8_CR23","doi-asserted-by":"crossref","unstructured":"B\u00fcnz, B., Chiesa, A., Lin, W., Mishra, P., Spooner, N.: Proof-carrying data without succinct arguments. In: CRYPTO (1). Lecture Notes in Computer Science, vol. 12825, pp. 681\u2013710. Springer (2021)","DOI":"10.1007\/978-3-030-84242-0_24"},{"key":"8_CR24","doi-asserted-by":"crossref","unstructured":"B\u00fcnz, B., Chiesa, A., Mishra, P., Spooner, N.: Recursive proof composition from accumulation schemes. In: TCC (2). Lecture Notes in Computer Science, vol. 12551, pp. 1\u201318. Springer (2020)","DOI":"10.1007\/978-3-030-64378-2_1"},{"key":"8_CR25","doi-asserted-by":"crossref","unstructured":"B\u00fcnz, B., Fisch, B., Szepieniec, A.: Transparent snarks from DARK compilers. In: EUROCRYPT (1). Lecture Notes in Computer Science, vol. 12105, pp. 677\u2013706. Springer (2020)","DOI":"10.1007\/978-3-030-45721-1_24"},{"key":"8_CR26","doi-asserted-by":"crossref","unstructured":"Campanelli, M., Faonio, A., Fiore, D., Li, T., Lipmaa, H.: Lookup arguments: Improvements, extensions and applications to zero-knowledge decision trees. IACR Cryptol. ePrint Arch. p.\u00a01518 (2023)","DOI":"10.1007\/978-3-031-57722-2_11"},{"key":"8_CR27","doi-asserted-by":"crossref","unstructured":"Chen, B., B\u00fcnz, B., Boneh, D., Zhang, Z.: Hyperplonk: Plonk with linear-time prover and high-degree custom gates. In: EUROCRYPT (2). Lecture Notes in Computer Science, vol. 14005, pp. 499\u2013530. Springer (2023)","DOI":"10.1007\/978-3-031-30617-4_17"},{"key":"8_CR28","doi-asserted-by":"crossref","unstructured":"Chen, M., Chiesa, A., Gur, T., O\u2019Connor, J., Spooner, N.: Proof-carrying data from arithmetized random oracles. In: EUROCRYPT (2). Lecture Notes in Computer Science, vol. 14005, pp. 379\u2013404. Springer (2023)","DOI":"10.1007\/978-3-031-30617-4_13"},{"key":"8_CR29","doi-asserted-by":"crossref","unstructured":"Chen, M., Chiesa, A., Spooner, N.: On succinct non-interactive arguments in relativized worlds. In: EUROCRYPT (2). Lecture Notes in Computer Science, vol. 13276, pp. 336\u2013366. Springer (2022)","DOI":"10.1007\/978-3-031-07085-3_12"},{"key":"8_CR30","doi-asserted-by":"crossref","unstructured":"Chiesa, A., Hu, Y., Maller, M., Mishra, P., Vesely, P., Ward, N.P.: Marlin: Preprocessing zksnarks with universal and updatable SRS. In: EUROCRYPT (1). Lecture Notes in Computer Science, vol. 12105, pp. 738\u2013768. Springer (2020)","DOI":"10.1007\/978-3-030-45721-1_26"},{"key":"8_CR31","doi-asserted-by":"crossref","unstructured":"Choudhuri, A.R., Garg, S., Goel, A., Sekar, S., Sinha, R.: Sublonk: Sublinear prover plonk. IACR Cryptol. ePrint Arch. p.\u00a0902 (2023)","DOI":"10.56553\/popets-2024-0080"},{"key":"8_CR32","doi-asserted-by":"crossref","unstructured":"Cramer, R., Damg\u00e5rd, I., Schoenmakers, B.: Proofs of partial knowledge and simplified design of witness hiding protocols. In: CRYPTO. Lecture Notes in Computer Science, vol.\u00a0839, pp. 174\u2013187. Springer (1994)","DOI":"10.1007\/3-540-48658-5_19"},{"key":"8_CR33","unstructured":"Di, Z., Xia, L., Nguyen, W.D., Tyagi, N.: Muxproofs: Succinct arguments for machine computation from vector lookups. IACR Cryptol. ePrint Arch. p.\u00a0974 (2023)"},{"key":"8_CR34","unstructured":"Diamond, B.E., Posen, J.: Succinct arguments over towers of binary fields. IACR Cryptol. ePrint Arch. p.\u00a01784 (2023)"},{"key":"8_CR35","unstructured":"Eagen, L., Fiore, D., Gabizon, A.: cq: Cached quotients for fast lookups. IACR Cryptol. ePrint Arch. p.\u00a01763 (2022)"},{"key":"8_CR36","unstructured":"Gabizon, A., Khovratovich, D.: flookup: Fractional decomposition-based lookups in quasi-linear time independent of table size. IACR Cryptol. ePrint Arch. p.\u00a01447 (2022)"},{"key":"8_CR37","unstructured":"Gabizon, A., Williamson, Z.J.: plookup: A simplified polynomial protocol for lookup tables. IACR Cryptol. ePrint Arch. p.\u00a0315 (2020)"},{"key":"8_CR38","unstructured":"Gabizon, A., Williamson, Z.J., Ciobotaru, O.: PLONK: permutations over lagrange-bases for oecumenical noninteractive arguments of knowledge. IACR Cryptol. ePrint Arch. p.\u00a0953 (2019)"},{"key":"8_CR39","doi-asserted-by":"crossref","unstructured":"Gentry, C., Wichs, D.: Separating succinct non-interactive arguments from all falsifiable assumptions. In: STOC. pp. 99\u2013108. ACM (2011)","DOI":"10.1145\/1993636.1993651"},{"key":"8_CR40","doi-asserted-by":"crossref","unstructured":"Goel, A., Green, M., Hall-Andersen, M., Kaptchuk, G.: Stacking sigmas: A framework to compose $$\\varsigma $$-protocols for disjunctions. In: EUROCRYPT (2). Lecture Notes in Computer Science, vol. 13276, pp. 458\u2013487. Springer (2022)","DOI":"10.1007\/978-3-031-07085-3_16"},{"key":"8_CR41","unstructured":"Goel, A., Hall-Andersen, M., Kaptchuk, G.: Dora: Processor expressiveness is (nearly) free in zero-knowledge for RAM programs. IACR Cryptol. ePrint Arch. p.\u00a01749 (2023)"},{"key":"8_CR42","doi-asserted-by":"crossref","unstructured":"Goel, A., Hall-Andersen, M., Kaptchuk, G., Spooner, N.: Speed-stacking: Fast sublinear zero-knowledge proofs for disjunctions. IACR Cryptol. ePrint Arch. p.\u00a01419 (2022)","DOI":"10.1007\/978-3-031-30617-4_12"},{"key":"8_CR43","doi-asserted-by":"crossref","unstructured":"Golovnev, A., Lee, J., Setty, S.T.V., Thaler, J., Wahby, R.S.: Brakedown: Linear-time and field-agnostic snarks for R1CS. In: CRYPTO (2). Lecture Notes in Computer Science, vol. 14082, pp. 193\u2013226. Springer (2023)","DOI":"10.1007\/978-3-031-38545-2_7"},{"key":"8_CR44","doi-asserted-by":"crossref","unstructured":"Groth, J., Kohlweiss, M.: One-out-of-many proofs: Or how to leak a secret and spend a coin. In: EUROCRYPT (2). Lecture Notes in Computer Science, vol.\u00a09057, pp. 253\u2013280. Springer (2015)","DOI":"10.1007\/978-3-662-46803-6_9"},{"key":"8_CR45","unstructured":"Hab\u00f6ck, U.: Multivariate lookups based on logarithmic derivatives. IACR Cryptol. ePrint Arch. p.\u00a01530 (2022)"},{"key":"8_CR46","doi-asserted-by":"crossref","unstructured":"Heath, D., Kolesnikov, V.: Stacked garbling for disjunctive zero-knowledge proofs. In: EUROCRYPT (3). Lecture Notes in Computer Science, vol. 12107, pp. 569\u2013598. Springer (2020)","DOI":"10.1007\/978-3-030-45727-3_19"},{"key":"8_CR47","doi-asserted-by":"crossref","unstructured":"Kate, A., Zaverucha, G.M., Goldberg, I.: Constant-size commitments to polynomials and their applications. In: ASIACRYPT. Lecture Notes in Computer Science, vol.\u00a06477, pp. 177\u2013194. Springer (2010)","DOI":"10.1007\/978-3-642-17373-8_11"},{"key":"8_CR48","doi-asserted-by":"crossref","unstructured":"Kilian, J.: A note on efficient zero-knowledge proofs and arguments (extended abstract). In: STOC. pp. 723\u2013732. ACM (1992)","DOI":"10.1145\/129712.129782"},{"key":"8_CR49","unstructured":"Kosba, A.E., Papadopoulos, D., Papamanthou, C., Song, D.: MIRAGE: succinct arguments for randomized algorithms with applications to universal zk-snarks. In: USENIX Security Symposium. pp. 2129\u20132146. USENIX Association (2020)"},{"key":"8_CR50","unstructured":"Kothapalli, A., Setty, S.: Supernova: Proving universal machine executions without universal circuits. IACR Cryptol. ePrint Arch. p.\u00a01758 (2022)"},{"key":"8_CR51","doi-asserted-by":"crossref","unstructured":"Kothapalli, A., Setty, S., Tzialla, I.: Nova: Recursive zero-knowledge arguments from folding schemes. In: CRYPTO (4). Lecture Notes in Computer Science, vol. 13510, pp. 359\u2013388. Springer (2022)","DOI":"10.1007\/978-3-031-15985-5_13"},{"key":"8_CR52","unstructured":"Kothapalli, A., Setty, S.T.V.: Cyclefold: Folding-scheme-based recursive arguments over a cycle of elliptic curves. IACR Cryptol. ePrint Arch. p.\u00a01192 (2023)"},{"key":"8_CR53","doi-asserted-by":"crossref","unstructured":"Lee, J., Nikitin, K., Setty, S.T.V.: Replicated state machines without replicated execution. In: IEEE Symposium on Security and Privacy. pp. 119\u2013134. IEEE (2020)","DOI":"10.1109\/SP40000.2020.00068"},{"key":"8_CR54","doi-asserted-by":"crossref","unstructured":"Lund, C., Fortnow, L., Karloff, H.J., Nisan, N.: Algebraic methods for interactive proof systems. J. ACM 39(4), 859\u2013868 (1992)","DOI":"10.1145\/146585.146605"},{"key":"8_CR55","doi-asserted-by":"crossref","unstructured":"Micali, S.: CS proofs (extended abstracts). In: FOCS. pp. 436\u2013453. IEEE Computer Society (1994)","DOI":"10.1109\/SFCS.1994.365746"},{"key":"8_CR56","unstructured":"Nguyen, W.D., Boneh, D., Setty, S.T.V.: Revisiting the nova proof system on a cycle of curves. In: AFT. LIPIcs, vol.\u00a0282, pp. 18:1\u201318:22. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2023)"},{"key":"8_CR57","doi-asserted-by":"crossref","unstructured":"Nguyen, W.D., Datta, T., Chen, B., Tyagi, N., Boneh, D.: Mangrove: A scalable framework for folding-based snarks. IACR Cryptol. ePrint Arch. p.\u00a0416 (2024)","DOI":"10.1007\/978-3-031-68403-6_10"},{"key":"8_CR58","unstructured":"Posen, J., Kattis, A.A.: Caulk+: Table-independent lookup arguments. IACR Cryptol. ePrint Arch. p.\u00a0957 (2022)"},{"key":"8_CR59","doi-asserted-by":"crossref","unstructured":"Setty, S.T.V.: Spartan: Efficient and general-purpose zksnarks without trusted setup. In: CRYPTO (3). Lecture Notes in Computer Science, vol. 12172, pp. 704\u2013737. Springer (2020)","DOI":"10.1007\/978-3-030-56877-1_25"},{"key":"8_CR60","unstructured":"Setty, S.T.V., Angel, S., Gupta, T., Lee, J.: Proving the correct execution of concurrent services in zero-knowledge. In: OSDI. pp. 339\u2013356. USENIX Association (2018)"},{"key":"8_CR61","unstructured":"Setty, S.T.V., Thaler, J., Wahby, R.S.: Customizable constraint systems for succinct arguments. IACR Cryptol. ePrint Arch. p.\u00a0552 (2023)"},{"key":"8_CR62","doi-asserted-by":"crossref","unstructured":"Setty, S.T.V., Thaler, J., Wahby, R.S.: Unlocking the lookup singularity with lasso. IACR Cryptol. ePrint Arch. p.\u00a01216 (2023)","DOI":"10.1007\/978-3-031-58751-1_7"},{"key":"8_CR63","doi-asserted-by":"crossref","unstructured":"Valiant, P.: Incrementally verifiable computation or proofs of knowledge imply time\/space efficiency. In: TCC. Lecture Notes in Computer Science, vol.\u00a04948, pp. 1\u201318. Springer (2008)","DOI":"10.1007\/978-3-540-78524-8_1"},{"key":"8_CR64","doi-asserted-by":"crossref","unstructured":"Wahby, R.S., Setty, S.T.V., Ren, Z., Blumberg, A.J., Walfish, M.: Efficient RAM and control flow in verifiable outsourced computation. In: NDSS. The Internet Society (2015)","DOI":"10.14722\/ndss.2015.23097"},{"key":"8_CR65","doi-asserted-by":"crossref","unstructured":"Xie, T., Zhang, Y., Song, D.: Orion: Zero knowledge proof with linear prover time. In: CRYPTO (4). Lecture Notes in Computer Science, vol. 13510, pp. 299\u2013328. Springer (2022)","DOI":"10.1007\/978-3-031-15985-5_11"},{"key":"8_CR66","unstructured":"Xiong, A.L., Chen, B., Zhang, Z., B\u00fcnz, B., Fisch, B., Krell, F., Camacho, P.: VERI-ZEXE: decentralized private computation with universal setup. IACR Cryptol. ePrint Arch. p.\u00a0802 (2022)"},{"key":"8_CR67","unstructured":"Yang, Y., Heath, D.: Two shuffles make a RAM: improved constant overhead zero knowledge RAM. IACR Cryptol. ePrint Arch. p.\u00a01115 (2023)"},{"key":"8_CR68","doi-asserted-by":"crossref","unstructured":"Yang, Y., Heath, D., Hazay, C., Kolesnikov, V., Venkitasubramaniam, M.: Batchman and robin: Batched and non-batched branching for interactive ZK. In: CCS. pp. 1452\u20131466. ACM (2023)","DOI":"10.1145\/3576915.3623169"},{"key":"8_CR69","unstructured":"Yang, Y., Heath, D., Hazay, C., Kolesnikov, V., Venkitasubramaniam, M.: Tight zk cpu: Batched zk branching with cost proportional to evaluated instruction. IACR Cryptol. ePrint Arch. p.\u00a0456 (2024)"},{"key":"8_CR70","doi-asserted-by":"crossref","unstructured":"Zapico, A., Buterin, V., Khovratovich, D., Maller, M., Nitulescu, A., Simkin, M.: Caulk: Lookup arguments in sublinear time. In: CCS. pp. 3121\u20133134. ACM (2022)","DOI":"10.1145\/3548606.3560646"},{"key":"8_CR71","unstructured":"Zapico, A., Gabizon, A., Khovratovich, D., Maller, M., R\u00e0fols, C.: Baloo: Nearly optimal lookup arguments. IACR Cryptol. ePrint Arch. p.\u00a01565 (2022)"},{"key":"8_CR72","doi-asserted-by":"crossref","unstructured":"Zhang, Y., Genkin, D., Katz, J., Papadopoulos, D., Papamanthou, C.: vram: Faster verifiable RAM with program-independent preprocessing. In: IEEE Symposium on Security and Privacy. pp. 908\u2013925. IEEE Computer Society (2018)","DOI":"10.1109\/SP.2018.00013"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 ASIACRYPT 2024"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-96-0935-2_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,8]],"date-time":"2024-12-08T18:02:41Z","timestamp":1733680961000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-96-0935-2_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,9]]},"ISBN":["9789819609345","9789819609352"],"references-count":72,"URL":"https:\/\/doi.org\/10.1007\/978-981-96-0935-2_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024,12,9]]},"assertion":[{"value":"9 December 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ASIACRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on the Theory and Application of Cryptology and Information Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Kolkata","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 December 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 December 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"asiacrypt2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/asiacrypt.iacr.org\/2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}