Ilya Mironov

	2009
20		Ilya Mironov, Omkant Pandey, Omer Reingold, Salil P. Vadhan: Computational Differential Privacy. CRYPTO 2009: 126-142
19		Frank McSherry, Ilya Mironov: Differentially private recommender systems: building privacy into the net. KDD 2009: 627-636
	2008
18		Ilya Mironov, Moni Naor, Gil Segev: Sketching in adversarial environments. STOC 2008: 651-660
17		Philippe Golle, Frank McSherry, Ilya Mironov: Data Collection with Self-Enforcing Privacy. ACM Trans. Inf. Syst. Secur. 12(2): (2008)
	2007
16		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
15		Philippe Golle, Frank McSherry, Ilya Mironov: Data collection with self-enforcing privacy. ACM Conference on Computer and Communications Security 2006: 69-78
14		Ilya Mironov, Anton Mityagin, Kobbi Nissim: Hard Instances of the Constrained Discrete Logarithm Problem. ANTS 2006: 582-598
13		Joseph Bonneau, Ilya Mironov: Cache-Collision Timing Attacks Against AES. CHES 2006: 201-215
12		Cynthia Dwork, Krishnaram Kenthapadi, Frank McSherry, Ilya Mironov, Moni Naor: Our Data, Ourselves: Privacy Via Distributed Noise Generation. EUROCRYPT 2006: 486-503
11		Ilya Mironov: Collision-Resistant No More: Hash-and-Sign Paradigm Revisited. Public Key Cryptography 2006: 140-156
10		Ilya Mironov, Lintao Zhang: Applications of SAT Solvers to Cryptanalysis of Hash Functions. SAT 2006: 102-115
9		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)
8		Ilya Mironov, Anton Mityagin, Kobbi Nissim: Hard Instances of the Constrained Discrete Logarithm Problem CoRR abs/math/0606771: (2006)
	2003
7		Dan Boneh, Ilya Mironov, Victor Shoup: A Secure Signature Scheme from Bilinear Maps. CT-RSA 2003: 98-110
	2002
6		Ilya Mironov: (Not So) Random Shuffles of RC4. CRYPTO 2002: 304-319
5		Philippe Golle, Stanislaw Jarecki, Ilya Mironov: Cryptographic Primitives Enforcing Communication and Storage Complexity. Financial Cryptography 2002: 120-135
	2001
4		Philippe Golle, Kevin Leyton-Brown, Ilya Mironov: Incentives for sharing in peer-to-peer networks. ACM Conference on Electronic Commerce 2001: 264-267
3		Philippe Golle, Ilya Mironov: Uncheatable Distributed Computations. CT-RSA 2001: 425-440
2		Ilya Mironov: Hash Functions: From Merkle-Damgård to Shoup. EUROCRYPT 2001: 166-181
1		Philippe Golle, Kevin Leyton-Brown, Ilya Mironov, Mark Lillibridge: Incentives for Sharing in Peer-to-Peer Networks. WELCOM 2001: 75-87

Coauthor Index

1	Dan Boneh	[7]
2	Joseph Bonneau	[13]
3	Cynthia Dwork	[12]
4	Philippe Golle	[1] [3] [4] [5] [15] [17]
5	Stanislaw Jarecki	[5]
6	Nathan Keller	[9] [16]
7	Krishnaram Kenthapadi	[12]
8	Kevin Leyton-Brown	[1] [4]
9	Mark Lillibridge	[1]
10	Frank McSherry	[12] [15] [17] [19]
11	Stephen D. Miller	[9] [16]
12	Anton Mityagin	[8] [14]
13	Moni Naor	[12] [18]
14	Kobbi Nissim	[8] [14]
15	Omkant Pandey	[20]
16	Omer Reingold	[20]
17	Gil Segev	[18]
18	Victor Shoup	[7]
19	Salil P. Vadhan	[20]
20	Ramarathnam Venkatesan	[9] [16]
21	Lintao Zhang	[10]

Colors in the list of coauthors