Intmax2: A ZK-rollup with Minimal Onchain Data and Computation Costs Featuring Decentralized Aggregators
暂无分享,去创建一个
[1] Mary Maller,et al. Marlin: Preprocessing zkSNARKs with Universal and Updatable SRS , 2020, IACR Cryptol. ePrint Arch..
[2] Nicholas Spooner,et al. Fractal: Post-Quantum and Transparent Recursive Proofs from Holography , 2020, IACR Cryptol. ePrint Arch..
[3] Ben Fisch,et al. Transparent SNARKs from DARK Compilers , 2020, IACR Cryptol. ePrint Arch..
[4] Markulf Kohlweiss,et al. Sonic: Zero-Knowledge SNARKs from Linear-Size Universal and Updatable Structured Reference Strings , 2019, IACR Cryptol. ePrint Arch..
[5] Jens Groth,et al. On the Size of Pairing-Based Non-interactive Arguments , 2016, EUROCRYPT.
[6] D. Boneh,et al. Short Signatures from the Weil Pairing , 2001, Journal of Cryptology.
[7] Silvio Micali,et al. The knowledge complexity of interactive proof-systems , 1985, STOC '85.
[8] Abhishek Jain,et al. zkSaaS: Zero-Knowledge SNARKs as a Service , 2023, IACR Cryptol. ePrint Arch..
[9] Srinath T. V. Setty,et al. Revisiting the Nova Proof System on a Cycle of Curves , 2023, IACR Cryptol. ePrint Arch..
[10] Srinath T. V. Setty,et al. SuperNova: Proving universal machine executions without universal circuits , 2022, IACR Cryptol. ePrint Arch..
[11] Srinath T. V. Setty,et al. Nova: Recursive Zero-Knowledge Arguments from Folding Schemes , 2021, IACR Cryptol. ePrint Arch..
[12] Ariel Gabizon,et al. PLONK: Permutations over Lagrange-bases for Oecumenical Noninteractive arguments of Knowledge , 2019, IACR Cryptol. ePrint Arch..
[13] Eli Ben-Sasson,et al. Scalable, transparent, and post-quantum secure computational integrity , 2018, IACR Cryptol. ePrint Arch..