NIZK from LPN and trapdoor hash via correlation intractability for approximable relations
From MaRDI portal
Publication:2104241
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
- scientific article; zbMATH DE number 4101089 (Why is no real title available?)
- scientific article; zbMATH DE number 2009983 (Why is no real title available?)
- Fiat-Shamir and correlation intractability from strong KDM-secure encryption
- Fiat-Shamir: from practice to theory
- From obfuscation to the security of Fiat-Shamir for proofs
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- How to use indistinguishability obfuscation
- Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions
- NIZK from LPN and trapdoor hash via correlation intractability for approximable relations
- New techniques for noninteractive zero-knowledge
- Noninteractive zero knowledge for NP from (Plain) Learning With Errors
- The knowledge complexity of interactive proof-systems
- The random oracle methodology, revisited.
- Theory of Cryptography
- Trapdoor hash functions and their applications
Cited in
(24)- Compact NIZKs from standard assumptions on bilinear maps
- Universal ring signatures in the standard model
- Does Fiat-Shamir require a cryptographic hash function?
- Non-interactive batch arguments for NP from standard assumptions
- Triply adaptive UC NIZK
- 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
- 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
- PPAD is as hard as LWE and iterated squaring
- NIZK from LPN and trapdoor hash via correlation intractability for approximable relations
- A generic transform from multi-round interactive proof to NIZK
- Lower-bounds on public-key operations in PIR
- 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)
