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