Noninteractive zero knowledge for NP from (Plain) Learning With Errors

Recommendations

Towards non-interactive zero-knowledge for NP from LWE
Toward non-interactive zero-knowledge proofs for NP from LWE
Efficient NIZKs from LWE via polynomial reconstruction and ``MPC in the head
Noninteractive Statistical Zero-Knowledge Proofs for Lattice Problems
Perfect Non-interactive Zero Knowledge for NP

Cited in

(only showing first 100 items - show all)

Traceable ring signatures: general framework and post-quantum security
Compact designated verifier NIZKs from the CDH assumption without pairings
Compact NIZKs from standard assumptions on bilinear maps
New constructions of statistical NIZKs: dual-mode DV-NIZKs and more
Non-interactive zero-knowledge in pairing-free groups from weaker assumptions
Statistical ZAP arguments
Statistical Zaps and new oblivious transfer protocols
Non-interactive zero knowledge from sub-exponential DDH
Post-quantum multi-party computation
Multiparty reusable non-interactive secure computation from LWE
Candidate obfuscation via oblivious LWE sampling
Bifurcated signatures: folding the accountability vs. anonymity dilemma into a single private signing scheme
A lattice-based fully dynamic group signature scheme without NIZK
Non-interactive CCA2-secure threshold cryptosystems: achieving adaptive security in the standard model without pairings
Single-to-multi-theorem transformations for non-interactive statistical zero-knowledge
BETA: biometric-enabled threshold authentication
Fiat-Shamir for repeated squaring with applications to PPAD-hardness and VDFs
New techniques for zero-knowledge: leveraging inefficient provers to reduce assumptions, interaction, and trust
NIZK from LPN and trapdoor hash via correlation intractability for approximable relations
Non-interactive zero-knowledge arguments for QMA, with preprocessing
Password protected secret sharing from lattices
On instantiating the algebraic group model from falsifiable assumptions
Compact ring signatures from learning with errors
A black-box approach to post-quantum zero-knowledge in constant rounds
Multi-theorem designated-verifier NIZK for QMA
Attribute-based signatures from lattices: unbounded attributes and semi-adaptive security
Witness authenticating NIZKs and applications
Does Fiat-Shamir require a cryptographic hash function?
Non-interactive batch arguments for NP from standard assumptions
On black-box extension of a non-interactive zero-knowledge proof system for secret equality
Distributed (correlation) samplers: how to remove a trusted dealer in one round
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
Permuted puzzles and cryptographic hardness
On the (In)security of Kilian-based SNARGs
Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification
Towards non-interactive zero-knowledge for NP from LWE
Toward non-interactive zero-knowledge proofs for NP from LWE
Secure MPC: laziness leads to GOD
Non-interactive composition of sigma-protocols via Share-then-Hash
Towards classical hardness of module-LWE: the linear rank case
Secure quantum computation with classical communication
Secure software leasing from standard assumptions
Somewhere statistical soundness, post-quantum security, and SNARGs
Receiver selective opening security for identity-based encryption in the multi-challenge setting
Succinct LWE sampling, random polynomials, and obfuscation
Vector and functional commitments from lattices
Simulatable verifiable random function from the LWE assumption
On black-box extensions of non-interactive zero-knowledge arguments, and signatures directly from simulation soundness
Rational modular encoding in the DCR setting: non-interactive range proofs and Paillier-based Naor-Yung in the standard model
\(k\)-critical graphs in \(P_5\)-free graphs
Multi-theorem preprocessing NIZKs from lattices
Explainable arguments
SNARGs and PPAD hardness from the decisional Diffie-Hellman assumption
Functional commitments for all functions, with transparent setup and from SIS
Succinct vector, polynomial, and functional commitments from lattices
Non-interactive publicly-verifiable delegation of committed programs
Round-optimal oblivious transfer and MPC from computational CSIDH
A generic transform from multi-round interactive proof to NIZK
Batch arguments for \textsf{NP} and more from standard bilinear group assumptions
Multimodal private signatures
NIZK from SNARGs
Verifiable relation sharing and multi-verifier zero-knowledge in two rounds: trading NIZKs with honest majority (extended abstract)
mrNISC from LWE with polynomial modulus
Unconditionally secure NIZK in the fine-grained setting
Triply adaptive UC NIZK
Efficient NIZKs from LWE via polynomial reconstruction and ``MPC in the head
Classically verifiable NIZK for QMA with preprocessing
mrNISC from LWE with polynomial modulus
Public-coin 3-round zero-knowledge from learning with errors and keyless multi-collision-resistant hash
Time-release cryptography from minimal circuit assumptions
Succinct publicly-certifiable proofs. Or, can a blockchain verify a designated-verifier proof?
PPAD is as hard as LWE and iterated squaring
Universal ring signatures in the standard model
Non-interactive zero-knowledge from non-interactive batch arguments
Correlation intractability and SNARGs from sub-exponential DDH
A note on non-interactive zero-knowledge from CDH
Secure computation with shared EPR pairs (or: how to teleport in zero-knowledge)
Compact lattice gadget and its applications to hash-and-sign signatures
Almost tight multi-user security under adaptive corruptions from LWE in the standard model
A lower bound for proving hardness of learning with rounding with polynomial modulus
Chosen Ciphertext Secure Functional Encryption from Constrained Witness PRF
CCA Secure Attribute-Hiding Inner Product Encryption from Minimal Assumption
Non-Observable Quantum Random Oracle Model
When Arthur has neither random coins nor time to spare: superfast derandomization of proof systems
Quantum depth in the random oracle model
Hard languages in NP \(\cap\) coNP and NIZK proofs from unstructured hardness
Multi-theorem Fiat-Shamir transform from correlation-intractable hash functions
Bicameral and auditably private signatures
Oblivious transfer from zero-knowledge proofs. Or how to achieve round-optimal quantum oblivious transfer and zero-knowledge proofs on quantum states
Compact NIZKs from standard assumptions on bilinear maps
On the round complexity of fully secure solitary MPC with honest majority
On Gaussian sampling, smoothing parameter and application to signatures
Ring/module learning with errors under linear leakage -- hardness and applications
On structure-preserving cryptography and lattices
Two-round maliciously-secure oblivious transfer with optimal rate
Lossy cryptography from code-based assumptions
Circuit ABE with \(\mathsf{poly}(\mathrm{depth},\lambda )\)-sized ciphertexts and keys from lattices
Non-interactive zero-knowledge from LPN and MQ
NIZKs with maliciously chosen CRS: subversion advice-ZK and accountable soundness

This page was built for publication: Noninteractive zero knowledge for NP from (Plain) Learning With Errors

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2181846)