Scalable zero knowledge via cycles of elliptic curves
type: Item
instance of: scholarly article
title: Scalable zero knowledge via cycles of elliptic curves
zbMATH Open document ID: 1383.68035
author: Eli Ben-Sasson
author: Alessandro Chiesa
author: Eran Tromer
author: Madars Virza
published in: Algorithmica
publication date: 2018-01-05T00:00:00Z
full work available at URL: http://hdl.handle.net/1721.1/116751
Mathematics Subject Classification ID: 68Q15
Mathematics Subject Classification ID: 11T71
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 6822863
zbMATH Keywords: computationally-sound proofs
zbMATH Keywords: proof-carrying data
zbMATH Keywords: zero knowledge
zbMATH Keywords: elliptic curves
describes a project that uses: SNARKs for C
describes a project that uses: Pinocchio
describes a project that uses: zk-SNARK
describes a project that uses: ADSNARK
describes a project that uses: Plutus
describes a project that uses: SiRiUS
describes a project that uses: Geppetto
describes a project that uses: ECPP
describes a project that uses: SWIFFT
MaRDI profile type: Publication
OpenAlex ID: W3022540164
cites work: SWIFFT: A Modest Proposal for FFT Hashing
cites work: Q4228459
cites work: Elliptic Curves and Primality Proving
cites work: Fast probabilistic algorithms for Hamiltonian circuits and matchings
cites work: Advances in Cryptology – CRYPTO 2004
cites work: The discrete logarithm problem on elliptic curves of trace one
cites work: From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again
cites work: Recursive composition and bootstrapping for SNARKS and proof-carrying data
cites work: SNARKs for C: Verifying Program Executions Succinctly and in Zero Knowledge
cites work: On the Final Exponentiation in Tate Pairing Computations
cites work: Fast reductions from RAMs to delegatable succinct constraint satisfaction problems
cites work: On the concrete efficiency of probabilistically-checkable proofs
cites work: Succinct Non-interactive Arguments via Linear Interactive Proofs
cites work: Optimal Pairings
cites work: Scalable Zero Knowledge via Cycles of Elliptic Curves
cites work: Noninteractive Zero-Knowledge
cites work: Checking the correctness of memories
cites work: A taxonomy of pairing-friendly elliptic curves
cites work: Lattice reduction: a toolbox for the cryptoanalyst
cites work: The Tate pairing and the discrete logarithm applied to elliptic curve cryptosystems
cites work: Efficient pairing computation on supersingular abelian varieties
cites work: Q4409129
cites work: Classical hardness of learning with errors
cites work: Q4414287
cites work: Efficient implementation of pairing-based cryptosystems
cites work: Constructing Tower Extensions of Finite Fields for Implementation of Pairing-Based Cryptography
cites work: Targeted malleability: homomorphic encryption for restricted computations
cites work: Elliptic curves suitable for pairing based cryptography
cites work: Handbook of Elliptic and Hyperelliptic Curve Cryptography
cites work: Practical verified computation with streaming interactive proofs
cites work: Kangaroos, monopoly and discrete logarithms
cites work: Q4133134
cites work: Monte Carlo Methods for Index Computation (mod p)
cites work: Cluster Computing in Zero Knowledge
cites work: Building curves with arbitrary small MOV degree over finite prime fields
cites work: Square Span Programs with Applications to Succinct NIZK Arguments
cites work: Class Invariants by the CRT Method
cites work: A Remark Concerning m-Divisibility and the Discrete Logarithm in the Divisor Class Group of Curves
cites work: How To Prove Yourself: Practical Solutions to Identification and Signature Problems
cites work: Collision-Free Hashing from Lattice Problems
cites work: Candidate Multilinear Maps from Ideal Lattices
cites work: Quadratic Span Programs and Succinct NIZKs without PCPs
cites work: Q4737495
cites work: The complexity of Boolean functions in different characteristics
cites work: Short Pairing-Based Non-interactive Zero-Knowledge Arguments
cites work: Faster Squaring in the Cyclotomic Subgroup of Sixth Degree Extensions
cites work: Separating succinct non-interactive arguments from all falsifiable assumptions
cites work: The Eta Pairing Revisited
cites work: Evaluation of discrete logarithms in a group of 𝑝-torsion points of an elliptic curve in characteristic 𝑝

Scalable zero knowledge via cycles of elliptic curves (cites work)
cites work: On Prime-Order Elliptic Curves with Embedding Degrees k = 3, 4, and 6

Scalable zero knowledge via cycles of elliptic curves (cites work)
cites work: Progression-Free Sets and Sublinear Pairing-Based Non-Interactive Zero-Knowledge Arguments

Scalable zero knowledge via cycles of elliptic curves (cites work)
cites work: Succinct Non-Interactive Zero Knowledge Arguments from Span Programs and Linear Error-Correcting Codes

Scalable zero knowledge via cycles of elliptic curves (cites work)
cites work: Efficient NIZK Arguments via Parallel Verification of Benes Networks

Scalable zero knowledge via cycles of elliptic curves (cites work)
cites work: Generalized Compact Knapsacks Are Collision Resistant

Scalable zero knowledge via cycles of elliptic curves (cites work)
cites work: An Analysis of Affine Coordinates for Pairing Computation

Scalable zero knowledge via cycles of elliptic curves (cites work)
cites work: Q3509721

Scalable zero knowledge via cycles of elliptic curves (cites work)
cites work: Computationally Sound Proofs

Scalable zero knowledge via cycles of elliptic curves (cites work)
cites work: Q2763028

Scalable zero knowledge via cycles of elliptic curves (cites work)
cites work: Reducing elliptic curve logarithms to logarithms in a finite field

Scalable zero knowledge via cycles of elliptic curves (cites work)
cites work: Q3726006

Scalable zero knowledge via cycles of elliptic curves (cites work)
cites work: An improved algorithm for computing logarithms over&lt;tex&gt;GF(p)&lt;/tex&gt;and its cryptographic significance (Corresp.)

Scalable zero knowledge via cycles of elliptic curves (cites work)
cites work: Theory of Cryptography

Scalable zero knowledge via cycles of elliptic curves (cites work)
cites work: Lower bounds on the size of bounded depth circuits over a complete basis with logical addition

Scalable zero knowledge via cycles of elliptic curves (cites work)
cites work: Q4217446

Scalable zero knowledge via cycles of elliptic curves (cites work)
cites work: Generating more MNT elliptic curves

Scalable zero knowledge via cycles of elliptic curves (cites work)
cites work: On the Final Exponentiation for Calculating Pairings on Ordinary Elliptic Curves

Scalable zero knowledge via cycles of elliptic curves (cites work)
cites work: Topics in Cryptology – CT-RSA 2005

Scalable zero knowledge via cycles of elliptic curves (cites work)
cites work: Q3543476

Scalable zero knowledge via cycles of elliptic curves (cites work)
cites work: Q5628224

Scalable zero knowledge via cycles of elliptic curves (cites work)
cites work: The Arithmetic of Elliptic Curves

Scalable zero knowledge via cycles of elliptic curves (cites work)
cites work: Amicable Pairs and Aliquot Cycles for Elliptic Curves

Scalable zero knowledge via cycles of elliptic curves (cites work)
cites work: Computing Hilbert class polynomials with the Chinese remainder theorem

Scalable zero knowledge via cycles of elliptic curves (cites work)
cites work: Accelerating the CM method

Scalable zero knowledge via cycles of elliptic curves (cites work)
cites work: Time-Optimal Interactive Proofs for Circuit Evaluation

Scalable zero knowledge via cycles of elliptic curves (cites work)
cites work: Incrementally Verifiable Computation or Proofs of Knowledge Imply Time/Space Efficiency

Scalable zero knowledge via cycles of elliptic curves (cites work)
cites work: Parallel collision search with cryptanalytic applications

Scalable zero knowledge via cycles of elliptic curves (cites work)
cites work: Q5386130

Scalable zero knowledge via cycles of elliptic curves (DOI)
DOI: 10.1007/S00453-016-0221-0