Ilya Mironov

e-mail:	mironov@microsoft.com
phone:	(650)693-1850
ICQ:
mailing address:	SVC-5, 1065 La Avenida, Mountain View, CA 94043

Course: Stanford, Fall 2005, "Advanced Topics in Cryptanalysis," (CS359)
CV: [pdf]
Old web-page: Stanford

 Ilya Mironov, Moni Naor, and Gil Segev, "Sketching in Adversarial Environments,"
 ACM Symposium on Theory of Computing—STOC 2008, (to appear). [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. Invited to a special issue of ACM Transactions on Information and System Security. [ps] [pdf] [ppt] [bib]

 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]
       [in the media:] The New York Times, New Scientist, Slashdot.org

 Ilya Mironov, "In XOR we trust",
 Les Nouvelles d'APL, Mar. 1995, pp. 53–64 (In French).