At the heart of the Center’s research activities are the development of new mathematical techniques, to build faster and more secure general-purpose obfuscation mechanisms. In pursuit of this, we tackle many technical questions, such as: Can secure general-purpose mechanisms avoid the inefficiency overhead that arises from Barrington’s Theorem? Can the security of obfuscation mechanisms be proven to hold against idealized adversaries, or be based on natural non-interactive hardness assumptions? Can general-purpose obfuscation be securely leveraged to protect data from rogue insiders, who must be able to access some data in the clear? Finally, can obfuscation mechanisms be used to reduce the level of interaction required to accomplish secure communication and computation tasks?
Please see our publications page for more information about the Center's research.