Paper 2018/1218
Exploring Crypto Dark Matter: New Simple PRF Candidates and Their Applications
Dan Boneh, Yuval Ishai, Alain Passelègue, Amit Sahai, and David J. Wu
Abstract
Pseudorandom functions (PRFs) are one of the fundamental building blocks in cryptography. We explore a new space of plausible PRF candidates that are obtained by mixing linear functions over different small moduli. Our candidates are motivated by the goals of maximizing simplicity and minimizing complexity measures that are relevant to cryptographic applications such as secure multiparty computation.
We present several concrete new PRF candidates that follow the above approach. Our main candidate is a weak PRF candidate (whose conjectured pseudorandomness only holds for uniformly random inputs) that first applies a secret mod-2 linear mapping to the input, and then a public mod-3 linear mapping to the result. This candidate can be implemented by depth-2
Metadata
- Available format(s)
-
PDF
- Publication info
- A major revision of an IACR publication in TCC 2018
- Contact author(s)
- alain passelegue @ inria fr
- History
- 2018-12-30: received
- Short URL
- https://ia.cr/2018/1218
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2018/1218, author = {Dan Boneh and Yuval Ishai and Alain Passelègue and Amit Sahai and David J. Wu}, title = {Exploring Crypto Dark Matter: New Simple {PRF} Candidates and Their Applications}, howpublished = {Cryptology {ePrint} Archive, Paper 2018/1218}, year = {2018}, url = {https://eprint.iacr.org/2018/1218} }