Reading List : Complexity of Obfuscation
Each entry links to the corresponding PDF.
-
Boaz Barak, Oded Goldreich, Russell Impagliazzo, Steven
Rudich, Amit Sahai, Salil Vadhan, and Ke Yang. "On
the (Im)possibility of Obfuscating Programs." In Advances
in Cryptology - CRYPTO'01, vol. 2139 of Lecture Notes in
Computer Science, pp. 1-18, Santa Barbara, CA, August 19-23,
2001.
-
Shafi Goldwasser and Yael T. Kalai. "On
the Impossibility of Obfuscation with Auxiliary Input." In
Proceedings of the 46th Annual IEEE Symposium on Foundations
of Computer Science (October 23 - 25, 2005). FOCS. IEEE
Computer Society, Washington, DC, pp. 553-562.
-
Ron Canetti. "Towards
Realizing Random Oracles: Hash Functions That Hide All Partial
Information." In Proceedings of the 17th Annual
international Cryptology Conference on Advances in Cryptology
(August 17 - 21, 1997). B. S. Kaliski, Ed. Lecture Notes In
Computer Science, vol. 1294. Springer-Verlag, London,
pp. 455-469.
-
Hoeteck Wee. "On
obfuscating point functions." In Proceedings of the
Thirty-Seventh Annual ACM Symposium on theory of Computing
(Baltimore, MD, USA, May 22 - 24, 2005). STOC '05. ACM Press,
New York, NY, pp. 523-532.
-
Bejamin Lynn, Manoj Prabhakaran, and Amit Sahai. "Positive
results and techniques for obfuscation." In Cachin, C.,
Camenisch, J., eds.: EUROCRYPT. Volume 3027 of Lecture Notes
in Computer Science., Springer (2004) pp. 20-39.
-
Shafi Goldwasser and Guy N. Rothblum. "On
Best-Possible Obfuscation." TCC 2007, pp. 194-213.
-
Dennis Hofheinz, John Malone-Lee, and Martijn Stam. "Obfuscation
for Cryptographic Purposes." TCC 2007, pp. 214-232.
-
Susan Hohenberger, Guy N. Rothblum, Abhi Shelat, and Vinod
Vaikuntanathan. "Securely
Obfuscating Re-encryption." TCC 2007, pp. 233-252.
-
Narayanan, Shmatikov. "Obfuscated databases and group privacy" (CCS 2005).
-
Canetti, Micciancio, Reingold. "Perfectly one-way probabilistic hash functions" (STOC 1998) - they give the first provably secure construction for obfuscating point functions.
-
Dodis, Reyzin, and Smith. Fuzzy extractors: how to generate strong keys from biometrics and other noisy data (EUROCRYPT 2004).
-
Dodis and Smith. Correcting errors without leaking partial information (STOC 2005).
-
Benny Applebaum. "On Basing Lower-Bounds for Learning on Worst-Case Assumptions"
-
Mayank Varia, Ran Canetti. "Non-malleable obfuscation"
Last modified: Fri Jul 27 10:19:07 Central Daylight Time 2007