scientific article; zbMATH DE number 1559544
From MaRDI portal
Publication:4526993
Recommendations
Cited in
(only showing first 100 items - show all)- Improvements in the analysis of Kannan's CVP algorithm
- Integer feasibility of random polytopes: random integer programs
- New transference theorems on lattices possessing \(n^\varepsilon\)-unique shortest vectors
- Cryptographic hardness for learning intersections of halfspaces
- SoK: how (not) to design and implement post-quantum cryptography
- A Digital Signature Scheme Based on CVP ∞
- Approximation schemes via Sherali-Adams hierarchy for dense constraint satisfaction problems and assignment problems
- Tree codes and a conjecture on exponential sums
- On random nonsingular Hermite normal form
- Complexity of approximating CSP with balance / hard constraints
- An efficient and batch verifiable conditional privacy-preserving authentication scheme for VANETs using lattice
- Limits of local algorithms over sparse random graphs
- Challenges of symbolic computation: My favorite open problems. With an additional open problem by Robert M. Corless and David J. Jeffrey
- Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems
- Rigorous and Efficient Short Lattice Vectors Enumeration
- Quantum algorithm design: techniques and applications
- Analysis of error terms of signatures based on learning with errors
- scientific article; zbMATH DE number 1643917 (Why is no real title available?)
- Cryptogenography
- Roadmap of post-quantum cryptography standardization: side-channel attacks and countermeasures
- Mechanism design in large games: incentives and privacy (extended abstract)
- A fast phase-based enumeration algorithm for SVP challenge through \(y\)-sparse representations of short lattice vectors
- Lattice-based key exchange on small integer solution problem
- On a family of preimage-resistant functions
- The geometry of lattice cryptography
- Capacity of non-malleable codes
- Testers and their applications
- Deterministic compression with uncertain priors
- Black-box obfuscation for \(d\)-CNFs
- Learning mixtures of arbitrary distributions over large discrete domains
- Enhancing Goldreich, Goldwasser and Halevi's scheme with intersecting lattices
- On the Communication Complexity of Key-Agreement Protocols.
- Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification
- Chosen ciphertext attacks on lattice-based public key encryption and modern (non-quantum) cryptography in a quantum environment
- Sequential decision making with vector outcomes
- A relation of primal--dual lattices and the complexity of shortest lattice vector problem
- Decision trees, protocols and the entropy-influence conjecture
- Why do simple algorithms for triangle enumeration work in the real world?
- A parametric version of LLL and some consequences: parametric shortest and closest vector problems
- Faster private release of marginals on small databases
- Predicting Lattice Reduction
- Approximate Voronoi cells for lattices, revisited
- New lattice based cryptographic constructions
- Magnifying computing gaps. Establishing encrypted communication over unidirectional channels
- Minicrypt primitives with algebraic structure and applications
- More on average case vs approximation complexity
- Improved hardness results for unique shortest vector problem
- Hardness of LWE on general entropic distributions
- An experimental comparison of some LLL-type lattice basis reduction algorithms
- Expanders with respect to Hadamard spaces and random graphs (extended abstract)
- Searchable encryption revisited: Consistency properties, relation to anonymous IBE, and extensions
- A new transference theorem in the geometry of numbers and new bounds for Ajtai's connection factor
- Fault-injection attacks against NIST's post-quantum cryptography round 3 KEM candidates
- New lattice-based cryptographic constructions
- Candidate weak pseudorandom functions in \(\mathrm{AC}^0\circ\mathrm{MOD}_2\)
- Security analysis of cryptosystems using short generators over ideal lattices
- Algorithms for the shortest and closest lattice vector problems
- Lattice preconditioning for the real relaxation branch-and-bound approach for integer least squares problems
- Locally testable codes and Cayley graphs
- Public-key encryption from homogeneous CLWE
- A survey on post-quantum based approaches for edge computing security
- 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
- Cryptography Based on Quadratic Forms: Complexity Considerations
- Attribute-efficient evolvability of linear functions
- Lattice-based FHE as secure as PKE
- Rate-independent computation in continuous chemical reaction networks
- 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\)
- Representing hard lattices with \(O(n\log n)\) bits (extended abstract)
- Welfare maximization and truthfulness in mechanism design with ordinal preferences
- A note on perfect correctness by derandomization
- The matrix reloaded: multiplication strategies in FrodoKEM
- Private interactive communication across an adversarial channel
- Public-key cryptography and invariant theory
- PASS-encrypt: a public key cryptosystem based on partial evaluation of polynomials
- Non-commutative arithmetic circuits with division
- Finding shortest lattice vectors in the presence of gaps
- Lattice-Based Identification Schemes Secure Under Active Attacks
- Gauss sieve algorithm on GPUs
- Speeding-Up Lattice Reduction with Random Projections (Extended Abstract)
- Quantum hardness of learning shallow classical circuits
- Hardness of approximating the shortest vector problem in high \(\ell_{p}\) norms
- Better key sizes (and attacks) for LWE-based encryption
- Improved Zero-Knowledge Identification with Lattices
- Breaking the \(O(\sqrt{n})\)-bit barrier: Byzantine agreement with polylog bits per party
- Redrawing the boundaries on purchasing data from privacy-sensitive individuals
- On the limits of nonapproximability of lattice problems
- Multireference alignment using semidefinite programming
- Vandermonde meets Regev: public key encryption schemes based on partial Vandermonde problems
- Energy-efficient circuit design
- Cryptographic hardness of random local functions. Survey
- Algebraic cryptography: new constructions and their security against provable break
- Computational indistinguishability between quantum states and its cryptographic application
- Interactions of computational complexity theory and mathematics
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)
