scientific article; zbMATH DE number 1559544
From MaRDI portal
Publication:4526993
zbMATH Open0962.68055MaRDI QIDQ4526993FDOQ4526993
Authors: Miklós Ajtai, Cynthia Dwork 
Publication date: 28 February 2001
Title of this publication is not available (Why is that?)
Recommendations
Cited In (only showing first 100 items - show all)
- New transference theorems on lattices possessing \(n^\varepsilon\)-unique shortest vectors
- SoK: how (not) to design and implement post-quantum cryptography
- A Digital Signature Scheme Based on CVP ∞
- Tree codes and a conjecture on exponential sums
- Limits of local algorithms over sparse random graphs
- Complexity of approximating CSP with balance / hard constraints
- On random nonsingular Hermite normal form
- 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
- Cryptogenography
- Lattice-based key exchange on small integer solution problem
- Capacity of non-malleable codes
- Testers and their applications
- Deterministic compression with uncertain priors
- Black-box obfuscation for \(d\)-CNFs
- Sequential decision making with vector outcomes
- Chosen ciphertext attacks on lattice-based public key encryption and modern (non-quantum) cryptography in a quantum environment
- Decision trees, protocols and the entropy-influence conjecture
- Predicting Lattice Reduction
- Why do simple algorithms for triangle enumeration work in the real world?
- Decompositions of triangle-dense graphs
- A relation of primal--dual lattices and the complexity of shortest lattice vector problem
- Approximate Voronoi cells for lattices, revisited
- New lattice based cryptographic constructions
- Hardness of LWE on general entropic distributions
- Magnifying computing gaps. Establishing encrypted communication over unidirectional channels
- More on average case vs approximation complexity
- New lattice-based cryptographic constructions
- An experimental comparison of some LLL-type lattice basis reduction algorithms
- 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
- Candidate weak pseudorandom functions in \(\mathrm{AC}^0\circ\mathrm{MOD}_2\)
- Algorithms for the shortest and closest lattice vector problems
- Cryptography Based on Quadratic Forms: Complexity Considerations
- Welfare maximization and truthfulness in mechanism design with ordinal preferences
- Public-key cryptography and invariant theory
- Lattice-Based Identification Schemes Secure Under Active Attacks
- Speeding-Up Lattice Reduction with Random Projections (Extended Abstract)
- Non-commutative arithmetic circuits with division
- Finding shortest lattice vectors in the presence of gaps
- PASS-encrypt: a public key cryptosystem based on partial evaluation of polynomials
- Gauss sieve algorithm on GPUs
- Better key sizes (and attacks) for LWE-based encryption
- Multireference alignment using semidefinite programming
- On the limits of nonapproximability of lattice problems
- Energy-efficient circuit design
- Algebraic cryptography: new constructions and their security against provable break
- Cryptographic hardness of random local functions. Survey
- Linear-time encodable codes meeting the gilbert-varshamov bound and their cryptographic applications
- Cryptographic functions from worst-case complexity assumptions
- Computational indistinguishability between quantum states and its cryptographic application
- Hardness of approximating the minimum solutions of linear Diophantine equations
- Limits of random oracles in secure computation (extended abstract)
- A pseudorandom number generator based on worst-case lattice problems
- A public-key encryption scheme based on non-linear indeterminate equations
- High dimensional expanders and property testing
- A thirty year old conjecture about promise problems
- Partial tests, universal tests and decomposability
- Public-key cryptosystems from the worst-case shortest vector problem
- New Algorithms for Learning in Presence of Errors
- On the structure of Boolean functions with small spectral norm
- The Complexity of Public-Key Cryptography
- Security considerations for Galois non-dual RLWE families
- On the automorphism groups of strongly regular graphs. I
- Lower bounds on lattice sieving and information set decoding
- Building one-time memories from isolated qubits (extended abstract)
- Coordination mechanisms from (almost) all scheduling policies
- Post-quantum key exchange for the Internet and the open quantum safe project
- Rational arguments: single round delegation with sublinear verification
- Lattice Point Enumeration on Block Reduced Bases
- Approximating the SVP to within a factor \((1+1/\dim^\varepsilon)\) is NP-hard under randomized reductions
- A lattice-based public-key cryptosystem
- A note on the non-NP-hardness of approximate lattice problems under general Cook reductions.
- Integer feasibility of random polytopes: random integer programs
- Cryptographic hardness for learning intersections of halfspaces
- Approximation schemes via Sherali-Adams hierarchy for dense constraint satisfaction problems and assignment problems
- An efficient and batch verifiable conditional privacy-preserving authentication scheme for VANETs using lattice
- Analysis of error terms of signatures based on learning with errors
- Roadmap of post-quantum cryptography standardization: side-channel attacks and countermeasures
- Title not available (Why is that?)
- 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
- On a family of preimage-resistant functions
- The geometry of lattice cryptography
- On the Communication Complexity of Key-Agreement Protocols.
- Learning mixtures of arbitrary distributions over large discrete domains
- Enhancing Goldreich, Goldwasser and Halevi's scheme with intersecting lattices
- Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification
- A parametric version of LLL and some consequences: parametric shortest and closest vector problems
- Faster private release of marginals on small databases
- Minicrypt primitives with algebraic structure and applications
- Expanders with respect to Hadamard spaces and random graphs (extended abstract)
- Improved hardness results for unique shortest vector problem
- Fault-injection attacks against NIST's post-quantum cryptography round 3 KEM candidates
- Security analysis of cryptosystems using short generators over ideal lattices
- Lattice preconditioning for the real relaxation branch-and-bound approach for integer least squares problems
- Public-key encryption from homogeneous CLWE
- Locally testable codes and Cayley graphs
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)
