scientific article; zbMATH DE number 1559544
From MaRDI portal
Publication:4526993
Recommendations
Cited in
(only showing first 100 items - show all)- Quantum hardness of learning shallow classical circuits
- Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification
- Improved Zero-Knowledge Identification with Lattices
- Approximation schemes via Sherali-Adams hierarchy for dense constraint satisfaction problems and assignment problems
- Minicrypt primitives with algebraic structure and applications
- Fault-injection attacks against NIST's post-quantum cryptography round 3 KEM candidates
- Vandermonde meets Regev: public key encryption schemes based on partial Vandermonde problems
- Private interactive communication across an adversarial channel
- A fast phase-based enumeration algorithm for SVP challenge through \(y\)-sparse representations of short lattice vectors
- Multikey fully homomorphic encryption and applications
- A note on perfect correctness by derandomization
- Gate elimination for linear functions and new feebly secure constructions
- Do Not Bound to a Single Position: Near-Optimal Multi-positional Mismatch Attacks Against Kyber and Saber
- Time and Query Complexity Tradeoffs for the Dihedral Coset Problem
- Analysis of error terms of signatures based on learning with errors
- The geometry of lattice cryptography
- Duplication free public keys based on SIS-type problems
- Single trace analysis of comparison operation based constant-time CDT sampling and its countermeasure
- Commitments with efficient zero-knowledge arguments from subset sum problems
- Explicit Hard Instances of the Shortest Vector Problem
- Improved broadcast attacks against subset sum problems via lattice oracle
- A survey on post-quantum based approaches for edge computing security
- Post-quantum cryptosystems: open problems and solutions. Lattice-based cryptosystems
- On the SVP for low-dimensional circulant lattices
- Too many hints -- when LLL breaks LWE
- A probability inequality with application to lattice theory
- A generalization of NTRUEncrypt
- Cyclic lattices, ideal lattices, and bounds for the smoothing parameter
- On the LWE cryptosystem with more general disturbance
- On the high dimensional RSA algorithm -- a public key cryptosystem based on lattice and algebraic number theory
- Roadmap of post-quantum cryptography standardization: side-channel attacks and countermeasures
- Improved analysis of the reduction from BDD to uSVP
- Circuit complexity of linear functions: gate elimination and feeble security
- Lattice-based FHE as secure as PKE
- Rate-independent computation in continuous chemical reaction networks
- On codes and learning with errors over function fields
- scientific article; zbMATH DE number 1643917 (Why is no real title available?)
- A parametric version of LLL and some consequences: parametric shortest and closest vector problems
- On the Communication Complexity of Key-Agreement Protocols.
- Generalized learning problems and applications to non-commutative cryptography. (Extended abstract)
- Adversarial hypothesis testing and a quantum Stein's lemma for restricted measurements (extended abstract)
- Iterated group products and leakage resilience against \(\mathrm{NC}^1\)
- Security analysis of cryptosystems using short generators over ideal lattices
- Hardness of approximating the shortest vector problem in high \(\ell_{p}\) norms
- Learning mixtures of arbitrary distributions over large discrete domains
- Interactions of computational complexity theory and mathematics
- Expanders with respect to Hadamard spaces and random graphs (extended abstract)
- Redrawing the boundaries on purchasing data from privacy-sensitive individuals
- Lattice preconditioning for the real relaxation branch-and-bound approach for integer least squares problems
- Public-key encryption from homogeneous CLWE
- Parameterized intractability of even set and shortest vector problem from Gap-ETH
- Direct sum fails for zero error average communication
- Invitation games and the price of stability
- Parameterized testability
- Faster private release of marginals on small databases
- Enhancing Goldreich, Goldwasser and Halevi's scheme with intersecting lattices
- On the unique shortest lattice vector problem
- Locally testable codes and Cayley graphs
- An efficient and batch verifiable conditional privacy-preserving authentication scheme for VANETs using lattice
- A note on perfect correctness by derandomization
- Homomorphic encryption: a mathematical survey
- On a family of preimage-resistant functions
- The matrix reloaded: multiplication strategies in FrodoKEM
- Improved hardness results for unique shortest vector problem
- Improvements in the analysis of Kannan's CVP algorithm
- Representing hard lattices with \(O(n\log n)\) bits (extended abstract)
- Breaking the \(O(\sqrt{n})\)-bit barrier: Byzantine agreement with polylog bits per party
- Hardness of approximating the minimum solutions of linear Diophantine equations
- Candidate weak pseudorandom functions in \(\mathrm{AC}^0\circ\mathrm{MOD}_2\)
- Quantum algorithm design: techniques and applications
- Hardness of LWE on general entropic distributions
- A note on the non-NP-hardness of approximate lattice problems under general Cook reductions.
- Mechanism design in large games: incentives and privacy (extended abstract)
- Finding shortest lattice vectors in the presence of gaps
- New transference theorems on lattices possessing \(n^\varepsilon\)-unique shortest vectors
- Tree codes and a conjecture on exponential sums
- A lattice-based public-key cryptosystem
- Magnifying computing gaps. Establishing encrypted communication over unidirectional channels
- PASS-encrypt: a public key cryptosystem based on partial evaluation of polynomials
- More on average case vs approximation complexity
- Better key sizes (and attacks) for LWE-based encryption
- Post-quantum key exchange for the Internet and the open quantum safe project
- On the limits of nonapproximability of lattice problems
- New Algorithms for Learning in Presence of Errors
- Security considerations for Galois non-dual RLWE families
- Challenges of symbolic computation: My favorite open problems. With an additional open problem by Robert M. Corless and David J. Jeffrey
- Sequential decision making with vector outcomes
- Energy-efficient circuit design
- Limits of local algorithms over sparse random graphs
- Gauss sieve algorithm on GPUs
- On the automorphism groups of strongly regular graphs. I
- New lattice-based cryptographic constructions
- Complexity of approximating CSP with balance / hard constraints
- Rational arguments: single round delegation with sublinear verification
- SoK: how (not) to design and implement post-quantum cryptography
- Approximate Voronoi cells for lattices, revisited
- Public-key cryptography and invariant theory
- Algebraic cryptography: new constructions and their security against provable break
- Linear-time encodable codes meeting the gilbert-varshamov bound and their cryptographic applications
- Lower bounds on lattice sieving and information set decoding
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4526993)
