{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,28]],"date-time":"2026-04-28T00:49:02Z","timestamp":1777337342279,"version":"3.51.4"},"publisher-location":"Cham","reference-count":54,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031587399","type":"print"},{"value":"9783031587405","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-58740-5_9","type":"book-chapter","created":{"date-parts":[[2024,4,28]],"date-time":"2024-04-28T02:01:45Z","timestamp":1714269705000},"page":"249-279","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Bulletproofs++: Next Generation Confidential Transactions via\u00a0Reciprocal Set Membership Arguments"],"prefix":"10.1007","author":[{"given":"Liam","family":"Eagen","sequence":"first","affiliation":[]},{"given":"Sanket","family":"Kanjalkar","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6237-5228","authenticated-orcid":false,"given":"Tim","family":"Ruffing","sequence":"additional","affiliation":[]},{"given":"Jonas","family":"Nick","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,4,29]]},"reference":[{"key":"9_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1007\/978-3-030-56877-1_18","volume-title":"Advances in Cryptology \u2013 CRYPTO 2020","author":"T Attema","year":"2020","unstructured":"Attema, T., Cramer, R.: Compressed $$ \\Sigma $$-protocol theory and\u00a0practical application\u00a0to\u00a0plug\u00a0 &\u00a0play secure algorithmics. In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO 2020, Part III. LNCS, vol. 12172, pp. 513\u2013543. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56877-1_18"},{"key":"9_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/978-3-031-22318-1_5","volume-title":"Theory of Cryptography - TCC 2022","author":"T Attema","year":"2022","unstructured":"Attema, T., Fehr, S., Kloo\u00df, M.: Fiat-Shamir transformation of multi-round interactive proofs. In: Kiltz, E., Vaikuntanathan, V. (eds.) TCC 2022, Part I. LNCS, vol. 13747, pp. 113\u2013142. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-22318-1_5"},{"key":"9_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/978-3-642-29011-4_17","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2012","author":"S Bayer","year":"2012","unstructured":"Bayer, S., Groth, J.: Efficient zero-knowledge argument for correctness of a shuffle. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol. 7237, pp. 263\u2013280. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29011-4_17"},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"Bellare, M., Rogaway, P.: Random oracles are practical: a paradigm for designing efficient protocols. In: ACM CCS 93 (1993). https:\/\/doi.org\/10.1145\/168588.168596","DOI":"10.1145\/168588.168596"},{"key":"9_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/978-3-662-49896-5_12","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2016","author":"J Bootle","year":"2016","unstructured":"Bootle, J., Cerulli, A., Chaidos, P., Groth, J., Petit, C.: Efficient zero-knowledge arguments for arithmetic circuits in the discrete log setting. In: Fischlin, M., Coron, J.-S. (eds.) EUROCRYPT 2016. LNCS, vol. 9666, pp. 327\u2013357. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49896-5_12"},{"key":"9_CR6","unstructured":"Bowe, S., Grigg, J., Hopwood, D.: Halo: recursive proof composition without a trusted setup. Cryptology ePrint Archive, Report 2019\/1021 (2019). https:\/\/eprint.iacr.org\/2019\/1021"},{"key":"9_CR7","unstructured":"Bowe, S., Hornby, T., Wilcox, N.: Zcash protocol specification (2023). Version 2023.4.0 https:\/\/github.com\/zcash\/zips\/blob\/main\/protocol\/protocol.pdf"},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"B\u00fcnz, B., Bootle, J., Boneh, D., Poelstra, A., Wuille, P., Maxwell, G.: Bulletproofs: short proofs for confidential transactions and more. In: 2018 IEEE Symposium on Security and Privacy (2018). https:\/\/doi.org\/10.1109\/SP.2018.00020","DOI":"10.1109\/SP.2018.00020"},{"key":"9_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-030-64378-2_1","volume-title":"Theory of Cryptography","author":"B B\u00fcnz","year":"2020","unstructured":"B\u00fcnz, B., Chiesa, A., Mishra, P., Spooner, N.: Recursive proof composition from accumulation schemes. In: Pass, R., Pietrzak, K. (eds.) TCC 2020, Part II. LNCS, vol. 12551, pp. 1\u201318. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64378-2_1"},{"key":"9_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1007\/978-3-030-45721-1_24","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2020","author":"B B\u00fcnz","year":"2020","unstructured":"B\u00fcnz, B., Fisch, B., Szepieniec, A.: Transparent SNARKs from DARK compilers. In: Canteaut, A., Ishai, Y. (eds.) EUROCRYPT 2020, Part I. LNCS, vol. 12105, pp. 677\u2013706. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45721-1_24"},{"key":"9_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1007\/978-3-540-89255-7_15","volume-title":"Advances in Cryptology - ASIACRYPT 2008","author":"J Camenisch","year":"2008","unstructured":"Camenisch, J., Chaabouni, R., shelat, A.: Efficient protocols for set membership and range proofs. In: Pieprzyk, J. (ed.) ASIACRYPT 2008. LNCS, vol. 5350, pp. 234\u2013252. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-89255-7_15"},{"key":"9_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1007\/978-3-642-14081-5_21","volume-title":"Information Security and Privacy","author":"R Chaabouni","year":"2010","unstructured":"Chaabouni, R., Lipmaa, H., Shelat, A.: Additive combinatorics and discrete logarithm based range protocols. In: Steinfeld, R., Hawkes, P. (eds.) ACISP 2010. LNCS, vol. 6168, pp. 336\u2013351. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14081-5_21"},{"key":"9_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1007\/978-3-031-30617-4_17","volume-title":"Advances in Cryptology - EUROCRYPT 2023","author":"B Chen","year":"2023","unstructured":"Chen, B., B\u00fcnz, B., Boneh, D., Zhang, Z.: HyperPlonk: plonk with linear-time prover and high-degree custom gates. In: Hazay, C., Stam, M. (eds.) EUROCRYPT 2023, Part II. LNCS, vol. 14005, pp. 499\u2013530. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-30617-4_17"},{"key":"9_CR14","unstructured":"Chung, H., Han, K., Ju, C., Kim, M., Seo, J.H.: Bulletproofs+ implementation. https:\/\/github.com\/KyoohyungHan\/BulletProofsPlus\/commit\/2c9dd40"},{"key":"9_CR15","doi-asserted-by":"crossref","unstructured":"Chung, H., Han, K., Ju, C., Kim, M., Seo, J.H.: Bulletproofs+: shorter proofs for a privacy-enhanced distributed ledger. IEEE Access 10 (2022)","DOI":"10.1109\/ACCESS.2022.3167806"},{"key":"9_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/978-3-030-77883-5_9","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2021","author":"G Couteau","year":"2021","unstructured":"Couteau, G., Kloo\u00df, M., Lin, H., Reichle, M.: Efficient range proofs with transparent setup from bounded integer commitments. In: Canteaut, A., Standaert, F.-X. (eds.) EUROCRYPT 2021, Part III. LNCS, vol. 12698, pp. 247\u2013277. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-77883-5_9"},{"key":"9_CR17","unstructured":"Dalek Cryptography Bulletproofs. https:\/\/github.com\/dalek-cryptography\/bulletproofs\/commit\/be67b6d5f5ad1c1f54d5511b52e6d645a1313d07"},{"key":"9_CR18","unstructured":"Eagen, L., Fiore, D., Gabizon, A.: CQ: cached quotients for fast lookups. Cryptology ePrint Archive, Report 2022\/1763 (2022). https:\/\/eprint.iacr.org\/2022\/1763"},{"key":"9_CR19","unstructured":"Eagen, L., Kanjalkar, S., Ruffing, T., Nick, J.: Bulletproofs++ C implementation used for benchmarks. https:\/\/github.com\/sanket1729\/secp256k1-zkp\/commit\/785f9d728086dd5b9c697ca4d452c517b8243a85"},{"key":"9_CR20","unstructured":"Eagen, L., Kanjalkar, S., Ruffing, T., Nick, J.: Bulletproofs++: next generation confidential transactions via reciprocal set membership arguments. Cryptology ePrint Archive, Paper 2022\/510 (2022). https:\/\/eprint.iacr.org\/2022\/510"},{"key":"9_CR21","unstructured":"Gabizon, A., Williamson, Z.J.: plookup: A simplified polynomial protocol for lookup tables. Cryptology ePrint Archive, Report 2020\/315 (2020). https:\/\/eprint.iacr.org\/2020\/315"},{"key":"9_CR22","unstructured":"Gabizon, A., Williamson, Z.J., Ciobotaru, O.: PLONK: permutations over lagrange-bases for oecumenical noninteractive arguments of knowledge. Cryptology ePrint Archive, Report 2019\/953 (2019). https:\/\/eprint.iacr.org\/2019\/953"},{"key":"9_CR23","unstructured":"Ganesh, C., Orlandi, C., Pancholi, M., Takahashi, A., Tschudi, D.: Fiat-Shamir bulletproofs are non-malleable (in the random oracle model). Cryptology ePrint Archive, Report 2023\/147 (2023). https:\/\/eprint.iacr.org\/2023\/147"},{"key":"9_CR24","doi-asserted-by":"crossref","unstructured":"Ghesmati, S., Fdhila, W., Weippl, E.R.: SoK: how private is bitcoin? Classification and evaluation of bitcoin privacy techniques. In: ARES 2022 (2022)","DOI":"10.1145\/3538969.3538971"},{"key":"9_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1007\/978-3-030-84252-9_3","volume-title":"Advances in Cryptology \u2013 CRYPTO 2021","author":"A Ghoshal","year":"2021","unstructured":"Ghoshal, A., Tessaro, S.: Tight state-restoration soundness in the algebraic group model. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021, Part III. LNCS, vol. 12827, pp. 64\u201393. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84252-9_3"},{"key":"9_CR26","unstructured":"Gibson, A.: An Investigation into Confidential Transactions (2016). https:\/\/github.com\/AdamISZ\/ConfidentialTransactionsDoc\/raw\/master\/essayonCT.pdf"},{"key":"9_CR27","unstructured":"Grin. https:\/\/www.grin-tech.org\/"},{"key":"9_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1007\/11496137_32","volume-title":"Applied Cryptography and Network Security","author":"J Groth","year":"2005","unstructured":"Groth, J.: Non-interactive zero-knowledge arguments for voting. In: Ioannidis, J., Keromytis, A., Yung, M. (eds.) ACNS 2005. LNCS, vol. 3531, pp. 467\u2013482. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11496137_32"},{"key":"9_CR29","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":"9_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/978-3-540-78967-3_22","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2008","author":"J Groth","year":"2008","unstructured":"Groth, J., Ishai, Y.: Sub-linear zero-knowledge argument for correctness of a shuffle. In: Smart, N. (ed.) EUROCRYPT 2008. LNCS, vol. 4965, pp. 379\u2013396. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78967-3_22"},{"key":"9_CR31","unstructured":"Hab\u00f6ck, U.: Multivariate lookups based on logarithmic derivatives. Cryptology ePrint Archive, Report 2022\/1530 (2022). https:\/\/eprint.iacr.org\/2022\/1530"},{"key":"9_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"414","DOI":"10.1007\/978-3-030-64381-2_15","volume-title":"Theory of Cryptography","author":"J Jaeger","year":"2020","unstructured":"Jaeger, J., Tessaro, S.: Expected-time cryptography: generic techniques and applications to concrete soundness. In: Pass, R., Pietrzak, K. (eds.) TCC 2020, Part III. LNCS, vol. 12552, pp. 414\u2013443. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64381-2_15"},{"key":"9_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-030-90453-1_1","volume-title":"Theory of Cryptography","author":"J Lee","year":"2021","unstructured":"Lee, J.: Dory: efficient, transparent arguments for generalised inner products and polynomial commitments. In: Nissim, K., Waters, B. (eds.) TCC 2021, Part II. LNCS, vol. 13043, pp. 1\u201334. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-90453-1_1"},{"key":"9_CR34","doi-asserted-by":"crossref","unstructured":"Lindell, Y.: Parallel coin-tossing and constant-round secure two-party computation. J. Cryptol. 16(3) (2003). https:\/\/doi.org\/10.1007\/s00145-002-0143-7","DOI":"10.1007\/s00145-002-0143-7"},{"key":"9_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1007\/978-3-540-40061-5_26","volume-title":"Advances in Cryptology - ASIACRYPT 2003","author":"H Lipmaa","year":"2003","unstructured":"Lipmaa, H.: On diophantine complexity and statistical zero-knowledge arguments. In: Laih, C.-S. (ed.) ASIACRYPT 2003. LNCS, vol. 2894, pp. 398\u2013415. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-40061-5_26"},{"key":"9_CR36","unstructured":"Maxwell, G.: CoinJoin: Bitcoin privacy for the real world (2013). BitcoinTalk post, https:\/\/bitcointalk.org\/index.php?topic=279249.0"},{"key":"9_CR37","unstructured":"Maxwell, G.: Confidential Transactions (2015). https:\/\/web.archive.org\/web\/20190502140939\/https:\/\/people.xiph.org\/~greg\/confidential_values.txt"},{"key":"9_CR38","doi-asserted-by":"crossref","unstructured":"Meiklejohn, S., et al.: A fistful of bitcoins: characterizing payments among men with no names. In: Internet Measurement Conference (IMC). https:\/\/doi.org\/10.1145\/2504730.2504747","DOI":"10.1145\/2504730.2504747"},{"key":"9_CR39","unstructured":"Monero. https:\/\/monero.org\/"},{"key":"9_CR40","unstructured":"Nakamoto, S.: Bitcoin: a peer-to-peer electronic cash system (2008). https:\/\/bitcoin.org\/bitcoin.pdf"},{"key":"9_CR41","unstructured":"Nick, J., Poelstra, A., Sanders, G.: Liquid: a bitcoin sidechain. Technical report (2020). https:\/\/blockstream.com\/assets\/downloads\/pdf\/liquid-whitepaper.pdf"},{"key":"9_CR42","unstructured":"Poelstra, A.: Bulletproofs implementation in libsecp256k1-zkp. https:\/\/github.com\/BlockstreamResearch\/secp256k1-zkp\/pull\/23\/commits\/6fb7e05"},{"key":"9_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/978-3-662-58820-8_4","volume-title":"Financial Cryptography and Data Security","author":"A Poelstra","year":"2019","unstructured":"Poelstra, A., Back, A., Friedenbach, M., Maxwell, G., Wuille, P.: Confidential assets. In: Zohar, A., et al. (eds.) FC 2018. LNCS, vol. 10958, pp. 43\u201363. Springer, Heidelberg (2019). https:\/\/doi.org\/10.1007\/978-3-662-58820-8_4"},{"key":"9_CR44","unstructured":"Poelstra, A. et al.: libsecp256-zkp. See https:\/\/github.com\/ElementsProject\/secp256k1-zkp"},{"key":"9_CR45","unstructured":"Posen, J., Kattis, A.A.: Caulk+: table-independent lookup arguments. Cryptology ePrint Archive, Report 2022\/957 (2022). https:\/\/eprint.iacr.org\/2022\/957"},{"key":"9_CR46","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/978-3-319-70278-0_8","volume-title":"Financial Cryptography and Data Security","author":"T Ruffing","year":"2017","unstructured":"Ruffing, T., Moreno-Sanchez, P.: ValueShuffle: mixing confidential transactions for comprehensive transaction privacy in\u00a0bitcoin. In: Brenner, M., et al. (eds.) FC 2017. LNCS, vol. 10323, pp. 133\u2013154. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70278-0_8"},{"key":"9_CR47","unstructured":"sethforprivacy: Monero will undergo a network upgrade on 13th August, 2022 (2022). https:\/\/web.getmonero.org\/2022\/04\/20\/network-upgrade-july-2022.html"},{"key":"9_CR48","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1007\/978-3-662-45472-5_29","volume-title":"Financial Cryptography and Data Security","author":"M Spagnuolo","year":"2014","unstructured":"Spagnuolo, M., Maggi, F., Zanero, S.: BitIodine: extracting intelligence from the bitcoin network. In: Christin, N., Safavi-Naini, R. (eds.) FC 2014. LNCS, vol. 8437, pp. 457\u2013468. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-45472-5_29"},{"key":"9_CR49","unstructured":"The Halo 2 Developers: Halo2 (2020). https:\/\/zcash.github.io\/halo2\/"},{"key":"9_CR50","unstructured":"Valence, H. de, Yun, C., Andreev, O.: Cloak (2019). https:\/\/github.com\/stellar\/slingshot\/blob\/main\/spacesuit\/spec.md"},{"key":"9_CR51","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/978-3-031-22966-4_8","volume-title":"Advances in Cryptology - ASIACRYPT 2022","author":"N Wang","year":"2022","unstructured":"Wang, N., Chau, S.C.-K.: Flashproofs: efficient zero-knowledge arguments of range and polynomial evaluation with transparent setup. In: Agrawal, S., Lin, D. (eds.) ASIACRYPT 2022, Part II. LNCS, vol. 13792, pp. 219\u2013248. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-22966-4_8"},{"key":"9_CR52","unstructured":"Wang, N., Chau, S.C.-K., Liu, D.: SwiftRange: a short and efficient zero-knowledge range argument for confidential transactions and more. Cryptology ePrint Archive, Paper 2023\/1185 (2023). https:\/\/eprint.iacr.org\/2023\/1185"},{"key":"9_CR53","unstructured":"Wikstr\u00f6m, D.: Special soundness in the random oracle model. Cryptology ePrint Archive, Report 2021\/1265 (2021). https:\/\/eprint.iacr.org\/2021\/1265"},{"key":"9_CR54","doi-asserted-by":"crossref","unstructured":"Zapico, A., Buterin, V., Khovratovich, D., Maller, M., Nitulescu, A., Simkin, M.: Caulk: lookup arguments in sublinear time. In: ACM CCS 2022 (2022). https:\/\/doi.org\/10.1145\/3548606.3560646","DOI":"10.1145\/3548606.3560646"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 EUROCRYPT 2024"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-58740-5_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,28]],"date-time":"2026-04-28T00:06:11Z","timestamp":1777334771000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-58740-5_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031587399","9783031587405"],"references-count":54,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-58740-5_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"29 April 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EUROCRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Conference on the Theory and Applications of Cryptographic Techniques","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Zurich","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Switzerland","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":"26 May 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 May 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"43","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"eurocrypt2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/eurocrypt.iacr.org\/2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}