Reference. Hekaton: Horizontally-Scalable zkSNARKs Via Proof Aggregation
Cite
Cites 48 works (0 here)
External (48)
- Jolt: SNARKs for Virtual Machines via Lookups (2024)
- Mangrove: A Scalable Framework for Folding-Based SNARKs (2024)
- Pianist: scalable zkrollups via fully distributed zero-knowledge proofs (2024)
- Hekaton: horizontally-scalable zksnarks via proof aggregation (2024)
- Ou: Automating the Parallelization of Zero-Knowledge Protocols (2023)
- Aplonk: aggregated plonk from multi-polynomial commitment schemes (2023)
- Advancing imessage security: imessage contact key verification (2023)
- Deploying key transparency at whatsapp (2023)
- arkworks zkSNARK ecosystem (2022)
- SnarkPack: Practical SNARK Aggregation (2022)
- Nova: Recursive Zero-Knowledge Arguments from Folding Schemes (2022)
- VeRSA: Verifiable Registries with Efficient Client Audits from RSA Authenticated Dictionaries (2022)
- zkBridge: Trustless Cross-chain Bridges Made Practical (2022)
- Caulk: Lookup Arguments in Sublinear Time (2022)
- Proof-Carrying Data Without Succinct Arguments (2021)
- Proofs for Inner Pairing Products and Applications (2021)
- zkCNN: Zero Knowledge Proofs for Convolutional Neural Network Predictions and Accuracy (2021)
- Poseidon: A new hash function for zero-knowledge proof systems (2021)
- Design of Symmetric-Key Primitives for Advanced Cryptographic Protocols (2020)
- ZEXE: Enabling Decentralized Private Computation (2020)
- Marlin: Preprocessing zkSNARKs with Universal and Updatable SRS (2020)
- Spartan: Efficient and General-Purpose zkSNARKs Without Trusted Setup (2020)
- plookup: A simplified polynomial protocol for lookup tables (2020)
- Proof-carrying data from accumulation schemes (2020)
- MIRAGE: succinct arguments for randomized algorithms with applications to universal zk-snarks (2020)
- LegoSNARK: Modular Design and Composition of Succinct Zero-Knowledge Proofs (2019)
- SEEMless: Secure End-to-End Encrypted Messaging with less</> Trust (2019)
- PLONK: permutations over lagrange-bases for oecumenical noninteractive arguments of knowledge (2019)
- Updating Key Size Estimations for Pairings (2018)
- Arya: Nearly Linear-Time Zero-Knowledge Proofs for Correct Program Execution (2018)
- Bulletproofs: Short Proofs for Confidential Transactions and More (2018)
- vRAM: Faster Verifiable RAM with Program-Independent Preprocessing (2018)
- DIZK: A distributed zero knowledge proof system (2018)
- Efficient Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log Setting (2016)
- On the Size of Pairing-Based Non-interactive Arguments (2016)
- Structure-Preserving Signatures and Commitments to Group Elements (2015)
- Cluster Computing in Zero Knowledge (2015)
- Geppetto: Versatile Verifiable Computation (2015)
- CONIKS: Bringing Key Transparency to End Users (2015)
- Scalable Zero Knowledge via Cycles of Elliptic Curves (2014)
- Succinct non-interactive zero knowledge for a von Neumann architecture (2014)
- Fast reductions from RAMs to delegatable succinct constraint satisfaction problems (2013)
- SNARKs for C: Verifying Program Executions Succinctly and in Zero Knowledge (2013)
- Quadratic Span Programs and Succinct NIZKs without PCPs (2013)
- Proof-carrying data and hearsay arguments from signature cards (2010)
- Checking the correctness of memories (2002)
- Efficient checking of computations (1990)
- Fingerprinting Sets (Tech. rep. CS-TR-212-89, Princeton University) (1989)