sign in · help · news · about ·

BibSonomy :: author :: Micciancio ::

tag user group author concept BibTeX key search:all

The blue social bookmark and publication sharing system.

>
|
<

bookmarks

bookmarks per page: 5 10 20 50 100

RSS BibTeX RDF more

publications

(87)

<< < 1 | 2 | 3 > >>

Composition and Efficiency Tradeoffs for Forward-Secure Digital Signatures.
Tal Malkin, Daniele Micciancio, and Sara Miner More IACR Cryptology ePrint Archive (2001)
to dblp by dblp on Jan 23, 2012, 12:00 AM
URL | BibTeX
Efficient and Concurrent Zero-Knowledge from any public coin HVZK protocol.
Daniele Micciancio, and Erez Petrank IACR Cryptology ePrint Archive (2002)
to dblp by dblp and 1 other user on Jan 23, 2012, 12:00 AM
URL | BibTeX
Generalized compact knapsacks, cyclic lattices, and efficient one-way functions from worst-case complexity assumptions.
Daniele Micciancio IACR Cryptology ePrint Archive (2004)
to dblp by dblp and 1 other user on Jan 17, 2012, 12:00 AM
URL | BibTeX
Concurrent Zero Knowledge without Complexity Assumptions.
Daniele Micciancio, Shien Jin Ong, Amit Sahai, and Salil P. Vadhan IACR Cryptology ePrint Archive (2005)
to dblp by dblp and 1 other user on Jan 16, 2012, 12:00 AM
URL | BibTeX
Pseudorandom Knapsacks and the Sample Complexity of LWE Search-to-Decision Reductions.
Daniele Micciancio, and Petros Mol IACR Cryptology ePrint Archive (2011)
to dblp by dblp on Jan 13, 2012, 12:00 AM
URL | BibTeX
Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller.
Daniele Micciancio, and Chris Peikert IACR Cryptology ePrint Archive (2011)
to dblp by dblp on Jan 13, 2012, 12:00 AM
URL | BibTeX
The Geometry of Lattice Cryptography.
Daniele Micciancio FOSAD, volume 6858 of Lecture Notes in Computer Science, page 185-210. Springer, (2011)
to dblp by dblp on Dec 30, 2011, 12:00 AM
URL | BibTeX
A New Paradigm for Collision-Free Hashing: Incrementality at Reduced Cost.
Mihir Bellare, and Daniele Micciancio EUROCRYPT, volume 1233 of Lecture Notes in Computer Science, page 163-192. Springer, (1997)
to dblp by dblp on Dec 23, 2011, 12:00 AM
URL | BibTeX
An Efficient Non-Interactive Statistical Zero-Knowledge Proof System for Quasi-Safe Prime Products.
Rosario Gennaro, Daniele Micciancio, and Tal Rabin ACM Conference on Computer and Communications Security, page 67-72. ACM, (1998)
to dblp by dblp on Dec 23, 2011, 12:00 AM
URL | BibTeX
Generalized compact knapsacks, cyclic lattices, and efficient one-way functions from worst-case complexity assumptions
Daniele Micciancio Electronic Colloquium on Computational Complexity ECCC (2004)
to dblp by dblp and 1 other user on Dec 7, 2011, 12:00 AM
URL | BibTeX
A Linear Space Algorithm for Computing the Hermite Normal Form
Daniele Micciancio, and Bogdan Warinschi Electronic Colloquium on Computational Complexity ECCC (2000)
to dblp by dblp on Dec 7, 2011, 12:00 AM
URL | BibTeX
Generalized Compact Knapsacks are Collision Resistant
Vadim Lyubashevsky, and Daniele Micciancio Electronic Colloquium on Computational Complexity ECCC (2005)
to dblp by dblp on Dec 7, 2011, 12:00 AM
URL | BibTeX
Faster exponential time algorithms for the shortest vector problem.
Panagiotis Voulgaris, and Daniele Micciancio Electronic Colloquium on Computational Complexity ECCC (2009)
to dblp by dblp on Dec 7, 2011, 12:00 AM
URL | BibTeX
Hardness of Approximating the Minimum Distance of a Linear Code
Ilya Dumer, Daniele Micciancio, and Madhu Sudan Electronic Colloquium on Computational Complexity ECCC (1999)
to dblp by dblp and 2 other users on Dec 7, 2011, 12:00 AM
URL | BibTeX
Almost perfect lattices, the covering radius problem, and applications to Ajtai's connection factor
Daniele Micciancio Electronic Colloquium on Computational Complexity ECCC (2003)
to dblp by dblp on Dec 7, 2011, 12:00 AM
URL | BibTeX
Efficient and Concurrent Zero-Knowledge from any public coin HVZK protocol
Daniele Micciancio, and Erez Petrank Electronic Colloquium on Computational Complexity ECCC (2002)
to dblp by dblp and 1 other user on Dec 7, 2011, 12:00 AM
URL | BibTeX
Approximating Shortest Lattice Vectors is Not Harder Than Approximating Closest Lattice Vectors.
Oded Goldreich, Daniele Micciancio, Shmuel Safra, and Jean-Pierre Seifert Electronic Colloquium on Computational Complexity ECCC (1999)
to dblp by dblp and 1 other user on Dec 7, 2011, 12:00 AM
URL | BibTeX
A Deterministic Single Exponential Time Algorithm for Most Lattice Problems based on Voronoi Cell Computations.
Daniele Micciancio, and Panagiotis Voulgaris Electronic Colloquium on Computational Complexity ECCC (2010)
to dblp by dblp and 1 other user on Dec 7, 2011, 12:00 AM
URL | BibTeX
Concurrent Zero Knowledge without Complexity Assumptions
Daniele Micciancio, Shien Jin Ong, Amit Sahai, and Salil P. Vadhan Electronic Colloquium on Computational Complexity ECCC (2005)
to dblp by dblp and 1 other user on Dec 7, 2011, 12:00 AM
URL | BibTeX
The Shortest Vector in a Lattice is Hard to Approximate to within Some Constant.
Daniele Micciancio Electronic Colloquium on Computational Complexity ECCC (1998)
to dblp by dblp and 1 other user on Dec 7, 2011, 12:00 AM
URL | BibTeX

<< < 1 | 2 | 3 > >>publications per page: 5 10 20 50 100

a gripper