NIZK from LPN and trapdoor hash via correlation intractability for approximable relations
From MaRDI portal
Publication:2104241
DOI10.1007/978-3-030-56877-1_26zbMATH Open1504.94110OpenAlexW3013660109MaRDI QIDQ2104241FDOQ2104241
Authors: Zvika Brakerski, Venkata Koppula, Tamer Mour 
Publication date: 7 December 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-56877-1_26
Recommendations
- Efficient NIZKs from LWE via polynomial reconstruction and ``MPC in the head
- Towards non-interactive zero-knowledge for NP from LWE
- Unconditionally secure NIZK in the fine-grained setting
- Toward non-interactive zero-knowledge proofs for NP from LWE
- Making NTRU as secure as worst-case problems over ideal lattices
- Publication:4938630
- A lattice attack on homomorphic NTRU with non-invertible public keys
- Hardness of \(k\)-LWE and applications in traitor tracing
- Hardness of \(k\)-LWE and applications in traitor tracing
Cites Work
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- The random oracle methodology, revisited.
- Title not available (Why is that?)
- The knowledge complexity of interactive proof-systems
- Title not available (Why is that?)
- Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions
- How to use indistinguishability obfuscation
- Theory of Cryptography
- New techniques for noninteractive zero-knowledge
- Noninteractive zero knowledge for NP from (Plain) Learning With Errors
- Fiat-Shamir and correlation intractability from strong KDM-secure encryption
- From obfuscation to the security of Fiat-Shamir for proofs
- Trapdoor hash functions and their applications
- NIZK from LPN and trapdoor hash via correlation intractability for approximable relations
- Fiat-Shamir: from practice to theory
Cited In (24)
- Compact NIZKs from standard assumptions on bilinear maps
- Universal ring signatures in the standard model
- Triply adaptive UC NIZK
- Does Fiat-Shamir require a cryptographic hash function?
- Non-interactive batch arguments for NP from standard assumptions
- A framework for statistically sender private OT with optimal rate
- Non-interactive zero-knowledge from non-interactive batch arguments
- A note on non-interactive zero-knowledge from CDH
- Correlation intractability and SNARGs from sub-exponential DDH
- Secure computation with shared EPR pairs (or: how to teleport in zero-knowledge)
- Statistically sender-private OT from LPN and derandomization
- SNARGs and PPAD hardness from the decisional Diffie-Hellman assumption
- PPAD is as hard as LWE and iterated squaring
- One-shot Fiat-Shamir-based NIZK arguments of composite residuosity and logarithmic-size ring signatures in the standard model
- SNARGs for P from sub-exponential DDH and QR
- Compact designated verifier NIZKs from the CDH assumption without pairings
- Non-interactive zero knowledge from sub-exponential DDH
- A generic transform from multi-round interactive proof to NIZK
- Lower-bounds on public-key operations in PIR
- NIZK from LPN and trapdoor hash via correlation intractability for approximable relations
- Amortizing rate-1 OT and applications to PIR and PSI
- Non-interactive zero-knowledge from LPN and MQ
- Efficient NIZKs from LWE via polynomial reconstruction and ``MPC in the head
- Multi-theorem Fiat-Shamir transform from correlation-intractable hash functions
This page was built for publication: NIZK from LPN and trapdoor hash via correlation intractability for approximable relations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2104241)
