{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,7]],"date-time":"2025-12-07T13:10:42Z","timestamp":1765113042654,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":60,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819608744"},{"type":"electronic","value":"9789819608751"}],"license":[{"start":{"date-parts":[[2024,12,10]],"date-time":"2024-12-10T00:00:00Z","timestamp":1733788800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,12,10]],"date-time":"2024-12-10T00:00:00Z","timestamp":1733788800000},"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-0875-1_4","type":"book-chapter","created":{"date-parts":[[2024,12,9]],"date-time":"2024-12-09T07:10:14Z","timestamp":1733728214000},"page":"105-139","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Updatable Privacy-Preserving Blueprints"],"prefix":"10.1007","author":[{"given":"Bernardo","family":"David","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9356-0231","authenticated-orcid":false,"given":"Felix","family":"Engelmann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tore","family":"Frederiksen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8660-9663","authenticated-orcid":false,"given":"Markulf","family":"Kohlweiss","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7804-6696","authenticated-orcid":false,"given":"Elena","family":"Pagnin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mikhail","family":"Volkhov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,12,10]]},"reference":[{"key":"4_CR1","doi-asserted-by":"publisher","unstructured":"T. Acar and L. Nguyen. \u201cRevocation for Delegatable Anonymous Credentials\u201d. In: PKC 2011. Ed. by D. Catalano, N. Fazio, R. Gennaro, and A. Nicolosi. Vol. 6571. LNCS. Springer, Heidelberg, Mar. 2011, pp. 423\u2013440. https:\/\/doi.org\/10.1007\/978-3-642-19379-8_26.","DOI":"10.1007\/978-3-642-19379-8_26"},{"key":"4_CR2","doi-asserted-by":"publisher","unstructured":"E. Androulaki, J. Camenisch, A. D. Caro, M. Dubovitskaya, K. Elkhiyaoui, and B. Tackmann. \u201cPrivacy-preserving auditable token payments in a permissioned blockchain system\u201d. In: AFT \u201920: 2nd ACM Conference on Advances in Financial Technologies, New York, NY, USA, October 21-23, 2020. ACM, 2020, pp. 255\u2013267. https:\/\/doi.org\/10.1145\/3419614.3423259. https:\/\/doi.org\/10.1145\/3419614.3423259.","DOI":"10.1145\/3419614.3423259 10.1145\/3419614.3423259"},{"key":"4_CR3","doi-asserted-by":"publisher","unstructured":"P. S. L. M. Barreto, B. Lynn, and M. Scott. \u201cConstructing Elliptic Curves with Prescribed Embedding Degrees\u201d. In: SCN 02. Ed. by S. Cimato, C. Galdi, and G. Persiano. Vol. 2576. LNCS. Springer, Heidelberg, Sept. 2003, pp. 257\u2013267. https:\/\/doi.org\/10.1007\/3-540-36413-7_19.","DOI":"10.1007\/3-540-36413-7_19"},{"key":"4_CR4","doi-asserted-by":"publisher","unstructured":"P. S. L. M. Barreto and M. Naehrig. \u201cPairing-Friendly Elliptic Curves of Prime Order\u201d. In: SAC 2005. Ed. by B. Preneel and S. Tavares. Vol. 3897. LNCS. Springer, Heidelberg, Aug. 2006, pp. 319\u2013331. https:\/\/doi.org\/10.1007\/11693383_22.","DOI":"10.1007\/11693383_22"},{"key":"4_CR5","doi-asserted-by":"publisher","unstructured":"J. Bartusek, S. Garg, A. Jain, and G.-V. Policharla. \u201cEnd-to-End Secure Messaging with Traceability Only for Illegal Content\u201d. In: EUROCRYPT 2023, Part V. Ed. by C. Hazay and M. Stam. Vol. 14008. LNCS. Springer, Heidelberg, Apr. 2023, pp. 35\u201366. https:\/\/doi.org\/10.1007\/978-3-031-30589-4_2.","DOI":"10.1007\/978-3-031-30589-4_2"},{"key":"4_CR6","doi-asserted-by":"publisher","unstructured":"C. Baum, J. H. Chiang, B. David, and T. K. Frederiksen. \u201cSoK: PrivacyEnhancing Technologies in Finance\u201d. In: 5th Conference on Advances in Financial Technologies, AFT 2023, October 23-25, 2023, Princeton, NJ, USA. Ed. by J. Bonneau and S. M. Weinberg. Vol. 282. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 2023, 12:1-12:30. https:\/\/doi.org\/10.4230\/LIPICS.AFT.2023.12. https:\/\/doi.org\/10.4230\/LIPIcs.AFT.2023.12.","DOI":"10.4230\/LIPICS.AFT.2023.12 10.4230\/LIPIcs.AFT.2023.12"},{"key":"4_CR7","doi-asserted-by":"publisher","unstructured":"M. Belenkiy, J. Camenisch, M. Chase, M. Kohlweiss, A. Lysyanskaya, and H. Shacham. \u201cRandomizable Proofs and Delegatable Anonymous Credentials\u201d. In: CRYPTO 2009. Ed. by S. Halevi. Vol. 5677. LNCS. Springer, Heidelberg, Aug. 2009, pp. 108\u2013125. https:\/\/doi.org\/10.1007\/978-3-642-03356-8_7.","DOI":"10.1007\/978-3-642-03356-8_7"},{"key":"4_CR8","doi-asserted-by":"publisher","unstructured":"E. Ben-Sasson, A. Chiesa, E. Tromer, and M. Virza. \u201cScalable Zero Knowledge via Cycles of Elliptic Curves\u201d. In: CRYPTO 2014, Part II. Ed. by J. A. Garay and R. Gennaro. Vol. 8617. LNCS. Springer, Heidelberg, Aug. 2014, pp. 276\u2013294. https:\/\/doi.org\/10.1007\/978-3-662-44381-1_16.","DOI":"10.1007\/978-3-662-44381-1_16"},{"key":"4_CR9","doi-asserted-by":"publisher","unstructured":"N. Bitansky, R. Canetti, A. Chiesa, and E. Tromer. \u201cRecursive composition and bootstrapping for SNARKS and proof-carrying data\u201d. In: 45th ACM STOC. Ed. by D. Boneh, T. Roughgarden, and J. Feigenbaum. ACM Press, June 2013, pp. 111\u2013120. https:\/\/doi.org\/10.1145\/2488608.2488623.","DOI":"10.1145\/2488608.2488623"},{"key":"4_CR10","doi-asserted-by":"publisher","unstructured":"O. Blazy, G. Fuchsbauer, D. Pointcheval, and D. Vergnaud. \u201cSignatures on Randomizable Ciphertexts\u201d. In: PKC 2011. Ed. by D. Catalano, N. Fazio, R. Gennaro, and A. Nicolosi. Vol. 6571. LNCS. Springer, Heidelberg, Mar. 2011, pp. 403\u2013422. https:\/\/doi.org\/10.1007\/978-3-642-19379-8_25.","DOI":"10.1007\/978-3-642-19379-8_25"},{"key":"4_CR11","unstructured":"S. Bowe, J. Grigg, and D. Hopwood. Halo: Recursive Proof Composition without a Trusted Setup. Cryptology ePrint Archive, Report 2019\/1021. https:\/\/eprint.iacr.org\/2019\/1021. 2019."},{"key":"4_CR12","doi-asserted-by":"publisher","unstructured":"B. B\u00fcnz, J. Bootle, D. Boneh, A. Poelstra, P. Wuille, and G. Maxwell. \u201cBulletproofs: Short Proofs for Confidential Transactions and More\u201d. In: 2018 IEEE Symposium on Security and Privacy. IEEE Computer Society Press, May 2018, pp. 315\u2013334. https:\/\/doi.org\/10.1109\/SP.2018.00020.","DOI":"10.1109\/SP.2018.00020"},{"key":"4_CR13","unstructured":"B. B\u00fcnz, A. Chiesa, W. Lin, P. Mishra, and N. Spooner. Proof-Carrying Data without Succinct Arguments. Cryptology ePrint Archive, Report 2020\/1618. https:\/\/eprint.iacr.org\/2020\/1618. 2020."},{"key":"4_CR14","doi-asserted-by":"publisher","unstructured":"B. B\u00fcnz, A. Chiesa, W. Lin, P. Mishra, and N. Spooner. \u201cProof-Carrying Data Without Succinct Arguments\u201d. In: CRYPTO 2021, Part I. Ed. by T. Malkin and C. Peikert. Vol. 12825. LNCS. Virtual Event: Springer, Heidelberg, Aug. 2021, pp. 681\u2013710. https:\/\/doi.org\/10.1007\/978-3-030-84242-0_24.","DOI":"10.1007\/978-3-030-84242-0_24"},{"key":"4_CR15","doi-asserted-by":"publisher","unstructured":"B. B\u00fcnz, A. Chiesa, P. Mishra, and N. Spooner. \u201cRecursive Proof Composition from Accumulation Schemes\u201d. In: TCC 2020, Part II. Ed. by R. Pass and K. Pietrzak. Vol. 12551. LNCS. Springer, Heidelberg, Nov. 2020, pp. 1\u201318. https:\/\/doi.org\/10.1007\/978-3-030-64378-2_1.","DOI":"10.1007\/978-3-030-64378-2_1"},{"key":"4_CR16","doi-asserted-by":"publisher","unstructured":"I. Cascudo, I. Damg\u00e5rd, B. David, N. D\u00f6ttling, R. Dowsley, and I. Giacomelli. \u201cEfficient UC Commitment Extension with Homomorphism for Free (and Applications)\u201d. In: ASIACRYPT 2019, Part II. Ed. by S. D. Galbraith and S. Moriai. Vol. 11922. LNCS. Springer, Heidelberg, Dec. 2019, pp. 606\u2013635. https:\/\/doi.org\/10.1007\/978-3-030-34621-8_22.","DOI":"10.1007\/978-3-030-34621-8_22"},{"key":"4_CR17","doi-asserted-by":"publisher","unstructured":"D. Catalano, D. Fiore, and I. Tucker. \u201cAdditive-Homomorphic Functional Commitments and Applications to Homomorphic Signatures\u201d. In: ASIACRYPT 2022, Part IV. Ed. by S. Agrawal and D. Lin. Vol. 13794. LNCS. Springer, Heidelberg, Dec. 2022, pp. 159\u2013188. https:\/\/doi.org\/10.1007\/978-3-031-22972-5_6.","DOI":"10.1007\/978-3-031-22972-5_6"},{"key":"4_CR18","doi-asserted-by":"publisher","unstructured":"M. Chase, M. Kohlweiss, A. Lysyanskaya, and S. Meiklejohn. \u201cMalleable Proof Systems and Applications\u201d. In: EUROCRYPT 2012. Ed. by D. Pointcheval and T. Johansson. Vol. 7237. LNCS. Springer, Heidelberg, Apr. 2012, pp. 281\u2013300. https:\/\/doi.org\/10.1007\/978-3-642-29011-4_18.","DOI":"10.1007\/978-3-642-29011-4_18"},{"key":"4_CR19","doi-asserted-by":"publisher","unstructured":"M. Chase, M. Kohlweiss, A. Lysyanskaya, and S. Meiklejohn. \u201cMalleable Signatures: New Definitions and Delegatable Anonymous Credentials\u201d. In: CSF 2014 Computer Security Foundations Symposium. Ed. by A. Datta and C. Fournet. IEEE Computer Society Press, 2014, pp. 199\u2013213. https:\/\/doi.org\/10.1109\/CSF.2014.22.","DOI":"10.1109\/CSF.2014.22"},{"key":"4_CR20","doi-asserted-by":"publisher","unstructured":"M. Chase, M. Kohlweiss, A. Lysyanskaya, and S. Meiklejohn. \u201cSuccinct Malleable NIZKs and an Application to Compact Shuffles\u201d. In: TCC 2013. Ed. by A. Sahai. Vol. 7785. LNCS. Springer, Heidelberg, Mar. 2013, pp. 100\u2013119. https:\/\/doi.org\/10.1007\/978-3-642-36594-2_6.","DOI":"10.1007\/978-3-642-36594-2_6"},{"key":"4_CR21","doi-asserted-by":"publisher","unstructured":"D. Chaum, C. Cr\u00e9peau, and I. Damg\u00e5rd. \u201cMultiparty Unconditionally Secure Protocols (Abstract) (Informal Contribution)\u201d. In: CRYPTO\u201987. Ed. by C. Pomerance. Vol. 293. LNCS. Springer, Heidelberg, Aug. 1988, p. 462. https:\/\/doi.org\/10.1007\/3-540-48184-2_43.","DOI":"10.1007\/3-540-48184-2_43"},{"key":"4_CR22","doi-asserted-by":"publisher","unstructured":"A. Connolly, P. Lafourcade, and O. Perez-Kempner. \u201cImproved Constructions of Anonymous Credentials from Structure-Preserving Signatures on Equivalence Classes\u201d. In: PKC 2022, Part I. Ed. by G. Hanaoka, J. Shikata, and Y. Watanabe. Vol. 13177. LNCS. Springer, Heidelberg, Mar. 2022, pp. 409\u2013438. https:\/\/doi.org\/10.1007\/978-3-030-97121-2_15.","DOI":"10.1007\/978-3-030-97121-2_15"},{"key":"4_CR23","doi-asserted-by":"publisher","unstructured":"G. Couteau and D. Hartmann. \u201cShorter Non-interactive Zero-Knowledge Arguments and ZAPs for Algebraic Languages\u201d. In: CRYPTO 2020, Part III. Ed. by D. Micciancio and T. Ristenpart. Vol. 12172. LNCS. Springer, Heidelberg, Aug. 2020, pp. 768\u2013798. https:\/\/doi.org\/10.1007\/978-3-030-56877-1_27.","DOI":"10.1007\/978-3-030-56877-1_27"},{"key":"4_CR24","doi-asserted-by":"publisher","unstructured":"G. Couteau, M. Kloo\u00df, H. Lin, and M. Reichle. \u201cEfficient Range Proofs with Transparent Setup from Bounded Integer Commitments\u201d. In: EUROCRYPT 2021, Part III. Ed. by A. Canteaut and F.-X. Standaert. Vol. 12698. LNCS. Springer, Heidelberg, Oct. 2021, pp. 247\u2013277. https:\/\/doi.org\/10.1007\/978-3-030-77883-5_9.","DOI":"10.1007\/978-3-030-77883-5_9"},{"key":"4_CR25","doi-asserted-by":"publisher","unstructured":"I. Damg\u00e5rd, B. M. David, I. Giacomelli, and J. B. Nielsen. \u201cCompact VSS and Efficient Homomorphic UC Commitments\u201d. In: ASIACRYPT 2014, Part II. Ed. by P. Sarkar and T. Iwata. Vol. 8874. LNCS. Springer, Heidelberg, Dec. 2014, pp. 213\u2013232. https:\/\/doi.org\/10.1007\/978-3-662-45608-8_12.","DOI":"10.1007\/978-3-662-45608-8_12"},{"key":"4_CR26","doi-asserted-by":"publisher","unstructured":"I. Damg\u00e5rd, C. Ganesh, H. Khoshakhlagh, C. Orlandi, and L. Siniscalchi. \u201cBalancing Privacy and Accountability in Blockchain Identity Management\u201d. In: CT-RSA 2021. Ed. by K. G. Paterson. Vol. 12704. LNCS. Springer, Heidelberg, May 2021, pp. 552\u2013576. https:\/\/doi.org\/10.1007\/978-3-030-75539-3_23","DOI":"10.1007\/978-3-030-75539-3_23"},{"key":"4_CR27","doi-asserted-by":"crossref","unstructured":"I. Damgard, M. Geisler, and M. Kroigard. \u201cHomomorphic encryption and secure comparison\u201d. In: International Journal of Applied Cryptography 1.1 (2008), pp. 22\u201331.","DOI":"10.1504\/IJACT.2008.017048"},{"key":"4_CR28","doi-asserted-by":"publisher","unstructured":"I. Damg\u00e5rd, V. Pastro, N. P. Smart, and S. Zakarias. \u201cMultiparty Computation from Somewhat Homomorphic Encryption\u201d. In: CRYPTO 2012. Ed. by R. Safavi-Naini and R. Canetti. Vol. 7417. LNCS. Springer, Heidelberg, Aug. 2012, pp. 643\u2013662. https:\/\/doi.org\/10.1007\/978-3-642-32009-5_38.","DOI":"10.1007\/978-3-642-32009-5_38"},{"key":"4_CR29","unstructured":"B. David, F. Engelmann, T. Frederiksen, M. Kohlweiss, E. Pagnin, and M. Volkhov. Updatable Privacy-Preserving Blueprints. Cryptology ePrint Archive, Paper 2023\/1787. 2023. url: https:\/\/print.iacr.org\/2023\/1787."},{"key":"4_CR30","doi-asserted-by":"publisher","unstructured":"Y. Dodis, K. Haralambiev, A. L\u00f3pez-Alt, and D. Wichs. \u201cCryptography against Continuous Memory Attacks\u201d. In: 51st FOCS. IEEE Computer Society Press, Oct. 2010, pp. 511\u2013520. https:\/\/doi.org\/10.1109\/FOCS.2010.56.","DOI":"10.1109\/FOCS.2010.56"},{"key":"4_CR31","unstructured":"M. B. van Egmond et al. Privacy-preserving Anti-Money Laundering using Secure Multi-Party Computation. Cryptology ePrint Archive, Paper 2024\/065 (To appear in Financial Cryptography 2024). https:\/\/eprint.iacr.org\/2024\/065. 2024. url: https:\/\/eprint.iacr.org\/2024\/065"},{"key":"4_CR32","doi-asserted-by":"publisher","unstructured":"M. F. Esgin, R. K. Zhao, R. Steinfeld, J. K. Liu, and D. Liu. \u201cMatRiCT: Efficient, Scalable and Post-Quantum Blockchain Confidential Transactions Protocol\u201d. In: ACM CCS 2019. Ed. by L. Cavallaro, J. Kinder, X. Wang, and J. Katz. ACM Press, Nov. 2019, pp. 567\u2013584. https:\/\/doi.org\/10.1145\/3319535.3354200.","DOI":"10.1145\/3319535.3354200"},{"key":"4_CR33","doi-asserted-by":"publisher","unstructured":"S. Faust, M. Kohlweiss, G. A. Marson, and D. Venturi. \u201cOn the Nonmalleability of the Fiat-Shamir Transform\u201d. In: INDOCRYPT 2012. Ed. by S. D. Galbraith and M. Nandi. Vol. 7668. LNCS. Springer, Heidelberg, Dec. 2012, pp. 60\u201379. https:\/\/doi.org\/10.1007\/978-3-642-34931-7_5.","DOI":"10.1007\/978-3-642-34931-7_5"},{"key":"4_CR34","doi-asserted-by":"publisher","unstructured":"M. Fischlin. \u201cCommunication-Efficient Non-interactive Proofs of Knowledge with Online Extractors\u201d. In: CRYPTO 2005. Ed. by V. Shoup. Vol. 3621. LNCS. Springer, Heidelberg, Aug. 2005, pp. 152\u2013168. https:\/\/doi.org\/10.1007\/11535218_10.","DOI":"10.1007\/11535218_10"},{"key":"4_CR35","unstructured":"J. Frankle, S. Park, D. Shaar, S. Goldwasser, and D. J.Weitzner. \u201cPractical Accountability of Secret Processes\u201d. In: USENIX Security 2018. Ed. by W. Enck and A. P. Felt. USENIX Association, Aug. 2018, pp. 657\u2013674."},{"key":"4_CR36","doi-asserted-by":"publisher","unstructured":"G. Fuchsbauer. \u201cCommuting Signatures and Verifiable Encryption\u201d. In: EUROCRYPT 2011. Ed. by K. G. Paterson. Vol. 6632. LNCS. Springer, Heidelberg, May 2011, pp. 224\u2013245. https:\/\/doi.org\/10.1007\/978-3-642-20465-4_14.","DOI":"10.1007\/978-3-642-20465-4_14"},{"key":"4_CR37","unstructured":"N. Gama et al. \u201cDetecting money laundering activities via secure multiparty computation for structural similarities in flow networks\u201d. In: Real World Cryptography. 2020. url: https:\/\/www.youtube.com\/watch?v=4hryY6cMPaM&t=2558s."},{"key":"4_CR38","doi-asserted-by":"crossref","unstructured":"C. Ganesh, H. Khoshakhlagh, M. Kohlweiss, A. Nitulescu, and M. Zaj\u0105c. \u201cWhat Makes Fiat\u2013Shamir zkSNARKs (Updatable SRS) Simulation Extractable?\u201d In: International Conference on Security and Cryptography for Networks. Springer. 2022, pp. 735\u2013760.","DOI":"10.1007\/978-3-031-14791-3_32"},{"key":"4_CR39","doi-asserted-by":"publisher","unstructured":"J. A. Garay, B. Schoenmakers, and J. Villegas. \u201cPractical and Secure Solutions for Integer Comparison\u201d. In: PKC 2007. Ed. by T. Okamoto and X. Wang. Vol. 4450. LNCS. Springer, Heidelberg, Apr. 2007, pp. 330\u2013342. https:\/\/doi.org\/10.1007\/978-3-540-71677-8_22.","DOI":"10.1007\/978-3-540-71677-8_22"},{"key":"4_CR40","doi-asserted-by":"publisher","unstructured":"O. Goldreich, S. Micali, and A. Wigderson. \u201cHow to Play any Mental Game or A Completeness Theorem for Protocols with Honest Majority\u201d. In: 19th ACM STOC. Ed. by A. Aho. ACM Press, May 1987, pp. 218\u2013229. https:\/\/doi.org\/10.1145\/28395.28420.","DOI":"10.1145\/28395.28420"},{"key":"4_CR41","unstructured":"S. Goldwasser and S. Park. Public Accountability vs. Secret Laws: Can They Coexist? Cryptology ePrint Archive, Report 2018\/664. https:\/\/eprint.iacr.org\/2018\/664. 2018."},{"key":"4_CR42","doi-asserted-by":"publisher","unstructured":"M. Green, G. Kaptchuk, and G. V. Laer. \u201cAbuse Resistant Law Enforcement Access Systems\u201d. In: EUROCRYPT 2021, Part III. Ed. by A. Canteaut and F.-X. Standaert. Vol. 12698. LNCS. Springer, Heidelberg, Oct. 2021, pp. 553\u2013583. https:\/\/doi.org\/10.1007\/978-3-030-77883-5_19.","DOI":"10.1007\/978-3-030-77883-5_19"},{"key":"4_CR43","unstructured":"S. Griffy, M. Kohlweiss, A. Lysyanskaya, and M. Sengupta. Privacy-Preserving Blueprints via Succinctly Verifiable Computation over Additively-Homomorphically Encrypted Data. Cryptology ePrint Archive, Paper 2024\/675. 2024. url: https:\/\/eprint.iacr.org\/2024\/675."},{"key":"4_CR44","doi-asserted-by":"publisher","unstructured":"J. Groth and A. Sahai. \u201cEfficient Non-interactive Proof Systems for Bilinear Groups\u201d. In: EUROCRYPT 2008. Ed. by N. P. Smart. Vol. 4965. LNCS. Springer, Heidelberg, Apr. 2008, pp. 415\u2013432. https:\/\/doi.org\/10.1007\/978-3-540-78967-3_24.","DOI":"10.1007\/978-3-540-78967-3_24"},{"key":"4_CR45","doi-asserted-by":"publisher","unstructured":"C. H\u00e9bant, D. H. Phan, and D. Pointcheval. \u201cLinearly-Homomorphic Signatures and Scalable Mix-Nets\u201d. In: PKC 2020, Part II. Ed. by A. Kiayias, M. Kohlweiss, P. Wallden, and V. Zikas. Vol. 12111. LNCS. Springer, Heidelberg, May 2020, pp. 597\u2013627. https:\/\/doi.org\/10.1007\/978-3-030-45388-6_21.","DOI":"10.1007\/978-3-030-45388-6_21"},{"key":"4_CR46","doi-asserted-by":"publisher","unstructured":"M. Khalili, D. Slamanig, and M. Dakhilalian. \u201cStructure-Preserving Signatures on Equivalence Classes from Standard Assumptions\u201d. In: ASIACRYPT 2019, Part III. Ed. by S. D. Galbraith and S. Moriai. Vol. 11923. LNCS. Springer, Heidelberg, Dec. 2019, pp. 63\u201393. https:\/\/doi.org\/10.1007\/978-3-030-34618-8_3.","DOI":"10.1007\/978-3-030-34618-8_3"},{"key":"4_CR47","doi-asserted-by":"publisher","unstructured":"A. Kiayias, M. Kohlweiss, and A. Sarencheh. \u201cPEReDi: Privacy-Enhanced, Regulated and Distributed Central Bank Digital Currencies\u201d. In: Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, CCS 2022, Los Angeles, CA, USA, November 7-11, 2022. Ed. by H. Yin, A. Stavrou, C. Cremers, and E. Shi. ACM, 2022, pp. 1739\u20131752. https:\/\/doi.org\/10.1145\/3548606.3560707. url: https:\/\/doi.org\/10.1145\/3548606.3560707.","DOI":"10.1145\/3548606.3560707 10.1145\/3548606.3560707"},{"key":"4_CR48","doi-asserted-by":"publisher","unstructured":"M. Kohlweiss, A. Lysyanskaya, and A. Nguyen. \u201cPrivacy-Preserving Blueprints\u201d. In: EUROCRYPT 2023, Part II. Ed. by C. Hazay and M. Stam. Vol. 14005. LNCS. Springer, Heidelberg, Apr. 2023, pp. 594\u2013625. https:\/\/doi.org\/10.1007\/978-3-031-30617-4_20.","DOI":"10.1007\/978-3-031-30617-4_20"},{"key":"4_CR49","unstructured":"M. Kohlweiss and M. Zaj\u0105c. On Simulation-Extractability of Universal zk-SNARKs. Cryptology ePrint Archive, Report 2021\/511. https:\/\/eprint.iacr.org\/2021\/511. 2021."},{"key":"4_CR50","doi-asserted-by":"crossref","unstructured":"J. Konvalina. \u201cA unified interpretation of the binomial coefficients, the Stirling numbers, and the Gaussian coefficients\u201d. In: The American Mathematical Monthly 107.10 (2000), pp. 901\u2013910.","DOI":"10.1080\/00029890.2000.12005290"},{"key":"4_CR51","unstructured":"A. Kothapalli, S. Setty, and I. Tzialla. Nova: Recursive Zero-Knowledge Arguments from Folding Schemes. Cryptology ePrint Archive, Report 2021\/370. https:\/\/eprint.iacr.org\/2021\/370. 2021."},{"key":"4_CR52","doi-asserted-by":"crossref","unstructured":"U. M. Maurer. \u201cUnifying Zero-Knowledge Proofs of Knowledge\u201d. In: AFRICACRYPT 09. Ed. by B. Preneel. Vol. 5580. LNCS. Springer, Heidelberg, June 2009, pp. 272\u2013286.","DOI":"10.1007\/978-3-642-02384-2_17"},{"key":"4_CR53","doi-asserted-by":"publisher","unstructured":"V. S. Miller. \u201cThe Weil Pairing, and Its Efficient Calculation\u201d. In: Journal of Cryptology 17.4 (Sept. 2004), pp. 235\u2013261. https:\/\/doi.org\/10.1007\/s00145-004-0315-8.","DOI":"10.1007\/s00145-004-0315-8"},{"key":"4_CR54","unstructured":"N. Narula, W. Vasquez, and M. Virza. \u201czkLedger: Privacy-Preserving Auditing for Distributed Ledgers\u201d. In: 15th USENIX Symposium on Networked Systems Design and Implementation, NSDI 2018, Renton, WA, USA, April 9-11, 2018. Ed. by S. Banerjee and S. Seshan. USENIX Association, 2018, pp. 65\u201380. url: https:\/\/www.usenix.org\/conference\/nsdi18\/presentation\/narula."},{"key":"4_CR55","doi-asserted-by":"publisher","unstructured":"R. Ostrovsky, A. Paskin-Cherniavsky, and B. Paskin-Cherniavsky. \u201cMaliciously Circuit-Private FHE\u201d. In: CRYPTO 2014, Part I. Ed. by J. A. Garay and R. Gennaro. Vol. 8616. LNCS. Springer, Heidelberg, Aug. 2014, pp. 536\u2013553. https:\/\/doi.org\/10.1007\/978-3-662-44371-2_30.","DOI":"10.1007\/978-3-662-44371-2_30"},{"key":"4_CR56","doi-asserted-by":"publisher","unstructured":"T. P. Pedersen. \u201cNon-Interactive and Information-Theoretic Secure Verifiable Secret Sharing\u201d. In: CRYPTO\u201991. Ed. by J. Feigenbaum. Vol. 576. LNCS. Springer, Heidelberg, Aug. 1992, pp. 129\u2013140. https:\/\/doi.org\/10.1007\/3-540-46766-1_9.","DOI":"10.1007\/3-540-46766-1_9"},{"key":"4_CR57","doi-asserted-by":"publisher","unstructured":"P. de Perthuis and D. Pointcheval. \u201cTwo-Client Inner-Product Functional Encryption with an Application to Money-Laundering Detection\u201d. In: ACM CCS 2022. Ed. by H. Yin, A. Stavrou, C. Cremers, and E. Shi. ACM Press, Nov. 2022, pp. 725\u2013737. https:\/\/doi.org\/10.1145\/3548606.3559374.","DOI":"10.1145\/3548606.3559374"},{"key":"4_CR58","doi-asserted-by":"publisher","unstructured":"C. Rackoff and D. R. Simon. \u201cNon-Interactive Zero-Knowledge Proof of Knowledge and Chosen Ciphertext Attack\u201d. In: CRYPTO\u201991. Ed. by J. Feigenbaum. Vol. 576. LNCS. Springer, Heidelberg, Aug. 1992, pp. 433\u2013444. https:\/\/doi.org\/10.1007\/3-540-46766-1_35.","DOI":"10.1007\/3-540-46766-1_35"},{"key":"4_CR59","doi-asserted-by":"publisher","unstructured":"A. Scafuro. \u201cBreak-glass Encryption\u201d. In: PKC 2019, Part II. Ed. by D. Lin and K. Sako. Vol. 11443. LNCS. Springer, Heidelberg, Apr. 2019, pp. 34\u201362. https:\/\/doi.org\/10.1007\/978-3-030-17259-6_2.","DOI":"10.1007\/978-3-030-17259-6_2"},{"key":"4_CR60","doi-asserted-by":"publisher","unstructured":"C.-P. Schnorr. \u201cEfficient Identification and Signatures for Smart Cards\u201d. In: CRYPTO\u201989. Ed. by G. Brassard. Vol. 435. LNCS. Springer, Heidelberg, Aug. 1990, pp. 239\u2013252. https:\/\/doi.org\/10.1007\/0-387-34805-0_22.","DOI":"10.1007\/0-387-34805-0_22"}],"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-0875-1_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,9]],"date-time":"2024-12-09T08:02:59Z","timestamp":1733731379000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-96-0875-1_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,10]]},"ISBN":["9789819608744","9789819608751"],"references-count":60,"URL":"https:\/\/doi.org\/10.1007\/978-981-96-0875-1_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024,12,10]]},"assertion":[{"value":"10 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"}}]}}