Pseudorandom knapsacks and the sample complexity of LWE search-to-decision reductions
From MaRDI portal
(Redirected from Publication:5199207)
Recommendations
- Pseudorandomness of ring-LWE for any ring and modulus
- On the hardness of learning with errors with binary secrets
- Generalized compact knapsacks, cyclic lattices, and efficient one-way functions
- Classical hardness of learning with errors
- Lossy codes and a new variant of the learning-with-errors problem
Cited in
(only showing first 100 items - show all)- On the tightness of forward-secure signature reductions
- A lattice-based group signature scheme with verifier-local revocation
- Improved security proofs in lattice-based cryptography: using the Rényi divergence rather than the statistical distance
- Verifiable single-server private information retrieval from LWE with binary errors
- Multiparty reusable non-interactive secure computation from LWE
- Shorter lattice-based zero-knowledge proofs via one-time commitments
- Rounding in the rings
- Hardness of LWE on general entropic distributions
- Key-homomorphic pseudorandom functions from LWE with small modulus
- Vandermonde meets Regev: public key encryption schemes based on partial Vandermonde problems
- Obfuscated fuzzy Hamming distance and conjunctions from subset product problems
- Lattice-based group signatures: achieving full dynamicity (and deniability) with ease
- Tightly secure signature schemes from the LWE and subset sum assumptions
- Naor-Yung paradigm with shared randomness and applications
- On the hardness of module learning with errors with short distributions
- Cryptographic group actions and applications
- On the hardness of learning with rounding over small modulus
- How (not) to instantiate ring-LWE
- Fully secure functional encryption for inner products, from standard assumptions
- Circuit-ABE from LWE: Unbounded Attributes and Semi-adaptive Security
- Lattice-based fully dynamic multi-key FHE with short ciphertexts
- Cryptography with auxiliary input and trapdoor from constant-noise LPN
- Lattice-based FHE as secure as PKE
- Cryptogenography
- Limits of random oracles in secure computation (extended abstract)
- Non-commutative arithmetic circuits with division
- Decision trees, protocols and the entropy-influence conjecture
- Locally testable codes and Cayley graphs
- Invitation games and the price of stability
- Welfare maximization and truthfulness in mechanism design with ordinal preferences
- Coordination mechanisms from (almost) all scheduling policies
- Private interactive communication across an adversarial channel
- Tree codes and a conjecture on exponential sums
- Capacity of non-malleable codes
- Linear-time encodable codes meeting the gilbert-varshamov bound and their cryptographic applications
- Adversarial hypothesis testing and a quantum Stein's lemma for restricted measurements (extended abstract)
- Sequential decision making with vector outcomes
- Learning mixtures of arbitrary distributions over large discrete domains
- Why do simple algorithms for triangle enumeration work in the real world?
- Black-box obfuscation for \(d\)-CNFs
- Candidate weak pseudorandom functions in \(\mathrm{AC}^0\circ\mathrm{MOD}_2\)
- Iterated group products and leakage resilience against \(\mathrm{NC}^1\)
- Building one-time memories from isolated qubits (extended abstract)
- Attribute-efficient evolvability of linear functions
- Energy-efficient circuit design
- Rate-independent computation in continuous chemical reaction networks
- Testers and their applications
- On the automorphism groups of strongly regular graphs. I
- Faster private release of marginals on small databases
- Mechanism design in large games: incentives and privacy (extended abstract)
- Redrawing the boundaries on purchasing data from privacy-sensitive individuals
- Approximation schemes via Sherali-Adams hierarchy for dense constraint satisfaction problems and assignment problems
- Complexity of approximating CSP with balance / hard constraints
- Integer feasibility of random polytopes: random integer programs
- Multireference alignment using semidefinite programming
- Partial tests, universal tests and decomposability
- High dimensional expanders and property testing
- Parameterized testability
- Direct sum fails for zero error average communication
- Rational arguments: single round delegation with sublinear verification
- The geometry of lattice cryptography
- Tightly secure signatures from lossy identification schemes
- Approximate-deterministic public key encryption from hard learning problems
- Deniable Attribute Based Encryption for Branching Programs from LWE
- Targeted homomorphic attribute-based encryption
- On the hardness of learning with errors with binary secrets
- Tighter Reductions for Forward-Secure Signature Schemes
- Almost tight security in lattices with polynomial moduli -- PRF, IBE, all-but-many LTF, and more
- Pseudo-free families of finite computational elementary abelian \(p\)-groups
- Private puncturable PRFs from standard lattice assumptions
- Expanders with respect to Hadamard spaces and random graphs (extended abstract)
- Limits of local algorithms over sparse random graphs
- Deterministic compression with uncertain priors
- Watermarking cryptographic functionalities from standard lattice assumptions
- Multi-theorem preprocessing NIZKs from lattices
- Lattice-based accumulator with constant time list update and constant time verification
- Zero-knowledge arguments for lattice-based accumulators: logarithmic-size ring signatures and group signatures without trapdoors
- Candidate witness encryption from lattice techniques
- Quantum search-to-decision reduction for the LWE problem
- A detailed analysis of Fiat-Shamir with aborts
- Almost tight multi-user security under adaptive corruptions from LWE in the standard model
- Indistinguishability obfuscation
- Lattice-Based Group Signatures: Achieving Full Dynamicity with Ease
- Lattice-Based DAPS and Generalizations: Self-enforcement in Signature Schemes
- Quantum-Resistant 1-out-of-N Oblivious Signatures from Lattices
- Small Superset and Big Subset Obfuscation
- Optimizing Bootstrapping and Evaluating Large FHE Gates in the LWE-Based GSW-FHE
- Spherical Gaussian leftover hash lemma via the Rényi divergence
- The Boneh-Katz transformation, revisited: pseudorandom/obliviously-samplable PKE from lattices and codes and its application
- SoK: learning with errors, circular security, and fully homomorphic encryption
- The hardness of LPN over any integer ring and field for PCG applications
- Improved alternating-moduli PRFs and post-quantum signatures
- FE for inner products and its application to multi-authority ABE
- Post-quantum PKE from unstructured noisy linear algebraic assumptions: beyond LWE and Alekhnovich's LPN
- Discrete Gaussians modulo sub-lattices: new leftover hash lemmas for discrete Gaussians
- Low communication threshold fully homomorphic encryption
- Indistinguishability obfuscation from well-founded assumptions
- Revisiting the robustness of (R/M)LWR under polynomial moduli with its applications
- Leftover hash lemma(s) over cyclotomic rings
- Cool + cruel = dual, and new benchmarks for sparse LWE
This page was built for publication: Pseudorandom knapsacks and the sample complexity of LWE search-to-decision reductions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5199207)
