default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDaniele Micciancio
Person information
- affiliation: University of California, San Diego, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c80]Baiyu Li
, Daniele Micciancio, Mariana Raykova, Mark Schultz:
Hintless Single-Server Private Information Retrieval. CRYPTO (9) 2024: 183-217- [c79]Daniele Micciancio, Vinod Vaikuntanathan:
SoK: Learning with Errors, Circular Security, and Fully Homomorphic Encryption. Public Key Cryptography (4) 2024: 291-321 - [c78]Gabrielle De Micheli, Duhyeong Kim, Daniele Micciancio, Adam Suhl:
Faster Amortized FHEW Bootstrapping Using Ring Automorphisms. Public Key Cryptography (4) 2024: 322-353 - [i62]Andreea Alexandru, Ahmad Al Badawi, Daniele Micciancio, Yuriy Polyakov:
Application-Aware Approximate Homomorphic Encryption: Configuring FHE for Practical Use. IACR Cryptol. ePrint Arch. 2024: 203 (2024) - [i61]Daniele Micciancio, Mark Schultz-Wu:
Bit Security: optimal adversaries, equivalence results, and a toolbox for computational-statistical security analysis. IACR Cryptol. ePrint Arch. 2024: 1506 (2024) - 2023
- [c77]Daniele Micciancio, Mark Schultz:
Error Correction and Ciphertext Quantization in Lattice Cryptography. CRYPTO (5) 2023: 648-681 - [c76]Gabrielle De Micheli, Daniele Micciancio, Alice Pellet-Mary, Nam Tran:
Reductions from Module Lattices to Free Module Lattices, and Application to Dequantizing Module-LLL. CRYPTO (5) 2023: 836-865 - [c75]Yongwoo Lee, Daniele Micciancio, Andrey Kim, Rakyong Choi, Maxim Deryabin, Jieun Eom, Donghoon Yoo:
Efficient FHEW Bootstrapping with Small Evaluation Keys, and Applications to Threshold Homomorphic Encryption. EUROCRYPT (3) 2023: 227-256 - [c74]Yujin Nam, Minxuan Zhou, Saransh Gupta, Gabrielle De Micheli, Rosario Cammarota, Chris Wilkerson, Daniele Micciancio, Tajana Rosing:
Efficient Machine Learning on Encrypted Data Using Hyperdimensional Computing. ISLPED 2023: 1-6 - [i60]Gabrielle De Micheli, Duhyeong Kim, Daniele Micciancio, Adam Suhl:
Faster Amortized FHEW bootstrapping using Ring Automorphisms. IACR Cryptol. ePrint Arch. 2023: 112 (2023) - [i59]Daniele Micciancio, Mark Schultz:
Error Correction and Ciphertext Quantization in Lattice Cryptography. IACR Cryptol. ePrint Arch. 2023: 525 (2023) - [i58]Gabrielle De Micheli, Daniele Micciancio, Alice Pellet-Mary, Nam Tran:
Reductions from module lattices to free module lattices, and application to dequantizing module-LLL. IACR Cryptol. ePrint Arch. 2023: 886 (2023) - [i57]Ravit Geva, Alexander Gusev, Yuriy Polyakov, Lior Liram, Oded Rosolio, Andreea Alexandru, Nicholas Genise, Marcelo Blatt, Zohar Duchin, Barliz Waissengrin, Dan Mirelman, Felix Bukstein, Deborah T. Blumenthal, Ido Wolf, Sharon Pelles-Avraham, Tali Schaffer, Lee A. Lavi, Daniele Micciancio, Vinod Vaikuntanathan, Ahmad Al Badawi, Shafi Goldwasser:
Collaborative Privacy-Preserving Analysis of Oncological Data using Multiparty Homomorphic Encryption. IACR Cryptol. ePrint Arch. 2023: 1203 (2023) - [i56]Daniele Micciancio, Adam Suhl:
Simulation-Secure Threshold PKE from LWE with Polynomial Modulus. IACR Cryptol. ePrint Arch. 2023: 1728 (2023) - [i55]Baiyu Li, Daniele Micciancio, Mariana Raykova, Mark Schultz:
Hintless Single-Server Private Information Retrieval. IACR Cryptol. ePrint Arch. 2023: 1733 (2023) - 2022
- [c73]Zeyu Liu, Daniele Micciancio, Yuriy Polyakov:
Large-Precision Homomorphic Sign Evaluation Using FHEW/TFHE Bootstrapping. ASIACRYPT (2) 2022: 130-160 - [c72]Ahmad Al Badawi, Jack Bates, Flávio Bergamaschi, David Bruce Cousins, Saroja Erabelli, Nicholas Genise, Shai Halevi, Hamish Hunt, Andrey Kim, Yongwoo Lee, Zeyu Liu, Daniele Micciancio, Ian Quah, Yuriy Polyakov, R. V. Saraswathy, Kurt Rohloff, Jonathan Saylor, Dmitriy Suponitsky, Matthew Triplett, Vinod Vaikuntanathan, Vincent Zucca:
OpenFHE: Open-Source Fully Homomorphic Encryption Library. WAHC@CCS 2022: 53-63 - [c71]Baiyu Li, Daniele Micciancio, Mark Schultz, Jessica Sorrell:
Securing Approximate Homomorphic Encryption Using Differential Privacy. CRYPTO (1) 2022: 560-589 - [i54]Yongwoo Lee, Daniele Micciancio, Andrey Kim, Rakyong Choi, Maxim Deryabin, Jieun Eom, Donghoon Yoo:
Efficient FHEW Bootstrapping with Small Evaluation Keys, and Applications to Threshold Homomorphic Encryption. IACR Cryptol. ePrint Arch. 2022: 198 (2022) - [i53]Baiyu Li, Daniele Micciancio, Mark Schultz, Jessica Sorrell:
Securing Approximate Homomorphic Encryption Using Differential Privacy. IACR Cryptol. ePrint Arch. 2022: 816 (2022) - [i52]Ahmad Al Badawi, Jack Bates, Flávio Bergamaschi, David Bruce Cousins, Saroja Erabelli, Nicholas Genise, Shai Halevi, Hamish Hunt, Andrey Kim, Yongwoo Lee, Zeyu Liu, Daniele Micciancio, Ian Quah, Yuriy Polyakov, R. V. Saraswathy, Kurt Rohloff, Jonathan Saylor, Dmitriy Suponitsky, Matthew Triplett, Vinod Vaikuntanathan, Vincent Zucca:
OpenFHE: Open-Source Fully Homomorphic Encryption Library. IACR Cryptol. ePrint Arch. 2022: 915 (2022) - [i51]Gabrielle De Micheli, Daniele Micciancio:
A fully classical LLL algorithm for modules. IACR Cryptol. ePrint Arch. 2022: 1356 (2022) - 2021
- [c70]Daniele Micciancio, Yuriy Polyakov:
Bootstrapping in FHEW-like Cryptosystems. WAHC@CCS 2021: 17-28 - [c69]Baiyu Li, Daniele Micciancio:
On the Security of Homomorphic Encryption on Approximate Numbers. EUROCRYPT (1) 2021: 648-677 - [c68]Megan Chen, Carmit Hazay, Yuval Ishai, Yuriy Kashnikov, Daniele Micciancio, Tarik Riviere, Abhi Shelat, Muthuramakrishnan Venkitasubramaniam, Ruihan Wang:
Diogenes: Lightweight Scalable RSA Modulus Generation with a Dishonest Majority. SP 2021: 590-607 - [i50]Zeyu Liu, Daniele Micciancio, Yuriy Polyakov:
Large-Precision Homomorphic Sign Evaluation using FHEW/TFHE Bootstrapping. IACR Cryptol. ePrint Arch. 2021: 1337 (2021) - 2020
- [c67]Daniele Micciancio, Jessica Sorrell:
Simpler Statistically Sender Private Oblivious Transfer from Ideals of Cyclotomic Integers. ASIACRYPT (2) 2020: 381-407 - [c66]Nicholas Genise, Daniele Micciancio, Chris Peikert, Michael Walter:
Improved Discrete Gaussian and Subgaussian Analysis for Lattice Cryptography. Public Key Cryptography (1) 2020: 623-651 - [e7]Daniele Micciancio, Thomas Ristenpart:
Advances in Cryptology - CRYPTO 2020 - 40th Annual International Cryptology Conference, CRYPTO 2020, Santa Barbara, CA, USA, August 17-21, 2020, Proceedings, Part I. Lecture Notes in Computer Science 12170, Springer 2020, ISBN 978-3-030-56783-5 [contents] - [e6]Daniele Micciancio, Thomas Ristenpart:
Advances in Cryptology - CRYPTO 2020 - 40th Annual International Cryptology Conference, CRYPTO 2020, Santa Barbara, CA, USA, August 17-21, 2020, Proceedings, Part II. Lecture Notes in Computer Science 12171, Springer 2020, ISBN 978-3-030-56879-5 [contents] - [e5]Daniele Micciancio, Thomas Ristenpart:
Advances in Cryptology - CRYPTO 2020 - 40th Annual International Cryptology Conference, CRYPTO 2020, Santa Barbara, CA, USA, August 17-21, 2020, Proceedings, Part III. Lecture Notes in Computer Science 12172, Springer 2020, ISBN 978-3-030-56876-4 [contents] - [i49]Daniele Micciancio, Yuriy Polyakov:
Bootstrapping in FHEW-like Cryptosystems. IACR Cryptol. ePrint Arch. 2020: 86 (2020) - [i48]Nicholas Genise, Daniele Micciancio, Chris Peikert, Michael Walter:
Improved Discrete Gaussian and Subgaussian Analysis for Lattice Cryptography. IACR Cryptol. ePrint Arch. 2020: 337 (2020) - [i47]Megan Chen, Carmit Hazay, Yuval Ishai, Yuriy Kashnikov, Daniele Micciancio, Tarik Riviere, Abhi Shelat, Muthuramakrishnan Venkitasubramaniam, Ruihan Wang:
Diogenes: Lightweight Scalable RSA Modulus Generation with a Dishonest Majority. IACR Cryptol. ePrint Arch. 2020: 374 (2020) - [i46]Daniele Micciancio, Jessica Sorrell:
Simpler Statistically Sender Private Oblivious Transfer from Ideals of Cyclotomic Integers. IACR Cryptol. ePrint Arch. 2020: 1413 (2020) - [i45]Baiyu Li, Daniele Micciancio:
On the Security of Homomorphic Encryption on Approximate Numbers. IACR Cryptol. ePrint Arch. 2020: 1533 (2020)
2010 – 2019
- 2019
- [c65]Nicholas Genise, Craig Gentry, Shai Halevi, Baiyu Li, Daniele Micciancio:
Homomorphic Encryption for Finite Automata. ASIACRYPT (2) 2019: 473-502 - [c64]Daniele Micciancio:
Symbolic Encryption with Pseudorandom Keys. EUROCRYPT (3) 2019: 64-93 - [c63]Nicholas Genise, Daniele Micciancio, Yuriy Polyakov:
Building an Efficient Lattice Gadget Toolkit: Subgaussian Sampling and More. EUROCRYPT (2) 2019: 655-684 - [p2]Daniele Micciancio:
Interactive proofs for lattice problems. Providing Sound Foundations for Cryptography 2019: 565-597 - [e4]Alexandra Boldyreva, Daniele Micciancio:
Advances in Cryptology - CRYPTO 2019 - 39th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 18-22, 2019, Proceedings, Part I. Lecture Notes in Computer Science 11692, Springer 2019, ISBN 978-3-030-26947-0 [contents] - [e3]Alexandra Boldyreva, Daniele Micciancio:
Advances in Cryptology - CRYPTO 2019 - 39th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 18-22, 2019, Proceedings, Part II. Lecture Notes in Computer Science 11693, Springer 2019, ISBN 978-3-030-26950-0 [contents] - [e2]Alexandra Boldyreva, Daniele Micciancio:
Advances in Cryptology - CRYPTO 2019 - 39th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 18-22, 2019, Proceedings, Part III. Lecture Notes in Computer Science 11694, Springer 2019, ISBN 978-3-030-26953-1 [contents] - [i44]Nicholas Genise, Craig Gentry, Shai Halevi, Baiyu Li, Daniele Micciancio:
Homomorphic Encryption for Finite Automata. IACR Cryptol. ePrint Arch. 2019: 176 (2019) - [i43]Miran Kim, Yongsoo Song, Baiyu Li, Daniele Micciancio:
Semi-parallel Logistic Regression for GWAS on Encrypted Data. IACR Cryptol. ePrint Arch. 2019: 294 (2019) - [i42]Martin R. Albrecht, Melissa Chase, Hao Chen, Jintai Ding, Shafi Goldwasser, Sergey Gorbunov, Shai Halevi, Jeffrey Hoffstein, Kim Laine, Kristin E. Lauter, Satya Lokam, Daniele Micciancio, Dustin Moody, Travis Morrison, Amit Sahai, Vinod Vaikuntanathan:
Homomorphic Encryption Standard. IACR Cryptol. ePrint Arch. 2019: 939 (2019) - 2018
- [j19]Vadim Lyubashevsky, Daniele Micciancio:
Asymptotically Efficient Lattice-Based Digital Signatures. J. Cryptol. 31(3): 774-797 (2018) - [j18]Daniele Micciancio:
On the Hardness of Learning With Errors with Binary Secrets. Theory Comput. 14(1): 1-17 (2018) - [c62]Baiyu Li, Daniele Micciancio:
Symbolic Security of Garbled Circuits. CSF 2018: 147-161 - [c61]Daniele Micciancio, Michael Walter:
On the Bit Security of Cryptographic Primitives. EUROCRYPT (1) 2018: 3-28 - [c60]Nicholas Genise, Daniele Micciancio:
Faster Gaussian Sampling for Trapdoor Lattices with Arbitrary Modulus. EUROCRYPT (1) 2018: 174-203 - [c59]Daniele Micciancio, Jessica Sorrell:
Ring Packing and Amortized FHEW Bootstrapping. ICALP 2018: 100:1-100:14 - [c58]Baiyu Li, Daniele Micciancio:
Equational Security Proofs of Oblivious Transfer Protocols. Public Key Cryptography (1) 2018: 527-553 - [i41]Daniele Micciancio, Michael Walter:
On the Bit Security of Cryptographic Primitives. IACR Cryptol. ePrint Arch. 2018: 77 (2018) - [i40]Baiyu Li, Daniele Micciancio:
Symbolic security of garbled circuits. IACR Cryptol. ePrint Arch. 2018: 141 (2018) - [i39]Daniele Micciancio, Jessica Sorrell:
Ring packing and amortized FHEW bootstrapping. IACR Cryptol. ePrint Arch. 2018: 532 (2018) - [i38]Nicholas Genise, Daniele Micciancio, Yuriy Polyakov:
Building an Efficient Lattice Gadget Toolkit: Subgaussian Sampling and More. IACR Cryptol. ePrint Arch. 2018: 946 (2018) - [i37]Daniele Micciancio:
On the Hardness of Learning With Errors with Binary Secrets. IACR Cryptol. ePrint Arch. 2018: 988 (2018) - [i36]Cheng Chen, Nicholas Genise, Daniele Micciancio, Yuriy Polyakov, Kurt Rohloff:
Implementing Token-Based Obfuscation under (Ring) LWE. IACR Cryptol. ePrint Arch. 2018: 1222 (2018) - 2017
- [c57]Daniele Micciancio, Michael Walter:
Gaussian Sampling over the Integers: Efficient, Generic, Constant-Time. CRYPTO (2) 2017: 455-485 - [i35]Daniele Micciancio, Michael Walter:
Gaussian Sampling over the Integers: Efficient, Generic, Constant-Time. IACR Cryptol. ePrint Arch. 2017: 259 (2017) - [i34]Nicholas Genise, Daniele Micciancio:
Faster Gaussian Sampling for Trapdoor Lattices with Arbitrary Modulus. IACR Cryptol. ePrint Arch. 2017: 308 (2017) - [i33]Johannes Buchmann, Niklas Büscher, Florian Göpfert, Stefan Katzenbeisser, Juliane Krämer, Daniele Micciancio, Sander Siim, Christine van Vredendaal, Michael Walter:
Creating Cryptographic Challenges Using Multi-Party Computation: The LWE Challenge. IACR Cryptol. ePrint Arch. 2017: 606 (2017) - 2016
- [c56]Johannes Buchmann, Niklas Büscher, Florian Göpfert, Stefan Katzenbeisser, Juliane Krämer, Daniele Micciancio, Sander Siim, Christine van Vredendaal, Michael Walter:
Creating Cryptographic Challenges Using Multi-Party Computation: The LWE Challenge. AsiaPKC@AsiaCCS 2016: 11-20 - [c55]Daniele Micciancio, Michael Walter:
Practical, Predictable Lattice Basis Reduction. EUROCRYPT (1) 2016: 820-849 - [c54]Baiyu Li, Daniele Micciancio:
Compactness vs Collusion Resistance in Functional Encryption. TCC (B2) 2016: 443-468 - [r8]Daniele Micciancio:
Shortest Vector Problem. Encyclopedia of Algorithms 2016: 1974-1977 - [i32]Baiyu Li, Daniele Micciancio:
Compactness vs Collusion Resistance in Functional Encryption. IACR Cryptol. ePrint Arch. 2016: 561 (2016) - [i31]Baiyu Li, Daniele Micciancio:
Equational Security Proofs of Oblivious Transfer Protocols. IACR Cryptol. ePrint Arch. 2016: 624 (2016) - 2015
- [c53]Léo Ducas, Daniele Micciancio:
FHEW: Bootstrapping Homomorphic Encryption in Less Than a Second. EUROCRYPT (1) 2015: 617-640 - [c52]Daniele Micciancio, Michael Walter:
Fast Lattice Point Enumeration with Minimal Overhead. SODA 2015: 276-294 - [i30]Daniele Micciancio, Michael Walter:
Practical, Predictable Lattice Basis Reduction. IACR Cryptol. ePrint Arch. 2015: 1123 (2015) - 2014
- [c51]Daniele Micciancio:
Locally Dense Codes. CCC 2014: 90-97 - [c50]Léo Ducas, Daniele Micciancio:
Improved Short Lattice Signatures in the Standard Model. CRYPTO (1) 2014: 335-352 - [i29]Léo Ducas, Daniele Micciancio:
Improved Short Lattice Signatures in the Standard Model. IACR Cryptol. ePrint Arch. 2014: 495 (2014) - [i28]Daniele Micciancio, Michael Walter:
Fast Lattice Point Enumeration with Minimal Overhead. IACR Cryptol. ePrint Arch. 2014: 569 (2014) - [i27]Léo Ducas, Daniele Micciancio:
FHE Bootstrapping in less than a second. IACR Cryptol. ePrint Arch. 2014: 816 (2014) - 2013
- [j17]Daniele Micciancio, Panagiotis Voulgaris:
A Deterministic Single Exponential Time Algorithm for Most Lattice Problems Based on Voronoi Cell Computations. SIAM J. Comput. 42(3): 1364-1391 (2013) - [c49]Daniele Micciancio, Chris Peikert:
Hardness of SIS and LWE with Small Parameters. CRYPTO (1) 2013: 21-39 - [c48]Daniele Micciancio, Stefano Tessaro:
An equational approach to secure multi-party computation. ITCS 2013: 355-372 - [c47]Daniel Dadush, Daniele Micciancio:
Algorithms for the Densest Sub-Lattice Problem. SODA 2013: 1103-1122 - [i26]Daniele Micciancio:
Locally Dense Codes. Electron. Colloquium Comput. Complex. TR13 (2013) - [i25]Daniele Micciancio, Chris Peikert:
Hardness of SIS and LWE with Small Parameters. IACR Cryptol. ePrint Arch. 2013: 69 (2013) - [i24]Vadim Lyubashevsky, Daniele Micciancio:
Asymptotically Effi cient Lattice-Based Digital Signatures. IACR Cryptol. ePrint Arch. 2013: 746 (2013) - 2012
- [j16]Daniele Micciancio:
Inapproximability of the Shortest Vector Problem: Toward a Deterministic Reduction. Theory Comput. 8(1): 487-512 (2012) - [c46]Daniele Micciancio, Chris Peikert:
Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller. EUROCRYPT 2012: 700-718 - [i23]Daniele Micciancio:
Inapproximability of the Shortest Vector Problem: Toward a Deterministic Reduction. Electron. Colloquium Comput. Complex. TR12 (2012) - 2011
- [c45]Daniele Micciancio, Petros Mol:
Pseudorandom Knapsacks and the Sample Complexity of LWE Search-to-Decision Reductions. CRYPTO 2011: 465-484 - [c44]Daniele Micciancio:
The Geometry of Lattice Cryptography. FOSAD 2011: 185-210 - [r7]Daniele Micciancio:
Closest Vector Problem. Encyclopedia of Cryptography and Security (2nd Ed.) 2011: 212-214 - [r6]Daniele Micciancio:
Lattice-Based Cryptography. Encyclopedia of Cryptography and Security (2nd Ed.) 2011: 713-715 - [r5]Daniele Micciancio:
Shortest Vector Problem. Encyclopedia of Cryptography and Security (2nd Ed.) 2011: 1196-1197 - [i22]Daniele Micciancio, Chris Peikert:
Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller. IACR Cryptol. ePrint Arch. 2011: 501 (2011) - [i21]Daniele Micciancio, Petros Mol:
Pseudorandom Knapsacks and the Sample Complexity of LWE Search-to-Decision Reductions. IACR Cryptol. ePrint Arch. 2011: 521 (2011) - 2010
- [j15]Daniele Micciancio:
A first glimpse of cryptography's Holy Grail. Commun. ACM 53(3): 96 (2010) - [j14]Daniele Micciancio:
The RSA Group is Pseudo-Free. J. Cryptol. 23(2): 169-186 (2010) - [c43]Daniele Micciancio:
Computational Soundness, Co-induction, and Encryption Cycles. EUROCRYPT 2010: 362-380 - [c42]Daniele Micciancio, Panagiotis Voulgaris:
Faster Exponential Time Algorithms for the Shortest Vector Problem. SODA 2010: 1468-1480 - [c41]Daniele Micciancio, Panagiotis Voulgaris:
A deterministic single exponential time algorithm for most lattice problems based on voronoi cell computations. STOC 2010: 351-358 - [p1]Daniele Micciancio:
Cryptographic Functions from Worst-Case Complexity Assumptions. The LLL Algorithm 2010: 427-452 - [e1]Daniele Micciancio:
Theory of Cryptography, 7th Theory of Cryptography Conference, TCC 2010, Zurich, Switzerland, February 9-11, 2010. Proceedings. Lecture Notes in Computer Science 5978, Springer 2010, ISBN 978-3-642-11798-5 [contents] - [i20]Daniele Micciancio, Panagiotis Voulgaris:
A Deterministic Single Exponential Time Algorithm for Most Lattice Problems based on Voronoi Cell Computations. Electron. Colloquium Comput. Complex. TR10 (2010)
2000 – 2009
- 2009
- [c40]Vadim Lyubashevsky, Daniele Micciancio:
On Bounded Distance Decoding, Unique Shortest Vectors, and the Minimum Distance Problem. CRYPTO 2009: 577-594 - [i19]Panagiotis Voulgaris, Daniele Micciancio:
Faster exponential time algorithms for the shortest vector problem. Electron. Colloquium Comput. Complex. TR09 (2009) - [i18]Daniele Micciancio:
Computational soundness, co-induction, and encryption cycles. IACR Cryptol. ePrint Arch. 2009: 227 (2009) - [i17]Daniele Micciancio:
Pseudo-randomness and partial information in symbolic security analysis. IACR Cryptol. ePrint Arch. 2009: 249 (2009) - 2008
- [j13]Daniele Micciancio, Saurabh Panjwani:
Optimal communication complexity of generic multicast key distribution. IEEE/ACM Trans. Netw. 16(4): 803-813 (2008) - [c39]Vadim Lyubashevsky, Daniele Micciancio, Chris Peikert, Alon Rosen:
SWIFFT: A Modest Proposal for FFT Hashing. FSE 2008: 54-72 - [c38]Daniele Micciancio, Antonio Nicolosi:
Efficient bounded distance decoders for Barnes-Wall lattices. ISIT 2008: 2484-2488 - [c37]Alejandro Hevia, Daniele Micciancio:
An Indistinguishability-Based Characterization of Anonymous Channels. Privacy Enhancing Technologies 2008: 24-43 - [c36]Daniele Micciancio:
Efficient reductions among lattice problems. SODA 2008: 84-93 - [c35]Vadim Lyubashevsky, Daniele Micciancio:
Asymptotically Efficient Lattice-Based Digital Signatures. TCC 2008: 37-54 - [c34]Daniele Micciancio, Scott Yilek:
The Round-Complexity of Black-Box Zero-Knowledge: A Combinatorial Characterization. TCC 2008: 535-552 - [r4]Daniele Micciancio:
Shortest Vector Problem. Encyclopedia of Algorithms 2008 - 2007
- [j12]Daniele Micciancio:
Generalized Compact Knapsacks, Cyclic Lattices, and Efficient One-Way Functions. Comput. Complex. 16(4): 365-411 (2007) - [j11]Daniele Micciancio, Oded Regev:
Worst-Case to Average-Case Reductions Based on Gaussian Measures. SIAM J. Comput. 37(1): 267-302 (2007) - 2006
- [j10]Chandra Chekuri, Daniele Micciancio:
Special Issue: FOCS 2003. J. Comput. Syst. Sci. 72(2): 205 (2006) - [c33]Yi-Kai Liu, Vadim Lyubashevsky, Daniele Micciancio:
On Bounded Distance Decoding for General Lattices. APPROX-RANDOM 2006: 450-461 - [c32]Daniele Micciancio, Saurabh Panjwani:
Corrupting One vs. Corrupting Many: The Case of Broadcast and Multicast Encryption. ICALP (2) 2006: 70-82 - [c31]Vadim Lyubashevsky, Daniele Micciancio:
Generalized Compact Knapsacks Are Collision Resistant. ICALP (2) 2006: 144-155 - [c30]Daniele Micciancio, Shien Jin Ong, Amit Sahai, Salil P. Vadhan:
Concurrent Zero Knowledge Without Complexity Assumptions. TCC 2006: 1-20 - 2005
- [j9]Venkatesan Guruswami, Daniele Micciancio, Oded Regev:
The complexity of the covering radius problem. Comput. Complex. 14(2): 90-121 (2005) - [c29]Daniele Micciancio:
The RSA Group is Pseudo-Free. EUROCRYPT 2005: 387-403 - [c28]Alejandro Hevia, Daniele Micciancio:
Simultaneous broadcast revisited. PODC 2005: 324-333 - [c27]Daniele Micciancio, Saurabh Panjwani:
Adaptive Security of Symbolic Encryption. TCC 2005: 169-187