The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Daniele Micciancio: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  54. On Bounded Distance Decoding, Unique Shortest Vectors, and the Minimum Distance Problem. [Citation Graph (, )][DBLP]


  55. Computational Soundness, Co-induction, and Encryption Cycles. [Citation Graph (, )][DBLP]


  56. SWIFFT: A Modest Proposal for FFT Hashing. [Citation Graph (, )][DBLP]


  57. An Indistinguishability-Based Characterization of Anonymous Channels. [Citation Graph (, )][DBLP]


  58. Efficient reductions among lattice problems. [Citation Graph (, )][DBLP]


  59. Faster Exponential Time Algorithms for the Shortest Vector Problem. [Citation Graph (, )][DBLP]


  60. A deterministic single exponential time algorithm for most lattice problems based on voronoi cell computations. [Citation Graph (, )][DBLP]


  61. The Round-Complexity of Black-Box Zero-Knowledge: A Combinatorial Characterization. [Citation Graph (, )][DBLP]


  62. Asymptotically Efficient Lattice-Based Digital Signatures. [Citation Graph (, )][DBLP]


  63. A first glimpse of cryptography's Holy Grail. [Citation Graph (, )][DBLP]


  64. Generalized Compact Knapsacks, Cyclic Lattices, and Efficient One-Way Functions. [Citation Graph (, )][DBLP]


Search in 0.101secs, Finished in 0.103secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002