| 2008 |
|---|
| 64 | EE | Vadim Lyubashevsky,
Daniele Micciancio,
Chris Peikert,
Alon Rosen:
SWIFFT: A Modest Proposal for FFT Hashing.
FSE 2008: 54-72 |
| 63 | EE | Alejandro Hevia,
Daniele Micciancio:
An Indistinguishability-Based Characterization of Anonymous Channels.
Privacy Enhancing Technologies 2008: 24-43 |
| 62 | EE | Daniele Micciancio:
Efficient reductions among lattice problems.
SODA 2008: 84-93 |
| 61 | EE | Vadim Lyubashevsky,
Daniele Micciancio:
Asymptotically Efficient Lattice-Based Digital Signatures.
TCC 2008: 37-54 |
| 60 | EE | Daniele Micciancio,
Scott Yilek:
The Round-Complexity of Black-Box Zero-Knowledge: A Combinatorial Characterization.
TCC 2008: 535-552 |
| 59 | EE | Daniele Micciancio:
Shortest Vector Problem.
Encyclopedia of Algorithms 2008 |
| 58 | EE | Daniele Micciancio,
Saurabh Panjwani:
Optimal communication complexity of generic multicast key distribution.
IEEE/ACM Trans. Netw. 16(4): 803-813 (2008) |
| 2007 |
|---|
| 57 | EE | Daniele Micciancio:
Generalized Compact Knapsacks, Cyclic Lattices, and Efficient One-Way Functions.
Computational Complexity 16(4): 365-411 (2007) |
| 56 | EE | Daniele Micciancio,
Oded Regev:
Worst-Case to Average-Case Reductions Based on Gaussian Measures.
SIAM J. Comput. 37(1): 267-302 (2007) |
| 2006 |
|---|
| 55 | EE | Yi-Kai Liu,
Vadim Lyubashevsky,
Daniele Micciancio:
On Bounded Distance Decoding for General Lattices.
APPROX-RANDOM 2006: 450-461 |
| 54 | EE | Vadim Lyubashevsky,
Daniele Micciancio:
Generalized Compact Knapsacks Are Collision Resistant.
ICALP (2) 2006: 144-155 |
| 53 | EE | Daniele Micciancio,
Saurabh Panjwani:
Corrupting One vs. Corrupting Many: The Case of Broadcast and Multicast Encryption.
ICALP (2) 2006: 70-82 |
| 52 | EE | Daniele Micciancio,
Shien Jin Ong,
Amit Sahai,
Salil P. Vadhan:
Concurrent Zero Knowledge Without Complexity Assumptions.
TCC 2006: 1-20 |
| 51 | EE | Chandra Chekuri,
Daniele Micciancio:
Special Issue: FOCS 2003.
J. Comput. Syst. Sci. 72(2): 205 (2006) |
| 2005 |
|---|
| 50 | EE | Daniele Micciancio:
The RSA Group is Pseudo-Free.
EUROCRYPT 2005: 387-403 |
| 49 | EE | Alejandro Hevia,
Daniele Micciancio:
Simultaneous broadcast revisited.
PODC 2005: 324-333 |
| 48 | EE | Daniele Micciancio,
Saurabh Panjwani:
Adaptive Security of Symbolic Encryption.
TCC 2005: 169-187 |
| 47 | EE | Daniele Micciancio:
Closest Vector Problem.
Encyclopedia of Cryptography and Security 2005 |
| 46 | EE | Daniele Micciancio:
Lattice Based Cryptography.
Encyclopedia of Cryptography and Security 2005 |
| 45 | EE | Daniele Micciancio:
Shortest Vector Problem.
Encyclopedia of Cryptography and Security 2005 |
| 44 | EE | Venkatesan Guruswami,
Daniele Micciancio,
Oded Regev:
The complexity of the covering radius problem.
Computational Complexity 14(2): 90-121 (2005) |
| 43 | EE | Daniele Micciancio,
Shien Jin Ong,
Amit Sahai,
Salil P. Vadhan:
Concurrent Zero Knowledge without Complexity Assumptions
Electronic Colloquium on Computational Complexity (ECCC)(093): (2005) |
| 42 | EE | Vadim Lyubashevsky,
Daniele Micciancio:
Generalized Compact Knapsacks are Collision Resistant
Electronic Colloquium on Computational Complexity (ECCC)(142): (2005) |
| 2004 |
|---|
| 41 | EE | Daniele Micciancio,
Saurabh Panjwani:
Optimal Communication Complexity of Generic Multicast Key Distribution.
EUROCRYPT 2004: 153-170 |
| 40 | EE | Daniele Micciancio,
Oded Regev:
Worst-Case to Average-Case Reductions Based on Gaussian Measures.
FOCS 2004: 372-381 |
| 39 | EE | Venkatesan Guruswami,
Daniele Micciancio,
Oded Regev:
The Complexity of the Covering Radius Problem on Lattices and Codes.
IEEE Conference on Computational Complexity 2004: 161-173 |
| 38 | EE | Daniele Micciancio,
Bogdan Warinschi:
Soundness of Formal Encryption in the Presence of Active Adversaries.
TCC 2004: 133-151 |
| 37 | EE | Daniele Micciancio:
Generalized compact knapsacks, cyclic lattices, and efficient one-way functions from worst-case complexity assumptions
Electronic Colloquium on Computational Complexity (ECCC)(095): (2004) |
| 36 | EE | Uriel Feige,
Daniele Micciancio:
The inapproximability of lattice and coding problems with preprocessing.
J. Comput. Syst. Sci. 69(1): 45-67 (2004) |
| 35 | | Daniele Micciancio,
Bogdan Warinschi:
Completeness Theorems for the Abadi-Rogaway Language of Encrypted Expressions.
Journal of Computer Security 12(1): 99-130 (2004) |
| 34 | EE | Daniele Micciancio:
Almost Perfect Lattices, the Covering Radius Problem, and Applications to Ajtai's Connection Factor.
SIAM J. Comput. 34(1): 118-169 (2004) |
| 2003 |
|---|
| 33 | EE | Daniele Micciancio,
Salil P. Vadhan:
Statistical Zero-Knowledge Proofs with Efficient Provers: Lattice Problems and More.
CRYPTO 2003: 282-298 |
| 32 | EE | Daniele Micciancio,
Erez Petrank:
Simulatable Commitments and Efficient Concurrent Zero-Knowledge.
EUROCRYPT 2003: 140-159 |
| 31 | EE | Mihir Bellare,
Daniele Micciancio,
Bogdan Warinschi:
Foundations of Group Signatures: Formal Definitions, Simplified Requirements, and a Construction Based on General Assumptions.
EUROCRYPT 2003: 614-629 |
| 30 | EE | Daniele Micciancio:
A Note on the Minimal Volume of Almost Cubic Parallelepipeds.
Discrete & Computational Geometry 29(1): 133-138 (2003) |
| 29 | EE | Daniele Micciancio:
Almost perfect lattices, the covering radius problem, and applications to Ajtai's connection factor
Electronic Colloquium on Computational Complexity (ECCC)(066): (2003) |
| 28 | | Ilya Dumer,
Daniele Micciancio,
Madhu Sudan:
Hardness of approximating the minimum distance of a linear code.
IEEE Transactions on Information Theory 49(1): 22-37 (2003) |
| 2002 |
|---|
| 27 | EE | Alejandro Hevia,
Daniele Micciancio:
The Provable Security of Graph-Based One-Time Signatures and Extensions to Algebraic Signature Schemes.
ASIACRYPT 2002: 379-396 |
| 26 | EE | Rosario Gennaro,
Daniele Micciancio:
Cryptanalysis of a Pseudorandom Generator Based on Braid Groups.
EUROCRYPT 2002: 1-13 |
| 25 | EE | Tal Malkin,
Daniele Micciancio,
Sara K. Miner:
Efficient Generic Forward-Secure Signatures with an Unbounded Number Of Time Periods.
EUROCRYPT 2002: 400-417 |
| 24 | EE | Daniele Micciancio:
Generalized Compact Knapsacks, Cyclic Lattices, and Efficient One-Way Functions from Worst-Case Complexity Assumptions.
FOCS 2002: 356-365 |
| 23 | EE | Uriel Feige,
Daniele Micciancio:
The Inapproximability of Lattice and Coding Problems with Preprocessing.
IEEE Conference on Computational Complexity 2002: 44-52 |
| 22 | EE | Daniele Micciancio:
Improved Cryptographic Hash Functions with Worst-Case/Average-Case Connection.
IEEE Conference on Computational Complexity 2002: 9 |
| 21 | EE | Daniele Micciancio:
Improved cryptographic hash functions with worst-case/average-case connection.
STOC 2002: 609-618 |
| 20 | EE | Daniele Micciancio,
Erez Petrank:
Efficient and Concurrent Zero-Knowledge from any public coin HVZK protocol
Electronic Colloquium on Computational Complexity (ECCC)(045): (2002) |
| 2001 |
|---|
| 19 | EE | Daniele Micciancio:
Improving Lattice Based Cryptosystems Using the Hermite Normal Form.
CaLC 2001: 126-145 |
| 18 | EE | Daniele Micciancio,
Bogdan Warinschi:
A linear space algorithm for computing the herite normal form.
ISSAC 2001: 231-236 |
| 17 | | Daniele Micciancio:
The hardness of the closest vector problem with preprocessing.
IEEE Transactions on Information Theory 47(3): 1212-1215 (2001) |
| 2000 |
|---|
| 16 | EE | Daniele Micciancio,
Bogdan Warinschi:
A Linear Space Algorithm for Computing the Hermite Normal Form
Electronic Colloquium on Computational Complexity (ECCC) 7(74): (2000) |
| 15 | EE | Daniele Micciancio:
The Shortest Vector in a Lattice is Hard to Approximate to within Some Constant.
SIAM J. Comput. 30(6): 2008-2035 (2000) |
| 1999 |
|---|
| 14 | EE | Ilya Dumer,
Daniele Micciancio,
Madhu Sudan:
Hardness of Approximating the Minimum Distance of a Linear Code.
FOCS 1999: 475-485 |
| 13 | | Ran Canetti,
Juan A. Garay,
Gene Itkis,
Daniele Micciancio,
Moni Naor,
Benny Pinkas:
Multicast Security: A Taxonomy and Some Efficient Constructions.
INFOCOM 1999: 708-716 |
| 12 | EE | Oded Goldreich,
Daniele Micciancio,
Shmuel Safra,
Jean-Pierre Seifert:
Approximating Shortest Lattice Vectors is Not Harder Than Approximating Closest Lattice Vectors.
Electronic Colloquium on Computational Complexity (ECCC) 6(2): (1999) |
| 11 | EE | Ilya Dumer,
Daniele Micciancio,
Madhu Sudan:
Hardness of Approximating the Minimum Distance of a Linear Code
Electronic Colloquium on Computational Complexity (ECCC) 6(29): (1999) |
| 10 | EE | Oded Goldreich,
Daniele Micciancio,
Shmuel Safra,
Jean-Pierre Seifert:
Approximating Shortest Lattice Vectors is not Harder than Approximating Closest Lattice Vectors.
Inf. Process. Lett. 71(2): 55-61 (1999) |
| 1998 |
|---|
| 9 | EE | Rosario Gennaro,
Daniele Micciancio,
Tal Rabin:
An Efficient Non-Interactive Statistical Zero-Knowledge Proof System for Quasi-Safe Prime Products.
ACM Conference on Computer and Communications Security 1998: 67-72 |
| 8 | EE | Daniele Micciancio:
The Shortest Vector in a Lattice is Hard to Approximate to Within Some Constant.
FOCS 1998: 92-98 |
| 7 | EE | Ran Canetti,
Daniele Micciancio,
Omer Reingold:
Perfectly One-Way Probabilistic Hash Functions (Preliminary Version).
STOC 1998: 131-140 |
| 6 | EE | Daniele Micciancio:
The Shortest Vector in a Lattice is Hard to Approximate to within Some Constant.
Electronic Colloquium on Computational Complexity (ECCC) 5(16): (1998) |
| 1997 |
|---|
| 5 | EE | Mihir Bellare,
Shafi Goldwasser,
Daniele Micciancio:
"Pseudo-Random" Number Generation Within Cryptographic Algorithms: The DDS Case.
CRYPTO 1997: 277-291 |
| 4 | EE | Mihir Bellare,
Daniele Micciancio:
A New Paradigm for Collision-Free Hashing: Incrementality at Reduced Cost.
EUROCRYPT 1997: 163-192 |
| 3 | EE | Daniele Micciancio:
Oblivious Data Structures: Applications to Cryptography.
STOC 1997: 456-464 |
| 2 | | Sabrina Mantaci,
Daniele Micciancio:
An Algorithm for the Solution of Tree Equations.
TAPSOFT 1997: 417-428 |
| 1995 |
|---|
| 1 | | Giorgio Levi,
Daniele Micciancio:
Analysis of Pure PROLOG Programs.
GULP-PRODE 1995: 521-532 |
