- CSB - MetaPress - Google - Bing - Yahoo
 | 2012 | |
|---|---|---|
| c23 |      | Ilya Mironov: On significance of the least significant bits for differential privacy. ACM Conference on Computer and Communications Security 2012: 650-661 |
| c22 | | Yevgeniy Dodis, Adriana López-Alt, Ilya Mironov, Salil P. Vadhan: Differential Privacy with Imperfect Randomness. CRYPTO 2012: 497-516 |
| c21 | | Ilya Mironov, Omkant Pandey, Omer Reingold, Gil Segev: Incremental Deterministic Public-Key Encryption. EUROCRYPT 2012: 628-644 |
| i11 | | Krishnaram Kenthapadi, Aleksandra Korolova, Ilya Mironov, Nina Mishra: Privacy via the Johnson-Lindenstrauss Transform. CoRR abs/1204.2606 (2012) |
| i10 | | Ilya Mironov, Omkant Pandey, Omer Reingold, Gil Segev: Incremental Deterministic Public-Key Encryption. IACR Cryptology ePrint Archive 2012: 47 (2012) |
| i9 | | Yevgeniy Dodis, Adriana López-Alt, Ilya Mironov, Salil P. Vadhan: Differential Privacy with Imperfect Randomness. IACR Cryptology ePrint Archive 2012: 435 (2012) |
| 2011 | ||
| j2 | | Ilya Mironov, Moni Naor, Gil Segev: Sketching in Adversarial Environments. SIAM J. Comput. 40(6): 1845-1870 (2011) |
| c20 | | Roy D'Souza, David Jao, Ilya Mironov, Omkant Pandey: Publicly Verifiable Secret Sharing for Cloud-Based Key Management. INDOCRYPT 2011: 290-309 |
| i8 | | Andrew McGregor, Ilya Mironov, Toniann Pitassi, Omer Reingold, Kunal Talwar, Salil P. Vadhan: The Limits of Two-Party Differential Privacy. Electronic Colloquium on Computational Complexity (ECCC) 18: 106 (2011) |
| 2010 | ||
| c19 | | Andrew McGregor, Ilya Mironov, Toniann Pitassi, Omer Reingold, Kunal Talwar, Salil P. Vadhan: The Limits of Two-Party Differential Privacy. FOCS 2010: 81-90 |
| c18 | | Ilya Mironov: Domain Extension for Enhanced Target Collision-Resistant Hash Functions. FSE 2010: 153-167 |
| 2009 | ||
| c17 | | Ilya Mironov, Omkant Pandey, Omer Reingold, Salil P. Vadhan: Computational Differential Privacy. CRYPTO 2009: 126-142 |
| c16 | | Frank McSherry, Ilya Mironov: Differentially Private Recommender Systems: Building Privacy into the Netflix Prize Contenders. KDD 2009: 627-636 |
| 2008 | ||
| j1 | | Philippe Golle, Frank McSherry, Ilya Mironov: Data Collection with Self-Enforcing Privacy. ACM Trans. Inf. Syst. Secur. 12(2) (2008) |
| c15 | | |
| 2007 | ||
| c14 | | Nathan Keller, Stephen D. Miller, Ilya Mironov, Ramarathnam Venkatesan: MV3: A New Word Based Stream Cipher Using Rapid Mixing and Revolving Buffers. CT-RSA 2007: 1-19 |
| 2006 | ||
| c13 | | Ilya Mironov, Anton Mityagin, Kobbi Nissim: Hard Instances of the Constrained Discrete Logarithm Problem. ANTS 2006: 582-598 |
| c12 | | Philippe Golle, Frank McSherry, Ilya Mironov: Data collection with self-enforcing privacy. ACM Conference on Computer and Communications Security 2006: 69-78 |
| c11 | | |
| c10 | | Cynthia Dwork, Krishnaram Kenthapadi, Frank McSherry, Ilya Mironov, Moni Naor: Our Data, Ourselves: Privacy Via Distributed Noise Generation. EUROCRYPT 2006: 486-503 |
| c9 | | Ilya Mironov: Collision-Resistant No More: Hash-and-Sign Paradigm Revisited. Public Key Cryptography 2006: 140-156 |
| c8 | | Ilya Mironov, Lintao Zhang: Applications of SAT Solvers to Cryptanalysis of Hash Functions. SAT 2006: 102-115 |
| i7 | | Nathan Keller, Stephen D. Miller, Ilya Mironov, Ramarathnam Venkatesan: MV3: A new word based stream cipher using rapid mixing and revolving buffers. CoRR abs/cs/0610048 (2006) |
| i6 | | Ilya Mironov, Anton Mityagin, Kobbi Nissim: Hard Instances of the Constrained Discrete Logarithm Problem. CoRR abs/math/0606771 (2006) |
| i5 | | Ilya Mironov, Anton Mityagin, Kobbi Nissim: Hard Instances of the Constrained Discrete Logarithm Problem. IACR Cryptology ePrint Archive 2006: 253 (2006) |
| i4 | | Ilya Mironov, Lintao Zhang: Applications of SAT Solvers to Cryptanalysis of Hash Functions. IACR Cryptology ePrint Archive 2006: 254 (2006) |
| i3 | | Nathan Keller, Stephen D. Miller, Ilya Mironov, Ramarathnam Venkatesan: MV3: A new word based stream cipher using rapid mixing and revolving buffers. IACR Cryptology ePrint Archive 2006: 341 (2006) |
| 2003 | ||
| c7 | | Dan Boneh, Ilya Mironov, Victor Shoup: A Secure Signature Scheme from Bilinear Maps. CT-RSA 2003: 98-110 |
| 2002 | ||
| c6 | | |
| c5 | | Philippe Golle, Stanislaw Jarecki, Ilya Mironov: Cryptographic Primitives Enforcing Communication and Storage Complexity. Financial Cryptography 2002: 120-135 |
| i2 | | |
| 2001 | ||
| c4 | | |
| c3 | | |
| c2 | | Philippe Golle, Kevin Leyton-Brown, Ilya Mironov: Incentives for sharing in peer-to-peer networks. ACM Conference on Electronic Commerce 2001: 264-267 |
| c1 | | Philippe Golle, Kevin Leyton-Brown, Ilya Mironov, Mark Lillibridge: Incentives for Sharing in Peer-to-Peer Networks. WELCOM 2001: 75-87 |
| i1 | | Ilya Mironov: A Note on Cryptanalysis of the Preliminary Version of the NTRU Signature Scheme. IACR Cryptology ePrint Archive 2001: 5 (2001) |
Data released under the ODC-BY 1.0 license — See also our legal information page