New lattice-based cryptographic constructions
From MaRDI portal
Recommendations
Cited in
(77)- Lattice-based key exchange on small integer solution problem
- The hunting of the SNARK
- STP-LWE: A variant of learning with error for a flexible encryption
- Quantum algorithm design: techniques and applications
- Enhancing Goldreich, Goldwasser and Halevi's scheme with intersecting lattices
- Cryptographic hardness for learning intersections of halfspaces
- Improved hardness results for unique shortest vector problem
- Finding shortest lattice vectors in the presence of gaps
- Post-quantum forward-secure onion routing (future anonymity in today's budget)
- Measure inequalities and the transference theorem in the geometry of numbers
- Discrete Gaussian leftover hash lemma over infinite domains
- A fast phase-based enumeration algorithm for SVP challenge through \(y\)-sparse representations of short lattice vectors
- Augmented Learning with Errors: The Untapped Potential of the Error Term
- 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
- Using the inhomogeneous simultaneous approximation problem for cryptographic design
- Better key sizes (and attacks) for LWE-based encryption
- Quantum algorithms for algebraic problems
- Approximating the closest vector problem using an approximate shortest vector oracle
- Authenticated Byzantine generals in dual failure model
- Trapdoors for hard lattices and new cryptographic constructions
- New lattice based cryptographic constructions
- Some Recent Progress in Lattice-Based Cryptography
- Computational indistinguishability between quantum states and its cryptographic application
- Finding significant Fourier coefficients: clarifications, simplifications, applications and limitations
- Almost Perfect Lattices, the Covering Radius Problem, and Applications to Ajtai's Connection Factor
- scientific article; zbMATH DE number 1361466 (Why is no real title available?)
- Cryptographic functions from worst-case complexity assumptions
- Curves, Jacobians, and cryptography
- Predicting Lattice Reduction
- Expanders with respect to Hadamard spaces and random graphs (extended abstract)
- Limits of local algorithms over sparse random graphs
- Deterministic compression with uncertain priors
- scientific article; zbMATH DE number 7746256 (Why is no real title available?)
- Time and Query Complexity Tradeoffs for the Dihedral Coset Problem
- An iterative correction method for practically LPN solving
- On the LWE cryptosystem with more general disturbance
- On the independence heuristic in the dual attack
- On one-way functions, the worst-case hardness of time-bounded Kolmogorov complexity, and computational depth
- \textsf{FrodoKEM}: a CCA-secure learning with errors key encapsulation mechanism
- Efficient and post-quantum conjunctive dynamic SSE with strong privacy guarantees
This page was built for publication: New lattice-based cryptographic constructions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5435669)
