scientific article; zbMATH DE number 1559544
From MaRDI portal
Publication:4526993
Recommendations
Cited in
(only showing first 100 items - show all)- Searchable encryption revisited: Consistency properties, relation to anonymous IBE, and extensions
- Hardness of approximating the minimum solutions of linear Diophantine equations
- Worst-case complexity, average-case complexity and lattice problems
- A relation of primal--dual lattices and the complexity of shortest lattice vector problem
- On the limits of nonapproximability of lattice problems
- Challenges of symbolic computation: My favorite open problems. With an additional open problem by Robert M. Corless and David J. Jeffrey
- A note on the non-NP-hardness of approximate lattice problems under general Cook reductions.
- Lattice-based key exchange on small integer solution problem
- A pseudorandom number generator based on worst-case lattice problems
- Post-quantum key exchange for the Internet and the open quantum safe project
- Security considerations for Galois non-dual RLWE families
- Quantum algorithm design: techniques and applications
- A public-key encryption scheme based on non-linear indeterminate equations
- Security analysis of cryptosystems using short generators over ideal lattices
- A lattice-based public-key cryptosystem
- A new transference theorem in the geometry of numbers and new bounds for Ajtai's connection factor
- Circuit complexity of linear functions: gate elimination and feeble security
- Approximating the SVP to within a factor \((1+1/\dim^\varepsilon)\) is NP-hard under randomized reductions
- Enhancing Goldreich, Goldwasser and Halevi's scheme with intersecting lattices
- Approximate Voronoi cells for lattices, revisited
- Hardness of LWE on general entropic distributions
- Lower bounds on lattice sieving and information set decoding
- A note on perfect correctness by derandomization
- The matrix reloaded: multiplication strategies in FrodoKEM
- Vandermonde meets Regev: public key encryption schemes based on partial Vandermonde problems
- Improved broadcast attacks against subset sum problems via lattice oracle
- An efficient and batch verifiable conditional privacy-preserving authentication scheme for VANETs using lattice
- Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification
- Lattice preconditioning for the real relaxation branch-and-bound approach for integer least squares problems
- Duplication free public keys based on SIS-type problems
- Improved analysis of the reduction from BDD to uSVP
- Hardness of approximating the shortest vector problem in high \(\ell_{p}\) norms
- Cryptographic hardness for learning intersections of halfspaces
- Public-key cryptography and invariant theory
- Improved hardness results for unique shortest vector problem
- On random nonsingular Hermite normal form
- scientific article; zbMATH DE number 1643917 (Why is no real title available?)
- Finding shortest lattice vectors in the presence of gaps
- Magnifying computing gaps. Establishing encrypted communication over unidirectional channels
- A fast phase-based enumeration algorithm for SVP challenge through \(y\)-sparse representations of short lattice vectors
- Lattice Point Enumeration on Block Reduced Bases
- Gauss sieve algorithm on GPUs
- Analysis of error terms of signatures based on learning with errors
- 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
- Algorithms for the shortest and closest lattice vector problems
- Gate elimination for linear functions and new feebly secure constructions
- New Algorithms for Learning in Presence of Errors
- Better key sizes (and attacks) for LWE-based encryption
- On a family of preimage-resistant functions
- Algebraic cryptography: new constructions and their security against provable break
- The geometry of lattice cryptography
- Generalized learning problems and applications to non-commutative cryptography. (Extended abstract)
- Cryptographic hardness of random local functions. Survey
- A thirty year old conjecture about promise problems
- Explicit Hard Instances of the Shortest Vector Problem
- New lattice based cryptographic constructions
- Representing hard lattices with O(n n) bits (extended abstract)
- Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems
- Rigorous and Efficient Short Lattice Vectors Enumeration
- New transference theorems on lattices possessing \(n^\varepsilon\)-unique shortest vectors
- scientific article; zbMATH DE number 1304121 (Why is no real title available?)
- More on average case vs approximation complexity
- Computational indistinguishability between quantum states and its cryptographic application
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)
