scientific article; zbMATH DE number 7746256
From MaRDI portal
Publication:6081719
DOI10.17223/20710410/60/4MaRDI QIDQ6081719
Publication date: 5 October 2023
Full work available at URL: http://mathnet.ru/eng/pdm801
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
performance analysisperformance improvementsuccinct non-interactive argumentssize of public parameters
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Pairings for cryptographers
- An efficient protocol for authenticated key agreement
- Transparent SNARKs from DARK compilers
- Marlin: preprocessing zkSNARKs with universal and updatable SRS
- \textsc{Fractal}: post-quantum and transparent recursive proofs from holography
- Spartan: efficient and general-purpose zkSNARKs without trusted setup
- Energy and volume changes due to the formation of a circular inhomogeneity in a residual deviatoric stress field
- Faster computation of the Tate pairing
- Dory: efficient, transparent arguments for generalised inner products and polynomial commitments
- From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again
- SNARKs for C: Verifying Program Executions Succinctly and in Zero Knowledge
- Succinct Non-Interactive Zero Knowledge Arguments from Span Programs and Linear Error-Correcting Codes
- Scalable Zero Knowledge via Cycles of Elliptic Curves
- Faster Hashing to ${\mathbb G}_2$
- Progression-Free Sets and Sublinear Pairing-Based Non-Interactive Zero-Knowledge Arguments
- Efficient NIZK Arguments via Parallel Verification of Benes Networks
- Square Span Programs with Applications to Succinct NIZK Arguments
- On the Final Exponentiation in Tate Pairing Computations
- Short Pairing-Based Non-interactive Zero-Knowledge Arguments
- Short Non-interactive Zero-Knowledge Proofs
- High-Speed Software Implementation of the Optimal Ate Pairing over Barreto–Naehrig Curves
- Linear Algebra with Sub-linear Zero-Knowledge Arguments
- On the Final Exponentiation for Calculating Pairings on Ordinary Elliptic Curves
- Succinct NP Proofs from an Extractability Assumption
- Faster Squaring in the Cyclotomic Subgroup of Sixth Degree Extensions
- New lattice based cryptographic constructions
- Non-interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers
- From Secrecy to Soundness: Efficient Verification via Secure Computation
- Perfect Non-interactive Zero Knowledge for NP
- Perfect NIZK with Adaptive Soundness
- Polylogarithmic two-round argument systems
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- A Remark Concerning m-Divisibility and the Discrete Logarithm in the Divisor Class Group of Curves
- The Tate pairing and the discrete logarithm applied to elliptic curve cryptosystems
- Streaming Authenticated Data Structures
- Quadratic Span Programs and Succinct NIZKs without PCPs
- Optimal Pairings
- Fast Reed-Solomon Interactive Oracle Proofs of Proximity
- Fully homomorphic encryption using ideal lattices
- New lattice-based cryptographic constructions
- Incrementally Verifiable Computation or Proofs of Knowledge Imply Time/Space Efficiency
- Recursive composition and bootstrapping for SNARKS and proof-carrying data
- Topics in Cryptology – CT-RSA 2005
- On the Size of Pairing-Based Non-interactive Arguments
- Non-interactive Zaps and New Techniques for NIZK
- On lattices, learning with errors, random linear codes, and cryptography
- Zero-knowledge succinct non-interactive arguments of knowledge based on sets of polynomials
This page was built for publication:
