Ilya Mironov

e-mail:  mironov@microsoft.com
phone:  (650) 693-1850
mail:     SVC6/2223, 
            1065 La Avenida, 
            Mountain View, CA, 94043
CV:       [pdf]
blog:    windowsontheory.org

Teaching:

Papers:

  • Antoine Delignat-Lavaud, Martin Abadi, Andrew Birrell, Ilya Mironov, Ted Wobber, and Yinglian Xie, "Web PKI: Closing the Gap between Guidelines and Practices", NDSS'14, February 2014.
    [pdf]
  • Martin Abadi, Dan Boneh, Ilya Mironov, Ananth Raghunathan, Gil Segev
    "Message-Locked Encryption for Lock-Dependent Messages"
    Advances in Cryptology—CRYPTO'13.
    [pdf]
  • Vipul Goyal, Ilya Mironov, Omkant Pandey, Amit Sahai
    "Accuracy-Privacy Tradeoffs for Two-party Differentially-Private Protocols"
    Advances in Cryptology—CRYPTO'13.
  • Martin Abadi, Andrew Birrell, Ilya Mironov, Ted Wobber, and Yinglian Xie
    "Global Authentication in an Untrustworthy World"
    Hot Topics in Operating Systems (HotOS'13).
  • Krishnaram Kenthapadi, Aleksandra Korolova, Ilya Mironov, Nina Mishra
    "Privacy via Johnson-Lindenstrauss Transform"
    Journal of Privacy and Confidentiality, to appear.
    [full version arXiv]
  • Ilya Mironov
    "On Significance of the Least Significant Bits For Differential Privacy"
    ACM Conference on Computer and Communications Security (CCS) 2012
    [bib] [full version pdf]
  • Yevgeniy Dodis, Adriana Lopez-Alt, Ilya Mironov, Salil Vadhan
    "Differential Privacy with Imperfect Randomness,"
    Advances in Cryptology—CRYPTO'12.
    [pdf] [bib] [full version eprint]
  • Ilya Mironov, Omkant Pandey, Omer Reingold, and Gil Segev,
    "Incremental Deterministic Public-Key Encryption,"
    Advances in Cryptology—EUROCRYPT'12.
    [pdf] [bib] [full version pdf]
  • Roy D'Souza, David Jao, Ilya Mironov, and Omkant Pandey,
    "Publicly Verifiable Secret Sharing for Cloud-Based Key Management,"
    Progress in Cryptology—INDOCRYPT'11, pp. 290-309
    [pdf] [bib]
  • Andrew McGregor, Ilya Mironov, Toniann Pitassi, Omer Reingold, Kunal Talwar, and Salil Vadhan
    "The Limits of Two-Party Differential Privacy,"
    Annual Symposium on Foundations of Computer Science (FOCS2010), pp. 81-90.
    [pdf] [bib] [full version ECCC]
  • Ilya Mironov
    "Domain extension for enhanced target collision-resistant hash functions,"
    Fast Software Encryption—FSE 2010, pp. 153–167.
    [pdf] [bib]
  • Ilya Mironov, Omkant Pandey, Omer Reingold, and Salil Vadhan,
    "Computational differential privacy",
    Advances in Cryptology—CRYPTO 2009, pp. 126–142. 
    [pdf] [bib
  • Frank McSherry and Ilya Mironov,
    "Differentially-private recommender systems: Building privacy into the Netflix Prize contenders",
    ACM SIGKDD International Conference on Knowledge Discovery and Data Mining—KDD 2009, pp. 627–636. 
    [pdf] [bib
  • Ilya Mironov, Moni Naor, and Gil Segev 
    "Sketching in Adversarial Environments," 
    ACM Symposium on Theory of Computing—STOC 2008, pp. 651–660.
    [pdf] [bib]
    SIAM Journal on Computing (Special Section), 40(6), pp. 1845-1870.
    [pdf] [bib]
  • Nathan Keller, Stephen D. Miller, Ilya Mironov, and Ramarathnam Venkatesan,
    "MV3: A New Word Based Stream Cipher Using Rapid Mixing and Revolving Buffers,"
    Topics in Cryptology—CT-RSA 2007, pp. 1–19.
    Full version: [ps] [pdf] [bib] [test vectors]
  • Philippe Golle, Frank McSherry, and Ilya Mironov,
    "Data Collection With Self-Enforcing Privacy,"
    ACM Conference on Computer and Communications Security—ACM CCS 2006, pp. 69–78, 2006. To appear in a special issue of ACM Transactions on Information and System Security.
    Conference version: [ps] [pdf] [ppt] [bib]
    Full version: [pdf]   
  • Joseph Bonneau and Ilya Mironov,
    "Cache-Collision Timing Attacks Against AES,"
    Cryptographic Hardware and Embedded Systems—CHES 2006, pp. 201–215, 2006.
    [ps] [pdf] [bib]
  • Ilya Mironov and Lintao Zhang,
    "Applications of SAT Solvers to Cryptanalysis of Hash Functions,"
    Theory and Applications of Satisfiability Testing—SAT 2006, pp. 102–115, 2006.
    Full version: [ps] [pdf] [bib] [ppt]
  • Ilya Mironov, Kobbi Nissim, and Anton Mityagin,
    "Hard Instances of the Constrained Discrete Logarithm Problem,"
    7th Algorithmic Number Theory Symposium—ANTS VII, pp. 582–598, 2006.
    Full version: [ps] [pdf] [bib] [ppt]
  • Cynthia Dwork, Krishnaram Kenthapadi, Frank McSherry, Ilya Mironov, and Moni Naor,
    "Our Data, Ourselves: Privacy via Distributed Noise Generation,"
    Advances in Cryptology—Eurocrypt 2006, pp. 486–503, 2006.
    [ps] [pdf] [bib]
  • Ilya Mironov,
    "Collision-resistant no more: hash-and-sign paradigm revisited,"
     Public Key Cryptography—PKC 2006, pp. 140–156, 2006.
    [ps] [pdf] [bib]
  • [Survey] Ilya Mironov,
    "Hash functions: Theory, attacks, and applications,"
    Technical Report TR-2005-187, Microsoft Research, November 2005.
    [ps] [pdf] [bib]
  • Dan Boneh, Ilya Mironov, and Victor Shoup,
    "Provably Secure Signature Scheme from Bilinear Mapping,"
    Topics in Cryptology—CT-RSA 2003, pp. 98–110, 2003.
    [ps] [pdf] [bib]
  • Ilya Mironov,
    "(Not So) Random Shuffles of RC4,"
    Advances in Cryptology—CRYPTO 2002, pp. 304–319, 2002.
    Full version: [ps] [pdf] [bib]
  • Philippe Golle, Stanislaw Jarecki, and Ilya Mironov,
    "Cryptographic Primitives Enforcing Communication and Storage Complexity,"
    Financial Cryptography 2002, pp. 120–135, 2002.
    [ps] [pdf] [bib]
  • Philippe Golle, Kevin Leyton-Brown, and Ilya Mironov,
    "Incentives for Sharing in Peer-to-Peer Networks,"
    ACM Conference on Electronic Commerce (EC-2001), pp. 264–267, 2001.
    [ps] [pdf] [bib]
    Full version with Mark Lillibridge in Proc. of WELCOM'01, pp. 75–87, 2001.
    [ps] [pdf] [bib]
  • Ilya Mironov,
    "A Note on Cryptanalysis of the Preliminary Version of the NTRU Signature Scheme,"
    Cryptology ePrint Archive, Report 2001/005.
    [ps] [pdf] [bib]
  • Ilya Mironov,
    "Hash Functions: From Merkle-Damgard to Shoup,"
    Advances in Cryptology—EUROCRYPT 2001, pp. 166–181, 2001.
    [ps] [pdf] [bib]
  • Philippe Golle and Ilya Mironov,
    "Uncheatable Distributed Computations,"
    Topics in Cryptology—CT-RSA 2001, pp. 425–440, 2001.
    [ps] [pdf] [bib]