The following pages link to Daniele Micciancio (Q814417):
Displaying 50 items.
- The complexity of the covering radius problem (Q814418) (← links)
- (Q1606964) (redirect page) (← links)
- Approximating shortest lattice vectors is not harder than approximating closest lattice vectors (Q1606967) (← links)
- On the bit security of cryptographic primitives (Q1648779) (← links)
- Faster Gaussian sampling for trapdoor lattices with arbitrary modulus (Q1648788) (← links)
- Gaussian sampling over the integers: efficient, generic, constant-time (Q1680223) (← links)
- Equational security proofs of oblivious transfer protocols (Q1749300) (← links)
- A note on the minimal volume of almost cubic parallelepipeds (Q1864132) (← links)
- The inapproximability of lattice and coding problems with preprocessing (Q1881262) (← links)
- On the security of homomorphic encryption on approximate numbers (Q2056709) (← links)
- Homomorphic encryption for finite automata (Q2176661) (← links)
- The RSA group is pseudo-free (Q2267366) (← links)
- Symbolic encryption with pseudorandom keys (Q2292686) (← links)
- Building an efficient lattice gadget toolkit: Subgaussian sampling and more (Q2292888) (← links)
- Asymptotically efficient lattice-based digital signatures (Q2413615) (← links)
- Generalized compact knapsacks, cyclic lattices, and efficient one-way functions (Q2475579) (← links)
- Simpler statistically sender private oblivious transfer from ideals of cyclotomic integers (Q2692389) (← links)
- The Shortest Vector in a Lattice is Hard to Approximate to within Some Constant (Q2719121) (← links)
- Practical, Predictable Lattice Basis Reduction (Q2820509) (← links)
- Hardness of SIS and LWE with Small Parameters (Q2845658) (← links)
- A Deterministic Single Exponential Time Algorithm for Most Lattice Problems Based on Voronoi Cell Computations (Q2848225) (← links)
- Improved Short Lattice Signatures in the Standard Model (Q2874513) (← links)
- A deterministic single exponential time algorithm for most lattice problems based on voronoi cell computations (Q2875162) (← links)
- Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller (Q2894439) (← links)
- (Q2913823) (← links)
- FHEW: Bootstrapping Homomorphic Encryption in Less Than a Second (Q2948346) (← links)
- A linear space algorithm for computing the hermite normal form (Q2958938) (← links)
- An equational approach to secure multi-party computation (Q2986886) (← links)
- The Geometry of Lattice Cryptography (Q3092183) (← links)
- Compactness vs Collusion Resistance in Functional Encryption (Q3181036) (← links)
- On Bounded Distance Decoding, Unique Shortest Vectors, and the Minimum Distance Problem (Q3183586) (← links)
- SWIFFT: A Modest Proposal for FFT Hashing (Q3525661) (← links)
- Computational Soundness, Co-induction, and Encryption Cycles (Q3563845) (← links)
- Improved cryptographic hash functions with worst-case/average-case connection (Q3579190) (← links)
- (Q3579369) (← links)
- Corrupting One vs. Corrupting Many: The Case of Broadcast and Multicast Encryption (Q3591436) (← links)
- Generalized Compact Knapsacks Are Collision Resistant (Q3591445) (← links)
- On Bounded Distance Decoding for General Lattices (Q3595403) (← links)
- Lattice-based Cryptography (Q3613268) (← links)
- (Q4364558) (← links)
- The Provable Security of Graph-Based One-Time Signatures and Extensions to Algebraic Signature Schemes (Q4412810) (← links)
- (Q4434873) (← links)
- (Q4434902) (← links)
- (Q4527013) (← links)
- (Q4542530) (← links)
- The hardness of the closest vector problem with preprocessing (Q4544560) (← links)
- (Q4612477) (← links)
- Almost Perfect Lattices, the Covering Radius Problem, and Applications to Ajtai's Connection Factor (Q4651529) (← links)
- Hardness of approximating the minimum distance of a linear code (Q4679877) (← links)
- (Q4737232) (← links)
