- An Ecient Non-Interactive Statistical Zero-Knowledge Proof System
- Approximating shortest lattice vectors is not harder than approximating closest lattice vectors #
- 1. BASICS 1 1 Lattices 1
- Hardness of Approximating the Minimum Distance of a Linear Daniele Micciancio
- Lattice Based Cryptography Daniele Micciancio, University of California, San Diego
- Approximating shortest lattice vectors is not harder than approximating closest lattice vectors
- The Hardness of the Closest Vector Problem with Preprocessing Daniele Micciancio
- A note on the minimal volume of almost cubic parallelepipeds Daniele Micciancio
- Shortest Vector Problem (1982; Lenstra, Lenstra, Lovasz) Daniele Micciancio, University of California at San Diego, www.cs.ucsd.edu/~daniele
- Concurrent Zero Knowledge without Complexity Assumptions #
- Closest Vector Problem Daniele Micciancio, University of California, San Diego
- Statistical zero-knowledge proofs with ecient provers: lattice problems and more
- Shortest Vector Problem (1982; Lenstra, Lenstra, Lovasz) Daniele Micciancio, University of California at San Diego, www.cs.ucsd.edu/daniele
- Cryptographic functions from worstcase complexity assumptions Daniele Micciancio #
- The Shortest Vector in a Lattice is Hard to Approximate to within Some Constant #
- Simulatable Commitments and Ecient Concurrent Zero-Knowledge
- Appears in Advances in Cryptology { Crypto 97 Proceedings, Lecture Notes in Computer Science Vol. 1294, B. Kaliski ed., Springer-Verlag, 1997.
- A Deterministic Single Exponential Time Algorithm for Most Lattice Problems based on Voronoi Cell Computations
- Completeness Theorems for the Abadi-Rogaway Language of Encrypted Expressions
- The inapproximability of lattice and coding problems with preprocessing
- Lattice Based Cryptography Daniele Micciancio, University of California, San Diego
- Hardness of Approximating the Minimum Distance of a Linear Ilya Dumer + Daniele Micciancio # Madhu Sudan
- Adaptive Security of Symbolic Encryption # Daniele Micciancio Saurabh Panjwani
- Generalized Compact Knapsacks are Collision Resistant # Vadim Lyubashevsky Daniele Micciancio
- Latticebased Cryptography # Daniele Micciancio + Oded Regev #
- Oblivious Data Structures: Applications to Cryptography Daniele Micciancio
- Closest Vector Problem Daniele Micciancio, University of California, San Diego
- Soundness of Formal Encryption in the Presence of Active Adversaries ?
- The Shortest Vector in a Lattice is Hard to Approximate to within Some Constant
- An abridged version of this paper appears in Advances in Cryptology { Eurocrypt 97 Proceedings, Lecture Notes in Computer Science Vol. ??, W. Fumy ed., Springer-Verlag, 1997.
- Cryptanalysis of a Pseudorandom Generator Based on Braid Groups ?
- A Linear Space Algorithm for Computing the Hermite Normal Form
- THE COMPLEXITY OF THE COVERING RADIUS PROBLEM
- Computational soundness, co-induction, and encryption cycles Daniele Micciancio
- The Hardness of the Closest Vector Problem with Preprocessing # Daniele Micciancio +
- Faster exponential time algorithms for the shortest vector problem Daniele Micciancio Panagiotis Voulgaris
- This book is about algorithmic problems on point lattices, and their computational complexity. In this chapter we give some background
- Multicast Security: A Taxonomy and Some Efficient Constructions
- Perfectly One-Way Probabilistic Hash Functions (Preliminary Version)
- Improving Lattice Based Cryptosystems Using the Hermite Normal Form
- A note on the minimal volume of almost cubic parallelepipeds #+ Daniele Micciancio #
- Optimal Communication Complexity of Generic Multicast Key Distribution #
- Ecient Generic Forward-Secure Signatures With An Unbounded Number Of Time Periods ?
- Multicast Security: A Taxonomy and Some Efficient Constructions
- Almost perfect lattices, the covering radius problem, and applications to Ajtai's connection factor
- The Geometry of Lattice Cryptography Daniele Micciancio
- Algorithms for the Densest Sub-Lattice Problem Daniel Dadush