Paper 2015/165
The Cryptographic Hardness of Random Local Functions -- Survey
Benny Applebaum
Abstract
Constant parallel-time cryptography allows to perform complex cryptographic tasks at an ultimate level of parallelism, namely, by local functions
that each of their output bits depend on a constant number of input bits. A natural way to obtain local cryptographic constructions is to use \emph{random local functions} in which each output bit is computed by applying some fixed
Metadata
- Available format(s)
-
PDF
- Category
- Foundations
- Publication info
- A major revision of an IACR publication in TCC 2013
- Keywords
- local cryptographyconstant-depth circuitsNC0one-way functionspseudorandom generatorshash functionspublic-key encryption
- Contact author(s)
- benny applebaum @ gmail com
- History
- 2015-02-27: received
- Short URL
- https://ia.cr/2015/165
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2015/165, author = {Benny Applebaum}, title = {The Cryptographic Hardness of Random Local Functions -- Survey}, howpublished = {Cryptology {ePrint} Archive, Paper 2015/165}, year = {2015}, url = {https://eprint.iacr.org/2015/165} }