Scalable Zero Knowledge via Cycles of Elliptic Curves
From MaRDI portal
Publication:2874542
DOI10.1007/978-3-662-44381-1_16zbMath1334.68077OpenAlexW2529173666MaRDI QIDQ2874542
Eran Tromer, Madars Virza, Alessandro Chiesa, Eli Ben-Sasson
Publication date: 7 August 2014
Published in: Advances in Cryptology – CRYPTO 2014 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-44381-1_16
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items (57)
\textsf{Halo Infinite}: proof-carrying data from additive polynomial commitments ⋮ Concretely-Efficient Zero-Knowledge Arguments for Arithmetic Circuits and Their Application to Lattice-Based Cryptography ⋮ On the (In)Security of SNARKs in the Presence of Oracles ⋮ BooLigero: improved sublinear zero knowledge proofs for Boolean circuits ⋮ Efficient proof composition for verifiable computation ⋮ On succinct non-interactive arguments in relativized worlds ⋮ Families of SNARK-friendly 2-chains of elliptic curves ⋮ Stacking sigmas: a framework to compose \(\varSigma\)-protocols for disjunctions ⋮ ECLIPSE: Enhanced Compiling Method for Pedersen-Committed zkSNARK Engines ⋮ SnarkPack: practical SNARK aggregation ⋮ Zero knowledge proofs towards verifiable decentralized AI pipelines ⋮ Plumo: an ultralight blockchain client ⋮ An efficient identity tracing scheme for blockchain-based systems ⋮ Speed-stacking: fast sublinear zero-knowledge proofs for disjunctions ⋮ Proof-carrying data from arithmetized random oracles ⋮ On Valiant's conjecture. Impossibility of incrementally verifiable computation from random oracles ⋮ A survey of elliptic curves for proof systems ⋮ Scalable zero knowledge via cycles of elliptic curves ⋮ Rinocchio: SNARKs for ring arithmetic ⋮ Breaking the \(O(\sqrt{n})\)-bit barrier: Byzantine agreement with polylog bits per party ⋮ NIZKs with an Untrusted CRS: Security in the Face of Parameter Subversion ⋮ Lattice-based SNARKs: publicly verifiable, preprocessing, and recursively composable (extended abstract) ⋮ Resumable zero-knowledge for circuits from symmetric key primitives ⋮ Flashproofs: efficient zero-knowledge arguments of range and polynomial evaluation with transparent setup ⋮ Efficient zero-knowledge arguments in discrete logarithm setting: sublogarithmic proof or sublinear verifier ⋮ Efficient proof of RAM programs from any public-coin zero-knowledge system ⋮ What makes Fiat-Shamir zkSNARKs (updatable SRS) simulation extractable? ⋮ Multikey Fully Homomorphic Encryption and Applications ⋮ Lattice enumeration for tower NFS: a 521-bit discrete logarithm computation ⋮ Proofs for inner pairing products and applications ⋮ Snarky ceremonies ⋮ Efficient NIZKs for algebraic sets ⋮ Orion: zero knowledge proof with linear prover time ⋮ Nova: recursive zero-knowledge arguments from folding schemes ⋮ Zero-knowledge succinct non-interactive arguments of knowledge based on sets of polynomials ⋮ The hunting of the SNARK ⋮ Lattice enumeration and automorphisms for tower NFS: a 521-bit discrete logarithm computation ⋮ Impossibilities in succinct arguments: black-box extraction and more ⋮ Lattice-based succinct arguments from vanishing polynomials (extended abstract) ⋮ Unnamed Item ⋮ Sublinear Zero-Knowledge Arguments for RAM Programs ⋮ On Cycles of Pairing-Friendly Elliptic Curves ⋮ No-signaling linear PCPs ⋮ How to build time-lock encryption ⋮ No-signaling linear PCPs ⋮ Making the Best of a Leaky Situation: Zero-Knowledge PCPs from Leakage-Resilient Circuits ⋮ On subversion-resistant SNARKs ⋮ Marlin: preprocessing zkSNARKs with universal and updatable SRS ⋮ \textsc{Fractal}: post-quantum and transparent recursive proofs from holography ⋮ Compactness of hashing modes and efficiency beyond Merkle tree ⋮ Public verifiable private decision tree prediction ⋮ Hardware implementation of multiplication over quartic extension fields ⋮ Note on families of pairing-friendly elliptic curves with small embedding degree ⋮ Spartan: efficient and general-purpose zkSNARKs without trusted setup ⋮ Algorithms for elliptic curves ⋮ Computational Integrity with a Public Random String from Quasi-Linear PCPs ⋮ TurboIKOS: improved non-interactive zero knowledge and post-quantum signatures
Uses Software
This page was built for publication: Scalable Zero Knowledge via Cycles of Elliptic Curves
