Publications — Arvind Narayanan

At UT Austin

• A. Narayanan, V. Shmatikov. How to Break Anonymity of the Netflix Prize Dataset. Oakland 2008. (online)
• I. Mironov, A. Narayanan Domain extensions for random oracles: beyond the birthday-paradox bound. ECRYPT Hash Workshop 2007.
• A. Narayanan, V. Shmatikov. Fast Dictionary Attacks on Passwords Using Time-Space Tradeoff. Proceedings of the 12th ACM conference on Computer and Communications Security, pages 364--372. (online)
• A. Narayanan, V. Shmatikov. Obfuscated Databases and Group Privacy. Proceedings of the 12th ACM conference on Computer and Communications Security, pages 102--111. (online)
• Related book chapter: A. Narayanan, V. Shmatikov. Uncircumventable Enforcement of Privacy Policies via Cryptographic Obfuscation, in "Digital Privacy: Theory, Technologies and Practices". Editors: Alessandro Acquisti, Sabrina De Capitani di Vimercati, Stefanos Gritzalis, and Costas Lambrinoudakis (to appear) (Amazon page)
• A. Narayanan, V. Shmatikov. On the Limits of Point Function Obfuscation. Manuscript. (online)

Undergrad/Master's work

• A. Narayanan, K. Srinathan, C. Pandu Rangan. Perfectly Reliable Message Transmission. Information Processing Letters 100:1, pages 23--28, 2006. (ACM portal)
• K. Srinathan, A. Narayanan, C. Pandu Rangan. Optimal Perfectly Secure Message Transmission. Advances in Cryptology -- CRYPTO 2004, volume 3152 of LNCS, pages 545--561.(ps)
• V. Vinod, A. Narayanan, K. Srinathan, C. Pandu Rangan, K. Kim. On the power of Computational Secret Sharing. Indocrypt 2003, volume 2904 of LNCS, pages 162--176.
• A. Narayanan, C. Pandu Rangan, K. Kim. Practical Pay TV Schemes. Australasian Conference on Information Security and Privacy (ACISP) 2003, volume 2727 of LNCS, pages 192--203.