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)

Unique NIZKs and steganography detection
New techniques for preimage sampling: improved NIZKs and more from LWE
Succinct LWE sampling, random polynomials, and obfuscation
\(k\)-critical graphs in \(P_5\)-free graphs
Circuit ABE with \(\mathsf{poly}(\mathrm{depth},\lambda )\)-sized ciphertexts and keys from lattices
Lossy cryptography from code-based assumptions
Non-interactive zero-knowledge from LPN and MQ
Non-Observable Quantum Random Oracle Model
Post-quantum PKE from unstructured noisy linear algebraic assumptions: beyond LWE and Alekhnovich's LPN
Hard languages in NP \(\cap\) coNP and NIZK proofs from unstructured hardness
Binary codes for error detection and correction in a computationally bounded world
Quantum depth in the random oracle model
When Arthur has neither random coins nor time to spare: superfast derandomization of proof systems
Secure MPC: laziness leads to GOD
On the black-box complexity of correlation intractability
NIZKs with maliciously chosen CRS: subversion advice-ZK and accountable soundness
Efficient NIZKs from LWE via polynomial reconstruction and ``MPC in the head
Somewhere statistical soundness, post-quantum security, and SNARGs
NIZK from SNARGs
Verifiable relation sharing and multi-verifier zero-knowledge in two rounds: trading NIZKs with honest majority (extended abstract)
Multi-theorem Fiat-Shamir transform from correlation-intractable hash functions
Generic construction of threshold ring signatures and lattice-based instantiations
Lossy cryptography from code-based assumptions dense-sparse LPN: a new subexponentially hard LPN variant in SZK
Receiver selective opening security for identity-based encryption in the multi-challenge setting
Vector and functional commitments from lattices
Simulatable verifiable random function from the LWE assumption
mrNISC from LWE with polynomial modulus
On black-box extensions of non-interactive zero-knowledge arguments, and signatures directly from simulation soundness
On instantiating the algebraic group model from falsifiable assumptions
On the hardness of module-LWE with binary secret
Public-coin 3-round zero-knowledge from learning with errors and keyless multi-collision-resistant hash
Classically verifiable NIZK for QMA with preprocessing
Universally composable non-interactive zero-knowledge from sigma protocols via a new straight-line compiler
Adaptively secure attribute-based encryption from witness encryption
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
Non-interactive zero-knowledge arguments for QMA, with preprocessing
mrNISC from LWE with polynomial modulus
On the (In)security of Kilian-based SNARGs
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
Unclonable non-interactive zero-knowledge
Post-quantum multi-party computation
Permuted puzzles and cryptographic hardness
On the communication complexity of secure multi-party computation with aborts
Password protected secret sharing from lattices
A black-box approach to post-quantum zero-knowledge in constant rounds
Toward non-interactive zero-knowledge proofs for NP from LWE
Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification
On the round complexity of fully secure solitary MPC with honest majority
Time-release cryptography from minimal circuit assumptions
Attribute-based signatures from lattices: unbounded attributes and semi-adaptive security
On Gaussian sampling, smoothing parameter and application to signatures
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
Witness authenticating NIZKs and applications
Secure quantum computation with classical communication
Triply adaptive UC NIZK
Unconditionally secure NIZK in the fine-grained setting
Succinct publicly-certifiable proofs. Or, can a blockchain verify a designated-verifier proof?
Rational modular encoding in the DCR setting: non-interactive range proofs and Paillier-based Naor-Yung in the standard model
Batch arguments for \textsf{NP} and more from standard bilinear group assumptions
Explainable arguments
Towards classical hardness of module-LWE: the linear rank case
On the provable dual attack for LWE by modulus switching
GPV preimage sampling with weak smoothness and its applications to lattice signatures
Succinct vector, polynomial, and functional commitments from lattices
Lattice-based group signatures in the standard model, revisited
Functional commitments for all functions, with transparent setup and from SIS
Non-interactive zero-knowledge from non-interactive batch arguments
Non-interactive publicly-verifiable delegation of committed programs
Non-interactive zero-knowledge arguments with certified deletion
A Fiat-Shamir transformation from duplex sponges
A hidden-bits approach to statistical ZAPs from LWE
Multimodal private signatures
On black-box extension of a non-interactive zero-knowledge proof system for secret equality
A note on non-interactive zero-knowledge from CDH
Correlation intractability and SNARGs from sub-exponential DDH
A lower bound for proving hardness of learning with rounding with polynomial modulus
Almost tight multi-user security under adaptive corruptions from LWE in the standard model
Compact lattice gadget and its applications to hash-and-sign signatures
Secure computation with shared EPR pairs (or: how to teleport in zero-knowledge)
Traceable ring signatures: general framework and post-quantum security
SNARGs and PPAD hardness from the decisional Diffie-Hellman assumption
Ring/module learning with errors under linear leakage -- hardness and applications
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
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
Statistical ZAP arguments
Statistical Zaps and new oblivious transfer protocols
Non-interactive zero knowledge from sub-exponential DDH
Candidate obfuscation via oblivious LWE sampling
Bifurcated signatures: folding the accountability vs. anonymity dilemma into a single private signing scheme
Multiparty reusable non-interactive secure computation from LWE
A lattice-based fully dynamic group signature scheme without NIZK

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)