D. Micciancio
#163,983
Most Influential Person Now
D. Micciancio's AcademicInfluence.com Rankings
D. Miccianciocomputer-science Degrees
Computer Science
#9678
World Rank
#10155
Historical Rank
Database
#6642
World Rank
#6877
Historical Rank
Download Badge
Computer Science
Why Is D. Micciancio Influential?
(Suggest an Edit or Addition)D. Micciancio's Published Works
Number of citations in a given year to any of this author's works
Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author
Published Works
- Worst-case to average-case reductions based on Gaussian measures (2004) (1015)
- Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller (2012) (982)
- Multicast security: a taxonomy and some efficient constructions (1999) (797)
- Foundations of Group Signatures: Formal Definitions, Simplified Requirements, and a Construction Based on General Assumptions (2003) (723)
- Lattice-Based Cryptography (2011) (606)
- Complexity of lattice problems - a cryptographic perspective (2002) (516)
- FHEW: Bootstrapping Homomorphic Encryption in Less Than a Second (2015) (461)
- Complexity of lattice problems (2002) (374)
- Generalized Compact Knapsacks Are Collision Resistant (2006) (354)
- Generalized Compact Knapsacks, Cyclic Lattices, and Efficient One-Way Functions (2002) (337)
- A deterministic single exponential time algorithm for most lattice problems based on voronoi cell computations (2010) (336)
- Hardness of SIS and LWE with Small Parameters (2013) (277)
- The shortest vector in a lattice is hard to approximate to within some constant (1998) (272)
- SWIFFT: A Modest Proposal for FFT Hashing (2008) (269)
- A New Paradigm for Collision-Free Hashing: Incrementality at Reduced Cost (1997) (266)
- Soundness of Formal Encryption in the Presence of Active Adversaries (2004) (233)
- Faster exponential time algorithms for the shortest vector problem (2010) (230)
- The hardness of the closest vector problem with preprocessing (2001) (197)
- Efficient Generic Forward-Secure Signatures with an Unbounded Number Of Time Periods (2002) (185)
- Improving Lattice Based Cryptosystems Using the Hermite Normal Form (2001) (177)
- Approximating Shortest Lattice Vectors is Not Harder Than Approximating Closest Lattice Vectors (1999) (159)
- Statistical Zero-Knowledge Proofs with Efficient Provers: Lattice Problems and More (2003) (154)
- Pseudorandom Knapsacks and the Sample Complexity of LWE Search-to-Decision Reductions (2011) (152)
- On Bounded Distance Decoding, Unique Shortest Vectors, and the Minimum Distance Problem (2009) (149)
- Hardness of approximating the minimum distance of a linear code (1999) (141)
- Perfectly one-way probabilistic hash functions (preliminary version) (1998) (134)
- Gaussian Sampling over the Integers: Efficient, Generic, Constant-Time (2017) (109)
- Completeness Theorems for the Abadi-Rogaway Language of Encrypted Expressions (2004) (106)
- Improved Short Lattice Signatures in the Standard Model (2014) (99)
- Oblivious data structures: applications to cryptography (1997) (94)
- Almost Perfect Lattices, the Covering Radius Problem, and Applications to Ajtai's Connection Factor (2003) (91)
- Perfectly One-Way Probabilistic Hash Functions (1998) (90)
- Practical, Predictable Lattice Basis Reduction (2016) (89)
- A first glimpse of cryptography's Holy Grail (2010) (82)
- "Pseudo-Random" Number Generation Within Cryptographic Algorithms: The DDS Case (1997) (78)
- Fast Lattice Point Enumeration with Minimal Overhead (2015) (72)
- An efficient non-interactive statistical zero-knowledge proof system for quasi-safe prime products (1998) (67)
- A linear space algorithm for computing the hermite normal form (2001) (66)
- Homomorphic Encryption Standard (2019) (66)
- Asymptotically Efficient Lattice-Based Digital Signatures (2018) (63)
- On Bounded Distance Decoding for General Lattices (2006) (61)
- The complexity of the covering radius problem (2005) (60)
- On the Security of Homomorphic Encryption on Approximate Numbers (2020) (59)
- Efficient reductions among lattice problems (2008) (58)
- The inapproximability of lattice and coding problems with preprocessing (2002) (57)
- Asymptotically Efficient Lattice-Based Digital Signatures (2008) (51)
- Optimal Communication Complexity of Generic Multicast Key Distribution (2004) (51)
- SWIFFTX : A Proposal for the SHA-3 Standard (2008) (51)
- An Indistinguishability-Based Characterization of Anonymous Channels (2008) (49)
- Adaptive Security of Symbolic Encryption (2005) (46)
- Concurrent Zero Knowledge without Complexity Assumptions (2006) (40)
- Issues in Multicast Security: A Taxonomy and E cient Constructions (1999) (39)
- Simulatable Commitments and Efficient Concurrent Zero-Knowledge (2003) (37)
- Inapproximability of the Shortest Vector Problem: Toward a Deterministic Reduction (2012) (36)
- On the Bit Security of Cryptographic Primitives (2018) (36)
- Semi-Parallel logistic regression for GWAS on encrypted data (2020) (35)
- On the hardness of the shortest vector problem (1998) (34)
- Faster Gaussian Sampling for Trapdoor Lattices with Arbitrary Modulus (2018) (34)
- The Provable Security of Graph-Based One-Time Signatures and Extensions to Algebraic Signature Schemes (2002) (33)
- Hardness of approximating the minimum distance of a linear code (2000) (33)
- Improved cryptographic hash functions with worst-case/average-case connection (2002) (32)
- On the Hardness of Learning With Errors with Binary Secrets (2018) (29)
- The complexity of the covering radius problem on lattices and codes (2004) (29)
- Foundations of group signatures: Formal de ni-tions (2003) (27)
- The RSA Group is Pseudo-Free (2005) (26)
- Cryptographic Functions from Worst-Case Complexity Assumptions (2010) (26)
- Bootstrapping in FHEW-like Cryptosystems (2021) (25)
- Compactness vs Collusion Resistance in Functional Encryption (2016) (25)
- Diogenes: Lightweight Scalable RSA Modulus Generation with a Dishonest Majority (2021) (23)
- An equational approach to secure multi-party computation (2013) (20)
- Homomorphic Encryption for Finite Automata (2019) (20)
- Corrupting One vs. Corrupting Many: The Case of Broadcast and Multicast Encryption (2006) (19)
- Creating Cryptographic Challenges Using Multi-Party Computation: The LWE Challenge (2016) (19)
- Efficient bounded distance decoders for Barnes-Wall lattices (2008) (18)
- Building an Efficient Lattice Gadget Toolkit: Subgaussian Sampling and More (2019) (18)
- Algorithms for the Densest Sub-Lattice Problem (2013) (17)
- Provably Secure FFT Hashing (2006) (16)
- Locally Dense Codes (2014) (14)
- FHE Bootstrapping in less than a second (2014) (14)
- Simultaneous broadcast revisited (2005) (14)
- Ring Packing and Amortized FHEW Bootstrapping (2018) (14)
- The Geometry of Lattice Cryptography (2011) (13)
- Closest Vector Problem (2011) (13)
- Foundations for Group Signatures: Simplified Requirements and a Construction Based on General Assumptions (2003) (11)
- Equational Security Proofs of Oblivious Transfer Protocols (2018) (11)
- Cryptanalysis of a Pseudorandom Generator Based on Braid Groups (2002) (11)
- Shortest Vector Problem (2011) (11)
- Improved Discrete Gaussian and Subgaussian Analysis for Lattice Cryptography (2020) (10)
- Lattice Based Cryptography: A Global Improvement (1999) (9)
- Analysis of Pure PROLOG Programs (1995) (8)
- Computational soundness, co-induction, and encryption cycles (2010) (7)
- Composition and Efficiency Tradeoffs for Forward-Secure Digital Signatures (2001) (6)
- Perfectly one-way probabilistic hashing (1998) (6)
- Efficient and Concurrent Zero-Knowledge from any public coin HVZK protocol (2002) (6)
- Theory of Cryptography (2004) (6)
- International Symposium on Symbolic and Algebraic Computation, ISSAC - 2001 (2001) (5)
- An Oblivious Data Structure and its Applications to Cryptography (1996) (5)
- Pseudo-randomness and partial information in symbolic security analysis (2009) (5)
- Interactive Proof Systems (2002) (5)
- Theory of Cryptography (2010) (5)
- Symbolic Security of Garbled Circuits (2018) (4)
- The Round-Complexity of Black-Box Zero-Knowledge: A Combinatorial Characterization (2008) (4)
- Cse 206a: Lattice Algorithms and Applications the Gaussians Distribution (2016) (4)
- Asymptotically Ecient Lattice-Based Digital Signatures (TCC 2008) (2009) (4)
- The validity problem for extended regular expressions (1996) (4)
- On the Inapproximability of the Shortest Vector in a Lattice Within Some Constant Factor (1998) (4)
- Efficient cryptography based on lattices (2012) (3)
- Stronger average case to worst case connections (2004) (3)
- Cellular Network Security (2011) (3)
- Conceptual Modeling (2012) (3)
- A Note on the Minimal Volume of Almost Cubic Parallelepipeds (2002) (3)
- Theory of Cryptography (2010) (2)
- Towards Computationally Sound Symbolic Security Analysis (2004) (2)
- Symbolic Encryption with Pseudorandom Keys (2019) (2)
- Using Hypergraph Homomorphisms to Guess Three Secrets (2)
- Implementing Token-Based Obfuscation under (Ring) LWE (2018) (2)
- An Algorithm for the Solution of Tree Equations (1997) (2)
- Logic and mathematical programming (1997) (2)
- Proceedings of the 7th international conference on Theory of Cryptography (2010) (1)
- Theory of cryptography : 7th Theory of Cryptography Conference, TCC 2010, Zurich, Switzerland, February 9-11, 2010 : proceedings (2010) (1)
- An Oblivious Data Structure and its Applications toCryptographyDaniele (1997) (1)
- Simpler Statistically Sender Private Oblivious Transfer from Ideals of Cyclotomic Integers (2020) (1)
- Software-Based Attestation (2011) (1)
- CSE 206 A : Lattice Algorithms and Applications Spring 2014 Lattice Cryptography (2014) (1)
- Cse 206a: Lattice Algorithms and Applications Minkowski's Theorem (2014) (0)
- CSE 206 A : Lattice Algorithms and Applications Spring 2007 Lecture 4 : The LLL Algorithm (2007) (0)
- CSE 206 A : Lattice Algorithms and Applications Fall 2021 Harmonic Analysis (2021) (0)
- CSE 206 A : Lattice Algorithms and Applications Fall 2019 The Gaussians Distribution (2019) (0)
- Cse 206a: Lattice Algorithms and Applications Basic Algorithms (2014) (0)
- Basis Reduction Problems (2002) (0)
- Low-Degree Hypergraphs (2002) (0)
- 1 Provably Secure FFT Hashing Vadim Lyubashevsky (2006) (0)
- Special Issue: FOCS 2003 (2006) (0)
- CSE 206 A : Lattice Algorithms and Applications Winter (2007) (0)
- Speaker Identification and Verification (SIV) (2011) (0)
- CSE 206 A : Lattice Algorithms and Applications Fall 2019 Basis Reduction (2021) (0)
- A fully classical LLL algorithm for modules (2022) (0)
- Interactive proofs for lattice problems (2019) (0)
- Advanced Homomorphic Encryption its Applications and Derivatives (AHEAD) (2013) (0)
- Subgroup Cryptosystems (2011) (0)
- Credential Verification (2011) (0)
- Random Lattices and Lattice-Based Cryptography (2019) (0)
- Cse 206a: Lattice Algorithms and Applications Lattice Cryptography (0)
- A fully classical LLL algorithm for modules (cid:63) (2022) (0)
- CSE 206 A : Lattice Algorithms and Applications Spring 2014 Basis Reduction (0)
- To Collude Or Not To Collude : The Case of Broadcast and Multicast Encryption (2006) (0)
- CSE 206 A : Lattice Algorithms and Applications Fall 2017 Cryptanalysis of Pseudorandom Generators (2017) (0)
- Lecture 1: Introduction (2007) (0)
This paper list is powered by the following services:
