You are looking at a specific version 20140518:201904 of this paper. See the latest version.

Paper 2014/301

How to Avoid Obfuscation Using Witness PRFs

Mark Zhandry

Abstract

Recently, program obfuscation has proven to be an extremely powerful tool and has been used to construct a variety of cryptographic primitives with amazing properties. However, current candidate obfuscators are far from practical and rely on unnatural hardness assumptions about multilinear maps. In this work, we bring several applications of obfuscation closer to practice by showing that a weaker primitive called witness pseudorandom functions (witness PRFs) suces. Applications include multiparty key exchange without trusted setup, polynomially-many hardcore bits for any one-way function, and more. We then show how to instantiate witness PRFs from multilinear maps. Our witness PRFs are simpler and more ecient than current obfuscation candidates, and involve very natural hardness assumptions about the underlying maps.

Note: Mostly typo fixes.

Metadata
Available format(s)
PDF
Category
Foundations
Publication info
Preprint. MINOR revision.
Keywords
Multilinear mapsobfuscation
Contact author(s)
mzhandry @ stanford edu
History
2015-03-08: last of 3 revisions
2014-04-30: received
See all versions
Short URL
https://ia.cr/2014/301
License
Creative Commons Attribution
CC BY
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.