Public-coin three-round zero-knowledge from learning with errors and keyless multi-collision-resistant hash
From MaRDI portal
Cites work
- \textsc{Fractal}: post-quantum and transparent recursive proofs from holography
- 3-message zero knowledge against human ignorance
- 4-round resettably-sound zero knowledge
- A decade of lattice cryptography
- A generic approach to constructing and proving verifiable random functions
- A hierarchy theorem for interactive proofs of proximity
- Advances in Cryptology – CRYPTO 2004
- Advances in Cryptology – CRYPTO 2004
- An Algebraic Approach to Nonmalleability
- Collision resistant hashing for paranoids: dealing with multiple collisions
- Constant-round concurrent zero knowledge from P-certificates
- Definitions and properties of zero-knowledge proof systems
- Delayed-input non-malleable zero knowledge and multi-party coin tossing in four rounds
- Delegating computation: interactive proofs for muggles
- Distinguisher-dependent simulation in two rounds and its applications
- Extractable Perfectly One-Way Functions
- Fiat-Shamir for repeated squaring with applications to PPAD-hardness and VDFs
- Fiat–Shamir via list-recoverable codes (or: parallel repetition of GMW is not zero-knowledge)
- Foundations of Cryptography
- Holographic SNARGs for P and batch-NP from (polynomially hard) learning with errors
- How to achieve non-malleability in one or two rounds
- How to delegate computations publicly
- How to Delegate Computations: The Power of No-Signaling Proofs
- scientific article; zbMATH DE number 4101089 (Why is no real title available?)
- scientific article; zbMATH DE number 1302862 (Why is no real title available?)
- scientific article; zbMATH DE number 1003235 (Why is no real title available?)
- scientific article; zbMATH DE number 2009954 (Why is no real title available?)
- scientific article; zbMATH DE number 7829262 (Why is no real title available?)
- Indistinguishability obfuscation via mathematical proofs of equivalence
- Individual simulations
- Interactive proofs of proximity: delegating computation in sublinear time
- Lattice-based FHE as secure as PKE
- Leakage-resilient zero knowledge
- Marlin: preprocessing zkSNARKs with universal and updatable SRS
- Memory delegation
- Multi-collision resistance: a paradigm for keyless hash functions
- Multi-collision resistant hash functions and their applications
- Nearly-linear size holographic proofs
- Non-deterministic exponential time has two-prover interactive protocols
- Non-interactive batch arguments for NP from standard assumptions
- Non-interactive delegation and batch NP verification from standard computational assumptions
- Noninteractive zero knowledge for NP from (Plain) Learning With Errors
- On lattices, learning with errors, random linear codes, and cryptography
- On non-uniform security for black-box non-interactive CCA commitments
- On round optimal statistical zero knowledge arguments
- On the communication complexity of secure function evaluation with long output
- On the Composition of Zero-Knowledge Proof Systems
- On the existence of extractable one-way functions
- One-message zero knowledge and non-malleable commitments
- PPAD is as hard as LWE and iterated squaring
- Probabilistic checking of proofs
- Probability and Computing
- Promise zero knowledge and its applications to round optimal MPC
- Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
- Public-coin 3-round zero-knowledge from learning with errors and keyless multi-collision-resistant hash
- Random Oracles and Auxiliary Input
- SNARGs for \(\mathcal{P}\) from LWE
- SNARGs for bounded depth computations and PPAD hardness from sub-exponential LWE
- SNARGs for P from sub-exponential DDH and QR
- Somewhere statistical soundness, post-quantum security, and SNARGs
- The hunting of the SNARK
- The Knowledge Complexity of Interactive Proof Systems
- The random oracle methodology, revisited.
- Theory of Cryptography
- Universal Arguments and their Applications
- Weak zero-knowledge beyond the black-box barrier
- Weak zero-knowledge via the Goldreich-Levin theorem
- Weakly extractable one-way functions
This page was built for publication: Public-coin three-round zero-knowledge from learning with errors and keyless multi-collision-resistant hash
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6883139)
