scientific article; zbMATH DE number 1559544
From MaRDI portal
Publication:4526993
Recommendations
Cited in
(only showing first 100 items - show all)- 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
- Public-key cryptosystems from the worst-case shortest vector problem
- Capacity of non-malleable codes
- Lattice Point Enumeration on Block Reduced Bases
- Attribute-efficient evolvability of linear functions
- A thirty year old conjecture about promise problems
- Integer feasibility of random polytopes: random integer programs
- Algorithms for the shortest and closest lattice vector problems
- New lattice based cryptographic constructions
- Testers and their applications
- Limits of random oracles in secure computation (extended abstract)
- Building one-time memories from isolated qubits (extended abstract)
- Lattice-based key exchange on small integer solution problem
- Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems
- Cryptographic functions from worst-case complexity assumptions
- 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
- Black-box obfuscation for \(d\)-CNFs
- A Digital Signature Scheme Based on CVP ∞
- Computational indistinguishability between quantum states and its cryptographic application
- Coordination mechanisms from (almost) all scheduling policies
- Deterministic compression with uncertain priors
- An experimental comparison of some LLL-type lattice basis reduction algorithms
- Rigorous and Efficient Short Lattice Vectors Enumeration
- A pseudorandom number generator based on worst-case lattice problems
- Predicting Lattice Reduction
- Why do simple algorithms for triangle enumeration work in the real world?
- Welfare maximization and truthfulness in mechanism design with ordinal preferences
- Searchable encryption revisited: Consistency properties, relation to anonymous IBE, and extensions
- Cryptography Based on Quadratic Forms: Complexity Considerations
- Lattice-Based Identification Schemes Secure Under Active Attacks
- Approximating the SVP to within a factor \((1+1/\dim^\varepsilon)\) is NP-hard under randomized reductions
- Cryptogenography
- Cryptographic hardness of random local functions. Survey
- The Complexity of Public-Key Cryptography
- Speeding-Up Lattice Reduction with Random Projections (Extended Abstract)
- A new transference theorem in the geometry of numbers and new bounds for Ajtai's connection factor
- On random nonsingular Hermite normal form
- Non-commutative arithmetic circuits with division
- Multireference alignment using semidefinite programming
- Partial tests, universal tests and decomposability
- High dimensional expanders and property testing
- A public-key encryption scheme based on non-linear indeterminate equations
- A relation of primal--dual lattices and the complexity of shortest lattice vector problem
- Cryptographic hardness for learning intersections of halfspaces
- 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
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)
