{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T00:35:00Z","timestamp":1767314100612,"version":"3.48.0"},"publisher-location":"Cham","reference-count":126,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032070234","type":"print"},{"value":"9783032070241","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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":[[2026]]},"DOI":"10.1007\/978-3-032-07024-1_12","type":"book-chapter","created":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T00:30:37Z","timestamp":1767313837000},"page":"197-218","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["SoK: Trusted Setups for\u00a0Powers-of-Tau Strings"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0003-9187-3404","authenticated-orcid":false,"given":"Faxing","family":"Wang","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0890-6590","authenticated-orcid":false,"given":"Shaanan","family":"Cohney","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6349-0145","authenticated-orcid":false,"given":"Joseph","family":"Bonneau","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,1,2]]},"reference":[{"key":"12_CR1","unstructured":"Pedersen, T.P.: Non-interactive and information-theoretic secure verifiable secret sharing. In: CRYPTO (1991)"},{"key":"12_CR2","doi-asserted-by":"crossref","unstructured":"Barker, E., Kelsey, J.: Recommendation for Random Number Generation Using Deterministic Random Bit Generators. NIST Special Publication (2006)","DOI":"10.6028\/NIST.SP.800-90"},{"key":"12_CR3","unstructured":"Wilcox, Z.: The Design of the Ceremony (2016). http:\/\/electriccoin.co\/blog\/the-design-of-the-ceremony\/"},{"key":"12_CR4","doi-asserted-by":"crossref","unstructured":"Faz-Hernandez, A., Scott, S., Sullivan, N., Wahby, R.S., Wood, C.A.: Hashing to Elliptic Curves. RFC 9380 (2023)","DOI":"10.17487\/RFC9380"},{"key":"12_CR5","doi-asserted-by":"crossref","unstructured":"Choi, K., Manoj, A., Bonneau, J.: SoK: distributed randomness beacons. In: IEEE Security & Privacy (2023)","DOI":"10.1109\/SP46215.2023.10179419"},{"key":"12_CR6","unstructured":"Ben-Sasson, E.: The Cambrian Explosion of Crypto Proofs (2020)"},{"key":"12_CR7","doi-asserted-by":"crossref","unstructured":"Nazirkhanova, K., Neu, J., Tse, D.: Information dispersal with provable retrievability for rollups. In: ACM AFT (2022)","DOI":"10.1145\/3558535.3559778"},{"key":"12_CR8","doi-asserted-by":"crossref","unstructured":"Xie, T., et al.: zkbridge: trustless cross-chain bridges made practical. In: ACM CCS (2022)","DOI":"10.1145\/3548606.3560652"},{"key":"12_CR9","doi-asserted-by":"crossref","unstructured":"Miers, I., Garman, C., Green, M., Rubin, A.D.: Zerocoin: anonymous distributed e-cash from bitcoin. In: IEEE Security & Privacy (2013)","DOI":"10.1109\/SP.2013.34"},{"key":"12_CR10","doi-asserted-by":"crossref","unstructured":"Bartusek, J., Khurana, D.: Cryptography with certified deletion. In: CRYPTO (2023)","DOI":"10.1007\/978-3-031-38554-4_7"},{"key":"12_CR11","doi-asserted-by":"crossref","unstructured":"Broadbent, A., Islam, R.: Quantum encryption with certified deletion. In: TCC (2020)","DOI":"10.1007\/978-3-030-64381-2_4"},{"key":"12_CR12","doi-asserted-by":"crossref","unstructured":"Garg, S., Goldwasser, S., Vasudevan, P.N.: Formalizing data deletion in the context of the right to be forgotten. In: Eurocrypt (2020)","DOI":"10.1007\/978-3-030-45724-2_13"},{"key":"12_CR13","doi-asserted-by":"crossref","unstructured":"Hiroka, T., Morimae, T., Nishimaki, R., Yamakawa, T.: Quantum encryption with certified deletion, revisited: public key, attribute-based, and classical communication. In: Asiacrypt (2021)","DOI":"10.1007\/978-3-030-92062-3_21"},{"key":"12_CR14","unstructured":"Poremba, A.: Quantum proofs of deletion for learning with errors (2023)"},{"key":"12_CR15","doi-asserted-by":"crossref","unstructured":"Bartusek, J., Khurana, D., Poremba, A.: Publicly-verifiable deletion via target-collapsing functions (2023)","DOI":"10.1007\/978-3-031-38554-4_4"},{"key":"12_CR16","unstructured":"Costan, V., Devadas, S.: Intel SGX explained. Cryptology ePrint Archive, Paper 2016\/086 (2016)"},{"key":"12_CR17","unstructured":"Costan, V., Lebedev, I., Devadas, S.: Sanctum: minimal hardware extensions for strong software isolation. In: USENIX Security (2016)"},{"key":"12_CR18","doi-asserted-by":"crossref","unstructured":"Lee, D., Kohlbrenner, D., Shinde, S., Asanovi\u0107, K., Song, D.: Keystone: an open framework for architecting trusted execution environments. In: EuroSys (2020)","DOI":"10.1145\/3342195.3387532"},{"key":"12_CR19","doi-asserted-by":"crossref","unstructured":"Pinto, S., Santos, N.: Demystifying arm trustzone: a comprehensive survey. ACM Comput. Surv. (2019)","DOI":"10.1145\/3291047"},{"key":"12_CR20","unstructured":"Van\u00a0Bulck, J., et al.: Foreshadow: extracting the keys to the intel SGX kingdom with transient Out-of-Order execution. In: USENIX Security (2018)"},{"key":"12_CR21","doi-asserted-by":"crossref","unstructured":"van Schaik, S., et al.: SoK: SGX.Fail: how stuff gets eXposed. In: IEEE Security & Privacy (2024)","DOI":"10.1109\/SP54263.2024.00260"},{"key":"12_CR22","unstructured":"Zhang, Z., Tao, M., O\u2019Connell, S., Chuengsatiansup, C., Genkin, D., Yarom, Y.: BunnyHop: exploiting the instruction prefetcher. In: USENIX Security (2023)"},{"key":"12_CR23","doi-asserted-by":"crossref","unstructured":"Goldwasser, S., Micali, S., Rackoff, C.: The knowledge complexity of interactive proof-systems. SIAM J. Comput. (1989)","DOI":"10.1090\/psapm\/038\/1020812"},{"key":"12_CR24","doi-asserted-by":"crossref","unstructured":"B\u00fcnz, B., Fisch, B., Szepieniec, A.: Transparent SNARKs from DARK compilers. In: EUROCRYPT (2020)","DOI":"10.1007\/978-3-030-45721-1_24"},{"key":"12_CR25","doi-asserted-by":"crossref","unstructured":"Lee, J.: Dory: efficient, transparent arguments for generalised inner products and polynomial commitments. In: TCC (2021)","DOI":"10.1007\/978-3-030-90453-1_1"},{"key":"12_CR26","doi-asserted-by":"crossref","unstructured":"Groth, J.: On the size of pairing-based non-interactive arguments. In: Eurocrypt (2016)","DOI":"10.1007\/978-3-662-49896-5_11"},{"key":"12_CR27","doi-asserted-by":"crossref","unstructured":"Maller, M., Bowe, S., Kohlweiss, M., Meiklejohn, S.: Sonic: zero-knowledge snarks from linear-size universal and updatable structured reference strings. In: ACM CCS (2019)","DOI":"10.1145\/3319535.3339817"},{"key":"12_CR28","doi-asserted-by":"crossref","unstructured":"Chiesa, A., Yuncong, H., Maller, M., Mishra, P., Vesely, N., Ward, N.: Marlin: preprocessing zkSNARKs with universal and updatable SRS. In: Eurocrypt (2020)","DOI":"10.1007\/978-3-030-45721-1_26"},{"key":"12_CR29","doi-asserted-by":"crossref","unstructured":"Groth, J., Kohlweiss, M., Maller, M., Meiklejohn, S., Miers, I.: Updatable and universal common reference strings with applications to zk-SNARKs. In: CRYPTO (2018)","DOI":"10.1007\/978-3-319-96878-0_24"},{"key":"12_CR30","doi-asserted-by":"crossref","unstructured":"Chen, M., et al.: Diogenes: lightweight scalable RSA modulus generation with a dishonest majority. In: IEEE Security & Privacy (2021)","DOI":"10.1109\/SP40001.2021.00025"},{"key":"12_CR31","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)"},{"key":"12_CR32","doi-asserted-by":"crossref","unstructured":"Bootle, J., Cerulli, A., Chaidos, P., Groth, J., Petit, C.: Efficient zero-knowledge arguments for arithmetic circuits in the discrete log setting. In: Eurocrypt (2016)","DOI":"10.1007\/978-3-662-49896-5_12"},{"key":"12_CR33","doi-asserted-by":"crossref","unstructured":"Campanelli, M., Faonio, A., Fiore, D., Querol, A., Rodr\u00edguez, H.: Lunar: a toolbox for more efficient universal and updatable zkSNARKs and commit-and-prove extensions. In: Asiacrypt (2021)","DOI":"10.1007\/978-3-030-92078-4_1"},{"key":"12_CR34","doi-asserted-by":"crossref","unstructured":"R\u00e0fols, C., Zapico, A.: An algebraic framework for universal and updatable SNARKs. In: CRYPTO (2021)","DOI":"10.1007\/978-3-030-84242-0_27"},{"key":"12_CR35","doi-asserted-by":"crossref","unstructured":"Lipmaa, H., Siim, J., Zaj\u0105c, M.: Counting vampires: from univariate sumcheck to updatable zk-snark. In: Asiacrypt (2022)","DOI":"10.1007\/978-3-031-22966-4_9"},{"key":"12_CR36","doi-asserted-by":"crossref","unstructured":"Bootle, J., Chiesa, A., Yuncong, H., Orru, M.: Gemini: elastic SNARKs for diverse environments. In: Eurocrypt (2022)","DOI":"10.1007\/978-3-031-07085-3_15"},{"key":"12_CR37","doi-asserted-by":"crossref","unstructured":"Campanelli, M., Gailly, N., Gennaro, R., Jovanovic, P., Mihali, M., Thaler, J.: Testudo: linear time prover SNARKs with constant size proofs and square root size universal setup. In: Latincrypt (2023)","DOI":"10.1007\/978-3-031-44469-2_17"},{"key":"12_CR38","doi-asserted-by":"crossref","unstructured":"Gennaro, R., Gentry, C., Parno, B., Raykova, M.: Quadratic span programs and succinct NIZKs without PCPs. In: Eurocrypt (2013)","DOI":"10.1007\/978-3-642-38348-9_37"},{"key":"12_CR39","unstructured":"Dellepere, M., Mishra, P., Shirzad, A.: Garuda and pari: smaller and faster snarks via equifficient polynomial commitments. ePrint Archive (2024)"},{"key":"12_CR40","doi-asserted-by":"crossref","unstructured":"Groth, J., Maller, M.: Snarky signatures: minimal signatures of knowledge from simulation-extractable snarks. In: CRYPTO (2017)","DOI":"10.1007\/978-3-319-63715-0_20"},{"key":"12_CR41","doi-asserted-by":"crossref","unstructured":"Lipmaa, H.: Polymath: groth16 is not the limit. In: CRYPTO (2024)","DOI":"10.1007\/978-3-031-68403-6_6"},{"key":"12_CR42","doi-asserted-by":"crossref","unstructured":"Ben-Sasson, E., Chiesa, A., Tromer, E., Virza, M.: Scalable zero knowledge via cycles of elliptic curves. In: CRYPTO (2014)","DOI":"10.1007\/978-3-662-44381-1_16"},{"key":"12_CR43","doi-asserted-by":"crossref","unstructured":"Parno, B., Howell, J., Gentry, C., Raykova, M.: Pinocchio: nearly practical verifiable computation. In: IEEE Security & Privacy (2013)","DOI":"10.1109\/SP.2013.47"},{"key":"12_CR44","doi-asserted-by":"crossref","unstructured":"Kate, A., Zaverucha, G.M., Goldberg, I.: Constant-size commitments to polynomials and their applications. In: Asiacrypt (2010)","DOI":"10.1007\/978-3-642-17373-8_11"},{"key":"12_CR45","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: IEEE Security & Privacy (2018)","DOI":"10.1109\/SP.2018.00020"},{"key":"12_CR46","unstructured":"Ben-Sasson, E., Bentov, I., Horesh, Y., Riabzev, M.: Fast Reed-Solomon interactive oracle proofs of proximity. In: ICALP (2018)"},{"key":"12_CR47","doi-asserted-by":"crossref","unstructured":"Arun, A., Ganesh, C., Lokam, S., Mopuri, T., Sridhar, S.: Dew: a transparent constant-sized polynomial commitment scheme. In: PKC (2023)","DOI":"10.1007\/978-3-031-31371-4_19"},{"key":"12_CR48","unstructured":"Seres, I.A., Burcsi, P.: Behemoth: transparent polynomial commitment scheme with constant opening proof size and verifier time. ePrint (2023)"},{"key":"12_CR49","doi-asserted-by":"crossref","unstructured":"Papamanthou, C., Shi, E., Tamassia, R.: Signatures of correct computation. In: TCC (2013)","DOI":"10.1007\/978-3-642-36594-2_13"},{"key":"12_CR50","doi-asserted-by":"crossref","unstructured":"Xie, T., Zhang, Y., Song, D.: Orion: zero knowledge proof with linear prover time. In: CRYPTO (2022)","DOI":"10.1007\/978-3-031-15985-5_11"},{"key":"12_CR51","doi-asserted-by":"crossref","unstructured":"Kohrita, T., Towa, P.: Zeromorph: zero-knowledge multilinear-evaluation proofs from homomorphic univariate commitments. J. Cryptol. (2024)","DOI":"10.1007\/s00145-024-09519-0"},{"key":"12_CR52","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: EurocryptO (2023)","DOI":"10.1007\/978-3-031-30617-4_17"},{"key":"12_CR53","doi-asserted-by":"crossref","unstructured":"Zeilberger, H., Chen, B., Fisch, B.: Basefold: efficient field-agnostic polynomial commitment schemes from foldable codes. In: CRYPTO (2024)","DOI":"10.1007\/978-3-031-68403-6_5"},{"key":"12_CR54","doi-asserted-by":"crossref","unstructured":"Ben-Sasson, E., Chiesa, A., Green, M., Tromer, E., Virza, M.: Secure sampling of public parameters for succinct zero knowledge proofs. In: IEEE Security & Privacy (2015)","DOI":"10.1109\/SP.2015.25"},{"key":"12_CR55","doi-asserted-by":"crossref","unstructured":"Bowe, S., Gabizon, A., Green, M.D.: A multi-party protocol for constructing the public parameters of the Pinocchio zk-SNARK. In: FC (2019)","DOI":"10.1007\/978-3-662-58820-8_5"},{"key":"12_CR56","doi-asserted-by":"crossref","unstructured":"Abdolmaleki, B., Baghery, K., Lipmaa, H., Siim, J., Zajac, M.: UC-secure CRS generation for SNARKs. In: Africacrypt (2019)","DOI":"10.1007\/978-3-030-23696-0_6"},{"key":"12_CR57","doi-asserted-by":"crossref","unstructured":"Aggelakis, A.,et al.: A non-interactive shuffle argument with low trust assumptions. In: CT-RSA (2020)","DOI":"10.1007\/978-3-030-40186-3_28"},{"key":"12_CR58","doi-asserted-by":"crossref","unstructured":"Rabin, M.O.: Transaction protection by beacons. J. Comput. Syst. Sci. (1983)","DOI":"10.1016\/0022-0000(83)90042-9"},{"key":"12_CR59","unstructured":"Semaphore trusted setup. https:\/\/github.com\/privacy-scaling-explorations\/semaphore-phase2-setup"},{"key":"12_CR60","unstructured":"Tornado.cash trusted setup ceremony app. https:\/\/github.com\/tornadocash\/trusted-setup-server"},{"key":"12_CR61","unstructured":"Aztec trusted ceremony. https:\/\/medium.com\/aztec-protocol\/aztec-crs-the-biggest-mpc-setup-in-history-has-successfully-finished-74c6909cd0c4"},{"key":"12_CR62","doi-asserted-by":"crossref","unstructured":"Raikwar, M., Gligoroski, D.: SoK: decentralized randomness beacon protocols. In: Australasian Conference on Information Security and Privacy (2022)","DOI":"10.1007\/978-3-031-22301-3_21"},{"key":"12_CR63","doi-asserted-by":"crossref","unstructured":"Kavousi, A., Wang, Z., Jovanovic, P.: SoK: public randomness. In: Euro S &P (2024)","DOI":"10.1109\/EuroSP60621.2024.00020"},{"key":"12_CR64","doi-asserted-by":"crossref","unstructured":"Kohlweiss, M., Maller, M., Siim, J., Volkhov, M.: Snarky ceremonies. In: Asiacrypt (2021)","DOI":"10.1007\/978-3-030-92078-4_4"},{"key":"12_CR65","unstructured":"Ben-Sasson, E., Chiesa, A., Tromer, E., Virza, M.: Succinct non-interactive zero knowledge for a von neumann architecture. In: USENIX Security (2014)"},{"key":"12_CR66","unstructured":"Bowe, S., Gabizon, A., Miers, I.: Scalable multi-party computation for zk-SNARK parameters in the random beacon model. Cryptology ePrint Archive, Paper 2017\/1050 (2017)"},{"key":"12_CR67","doi-asserted-by":"crossref","unstructured":"Kerber, T., Kiayias, A., Kohlweiss, M.: Mining for privacy: how to bootstrap a snarky blockchain. In: Financial Crypto (2021)","DOI":"10.1007\/978-3-662-64322-8_24"},{"key":"12_CR68","doi-asserted-by":"crossref","unstructured":"Cohen, R., Doerner, J., Kondi, Y., Shelat, A.: Guaranteed output in $$o(\\sqrt{n})$$ rounds for round-robin sampling protocols. In: Eurocrypt (2022)","DOI":"10.1007\/978-3-031-06944-4_9"},{"key":"12_CR69","doi-asserted-by":"crossref","unstructured":"Nikolaenko, V., Ragsdale, S., Bonneau, J., Boneh, D.: Powers-of-tau to the people: decentralizing setup ceremonies. In: ACNS (2024)","DOI":"10.1007\/978-3-031-54776-8_5"},{"key":"12_CR70","unstructured":"Internet Archive. The internet archive (2024). https:\/\/archive.org\/"},{"key":"12_CR71","unstructured":"Definitely Setup. Definitely setup project (2024). https:\/\/github.com\/privacy-scaling-explorations\/DefinitelySetup"},{"key":"12_CR72","doi-asserted-by":"crossref","unstructured":"Ishai, Y., Ostrovsky, R., Seyalioglu, H.: Identifying cheaters without an honest majority. In: TCC (2012)","DOI":"10.1007\/978-3-642-28914-9_2"},{"key":"12_CR73","doi-asserted-by":"crossref","unstructured":"Ishai, Y., Ostrovsky, R., Zikas, V.: Secure multi-party computation with identifiable abort. In: CRYPTO (2014)","DOI":"10.1007\/978-3-662-44381-1_21"},{"key":"12_CR74","doi-asserted-by":"crossref","unstructured":"Cleve, R.: Limits on the security of coin flips when half the processors are faulty. In: STOC (1986)","DOI":"10.1145\/12130.12168"},{"key":"12_CR75","doi-asserted-by":"crossref","unstructured":"Ishai, Y., Patra, A., Patranabis, S., Ravi, D., Srinivasan, A.: Fully-secure MPC with minimal trust. In: TCC (2022)","DOI":"10.1007\/978-3-031-22365-5_17"},{"key":"12_CR76","unstructured":"Aleo trusted setup. https:\/\/setup.aleo.org\/"},{"key":"12_CR77","unstructured":"Anon adahaar trusted ceremony. https:\/\/ceremony.pse.dev\/projects\/Anon Aadhaar V2 Trusted Setup Ceremony"},{"key":"12_CR78","unstructured":"Axiom trusted ceremony. https:\/\/docs.axiom.xyz\/docs\/transparency-and-security\/kzg-trusted-setup"},{"key":"12_CR79","unstructured":"Damg\u00e5rd, I.: On $$\\sigma $$-protocols. Technical report (2002)"},{"key":"12_CR80","unstructured":"Celo plumo trusted ceremony. https:\/\/blog.celo.org\/the-plumo-ceremony-ac7649e9c8d8"},{"key":"12_CR81","unstructured":"CLR-fund trusted ceremony. https:\/\/blog.clr.fund\/trusted-setup-completed"},{"key":"12_CR82","unstructured":"Degate trusted setup. https:\/\/medium.com\/degate\/degate-completes-zk-trusted-setup-ceremony-4752301e379f"},{"key":"12_CR83","unstructured":"Email wallet trusted ceremony. https:\/\/ceremony.pse.dev\/projects\/Email%20Wallet%20Trusted%20Setup%20Ceremony"},{"key":"12_CR84","unstructured":"Filecoin mainnet trusted setup. https:\/\/filecoin.io\/blog\/posts\/trusted-setup-complete\/"},{"key":"12_CR85","unstructured":"Filecoin snapdeal trusted setup. https:\/\/filecoin.io\/blog\/posts\/trusted-setup-complete-for-network-v15-upgrade\/"},{"key":"12_CR86","unstructured":"Fractal cash trusted setup ceremony. https:\/\/medium.com\/@fractalcash\/fractal-cash-announces-trusted-setup-ceremony-652445cfe176"},{"key":"12_CR87","unstructured":"Hermez trusted setup ceremony. https:\/\/github.com\/hermeznetwork\/phase2ceremony_4"},{"key":"12_CR88","unstructured":"Ethereum KZG ceremony. https:\/\/github.com\/ethereum\/kzg-ceremony"},{"key":"12_CR89","unstructured":"Loopring trusted setup ceremony. https:\/\/loopring.org\/#\/ceremony"},{"key":"12_CR90","unstructured":"Maci v1 trusted setup ceremony. https:\/\/ceremony.pse.dev\/projects\/Maci%20v1%20Trusted%20Setup%20Ceremony"},{"key":"12_CR91","unstructured":"Maci v1 trusted setup ceremony. https:\/\/ceremony.pse.dev\/projects\/MACI%20V1.2.0%20Trusted%20Setup%20Ceremony"},{"key":"12_CR92","unstructured":"Maci v2 trusted setup ceremony. https:\/\/ceremony.pse.dev\/projects\/MACI%20v2%20Trusted%20Setup%20Ceremony"},{"key":"12_CR93","unstructured":"Manta trusted setup. https:\/\/cointelegraph.com\/news\/manta-network-conducts-record-breaking-trusted-setup-ceremony-4-000-contribute"},{"key":"12_CR94","unstructured":"Namanda trusted setup. https:\/\/namada.net\/trusted-setup"},{"key":"12_CR95","unstructured":"Panther trusted setup ceremony. https:\/\/github.com\/pantherprotocol\/preZKPceremony"},{"key":"12_CR96","unstructured":"Ppot trusted setup. https:\/\/perpetualpowersoftau.com\/"},{"key":"12_CR97","unstructured":"Rln trusted setup ceremony. https:\/\/ceremony.pse.dev\/projects\/RLN%20Trusted%20Setup%20Ceremony"},{"key":"12_CR98","unstructured":"Risczero trusted setup ceremony. https:\/\/ceremony.pse.dev\/projects\/RISC%20Zero%20STARK-to-SNARK%20Prover"},{"key":"12_CR99","unstructured":"Semaphore v4 trusted setup ceremony. https:\/\/ceremony.pse.dev\/projects\/Semaphore%20V4%20Ceremony"},{"key":"12_CR100","unstructured":"Tornadocash trusted setup ceremony. https:\/\/tornado-cash.medium.com\/the-biggest-trusted-setup-ceremony-in-the-world-3c6ab9c8fffa"},{"key":"12_CR101","unstructured":"Unirep trusted setup ceremony. https:\/\/ceremony.unirep.io\/"},{"key":"12_CR102","unstructured":"Zcash sprout setup ceremony. https:\/\/electriccoin.co\/blog\/the-design-of-the-ceremony\/"},{"key":"12_CR103","unstructured":"Zcash sapling MPC. https:\/\/electriccoin.co\/blog\/completion-of-the-sapling-mpc\/"},{"key":"12_CR104","unstructured":"Zkopru trusted setup ceremony. https:\/\/medium.com\/privacy-scaling-explorations\/zkopru-trusted-setup-ceremony-f2824bfebb0f"},{"key":"12_CR105","unstructured":"Zkp2p trusted setup. https:\/\/ceremony.pse.dev\/projects\/ZKP2P%20Trusted%20Setup%20Ceremony"},{"key":"12_CR106","unstructured":"Zkp2p v2 trusted setup. https:\/\/ceremony.pse.dev\/projects\/ZKP2P%20Trusted%20Setup%20Ceremony%20V2"},{"key":"12_CR107","unstructured":"Zkp2p domain trusted setup. https:\/\/ceremony.pse.dev\/projects\/ZKP2P%20Domain%20Marketplace"},{"key":"12_CR108","unstructured":"Zksync trusted setup. https:\/\/docs.lite.zksync.io\/userdocs\/security\/#universal-crs-setup"},{"key":"12_CR109","unstructured":"Zkticket trusted setup. https:\/\/ceremony.pse.dev\/projects\/ZK%20Ticket%20Trusted%20Setup%20Ceremony"},{"key":"12_CR110","unstructured":"Gabizon, A.: On the security of the BCTV Pinocchio zk-SNARK variant. Cryptology ePrint Archive, Paper 2019\/119 (2019)"},{"key":"12_CR111","doi-asserted-by":"crossref","unstructured":"Campanelli, M., Gennaro, R., Goldfeder, S., Nizzardo, L.: Zero-knowledge contingent payments revisited: attacks and payments for services. In: ACM CCS (2017)","DOI":"10.1145\/3133956.3134060"},{"key":"12_CR112","doi-asserted-by":"crossref","unstructured":"Bellare, M., Fuchsbauer, G., Scafuro, A.: NIZKs with an untrusted CRS: security in the face of parameter subversion. In: Asiacrypt (2016)","DOI":"10.1007\/978-3-662-53890-6_26"},{"key":"12_CR113","unstructured":"Swihart, J.: Zcash counterfeiting vulnerability successfully remediated. ECC Blog (2019)"},{"key":"12_CR114","unstructured":"Choudhuri, A.R., Garg, S., Goel, A., Sekar, S., Sinha, R.: Sublonk: sublinear prover plonk. Cryptology ePrint Archive, Paper 2023\/902 (2023)"},{"key":"12_CR115","doi-asserted-by":"crossref","unstructured":"Das, S., Xiang, Z., Ren, L.: Powers of tau in asynchrony. In: NDSS (2024)","DOI":"10.14722\/ndss.2024.24733"},{"key":"12_CR116","doi-asserted-by":"crossref","unstructured":"Barreto, P. S.L.M., Naehrig, M.: Pairing-friendly elliptic curves of prime order. In: SAC (2006)","DOI":"10.1007\/11693383_22"},{"key":"12_CR117","doi-asserted-by":"crossref","unstructured":"Barreto, P.S., Lynn, B., Scott, M.: Constructing elliptic curves with prescribed embedding degrees. In: SCN (2003)","DOI":"10.1007\/3-540-36413-7_19"},{"key":"12_CR118","doi-asserted-by":"crossref","unstructured":"Bell\u00e9s-Mu\u00f1oz, M., Whitehat, B., Baylina, J., Daza, V., Mu\u00f1oz-Tapia, J.L.: Twisted edwards elliptic curves for zero-knowledge circuits. Mathematics (2021)","DOI":"10.3390\/math9233022"},{"key":"12_CR119","unstructured":"Buterin, V., Reitwiessner, C.: EIP-197: Precompiled contracts for optimal ate pairing check on the elliptic curve alt_bn128 (2017)"},{"key":"12_CR120","unstructured":"Multi-party computation protocol for the key-generation step of Pinocchio zkSNARKs. https:\/\/github.com\/zcash\/mpc"},{"key":"12_CR121","unstructured":"NCC Group\u00a0Research Blog. Zcash cryptography and code review"},{"key":"12_CR122","unstructured":"KZG ceremony (2023). https:\/\/github.com\/ethereum\/kzg-ceremony"},{"key":"12_CR123","doi-asserted-by":"crossref","unstructured":"Kim, S., Woo, S., Lee, H., Oh, H.: Vuddy: a scalable approach for vulnerable code clone discovery. In: IEEE Security & Privacy (2017)","DOI":"10.1109\/SP.2017.62"},{"key":"12_CR124","unstructured":"arkworks contributors. arkworks zkSNARK ecosystem (2022). https:\/\/arkworks.rs"},{"key":"12_CR125","doi-asserted-by":"publisher","unstructured":"Botrel, G., Piellard, T., El Housni, Y., Kubjas, I., Tabaie, A.: Consensys\/gnark: v0.9.0 (2023). https:\/\/doi.org\/10.5281\/zenodo.5819104","DOI":"10.5281\/zenodo.5819104"},{"key":"12_CR126","unstructured":"KZG Ceremony Special Contributions (2023). https:\/\/github.com\/ethereum\/kzg-ceremony\/blob\/main\/special_contributions.md"}],"container-title":["Lecture Notes in Computer Science","Financial Cryptography and Data Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-07024-1_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T00:30:45Z","timestamp":1767313845000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-07024-1_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032070234","9783032070241"],"references-count":126,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-07024-1_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"2 January 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Financial Cryptography and Data Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Miyakojima","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Japan","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":"14 April 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 April 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"fc2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/fc25.ifca.ai\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}