Conference paper
Pinocchio: Nearly practical verifiable computation
Bryan Parno, Jon Howell, et al.
S&P 2013
Can we hide secrets in software? Can we obfuscate programs-that is, make programs unintelligible while preserving their functionality? What exactly do we mean by "unintelligible"? Why would we even want to do this? In this article, we describe some rigorous cryptographic answers to these quasi-philosophical questions. We also discuss our recent "candidate indistinguishability obfuscation" scheme and its implications.
Bryan Parno, Jon Howell, et al.
S&P 2013
Ran Canetti, Shai Halevi, et al.
TCC 2005
Shai Halevi, Danny Harnik, et al.
CCS 2011
Sanjam Garg, Craig Gentry, et al.
FOCS 2013