One-Way Functions with Optimal Output Locality

Research output: Chapter in Book/Report/Conference proceedingChapter

Abstract

In Chap. 4 it was shown that, under relatively mild assumptions, there exist one-way functions (OWFs) in NC40. This result is not far from optimal as there is no OWF in NC20. In this chapter we partially close this gap by providing an evidence for the existence of OWF in NC30. This is done in two steps: (1) we describe a new variant of randomized encoding that allows us to obtain a OWF in NC30 from a "robust" OWF which remains hard to invert even when some information on the preimage x is leaked; (2) we show how to construct a robust OWF assuming that a random function of (arbitrarily large) constant locality is one-way. (A similar assumption was previously made by Goldreich in Electron. Colloq. Comput. Complex. 7: 090, 2000.)
Original languageEnglish
Title of host publicationCRYPTOGRAPHY IN CONSTANT PARALLEL TIME
PublisherSpringer Verlag
Pages107-121
Number of pages15
ISBN (Print)978-3-642-17367-7; 978-3-642-17366-0
DOIs
StatePublished - 2014

Publication series

NameInformation Security and Cryptography Texts and Monographs

Fingerprint

Dive into the research topics of 'One-Way Functions with Optimal Output Locality'. Together they form a unique fingerprint.

Cite this