My research page

  • Dan Boneh, Ilya Mironov, Victor Shoup,
        "Provably Secure Signature Scheme from Bilinear Mapping," To appear in Proc. of RSA-CT'03. [ps] [pdf]

  • Ilya Mironov, "(Not So) Random Shuffles of RC4,"
        In Proc. of Crypto'02, pp. 304-319, 2002. Full version: [ps] [pdf]

  • Philippe Golle, Stanislaw Jarecki, and Ilya Mironov, "Cryptographic Primitives Enforcing Communication and Storage Complexity,"
        To appear in Proc. of Financial Crypto'02, 2002. [ps] [pdf]

  • Philippe Golle, Kevin Leyton-Brown, and Ilya Mironov, "Incentives for Sharing in Peer-to-Peer Networks,"
        Proc. of Electronic Commerce'01, 2001. [ps] [pdf] Full version with Mark Lillibridge in Proc. of WELCOM'01. [ps] [pdf]

  • Ilya Mironov, "A Note on Cryptanalysis of the Preliminary Version of the NTRU Signature Scheme,"
        Cryptology ePrint Archive, Report 2001/005. [ps] [pdf]

  • Ilya Mironov, "Hash Functions: From Merkle-Damgard to Shoup,"
        Proc. of Eurocrypt 2001, pp. 166–181, 2001. [ps] [pdf]

  • Philippe Golle and Ilya Mironov, "Uncheatable Distributed Computations,"
        Topics in Cryptology – CT-RSA 2001, pp. 425–440, 2001. [ps] [pdf]
        [in the media:] The New York Times, New Scientist,

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

  • Victor Bargatchev and Ilya Mironov, “Is APL2 a Competitive Language?”,
        Proc. of APL94, APL Quote Quad, Vol. 25, No. 1, Sep. 1994, pp. 163–175 (Reprinted in Newsletter for Toronto Chapter of ACM APL SIG, Vol. 2, No. 8, Oct. 95).

  • Back home


    CS Department

    Theory Division

    Crypto Group