Cryptography in NC0

Research output: Chapter in Book/Report/Conference proceedingChapter

Abstract

In this chapter we show that randomized encoding preserves the security of many cryptographic primitives. We also construct an (information-theoretic) encoding in $\mathbf{NC}^{0}:{4}$ for any function in NC 1 or even ⊕L/poly. The combination of these results gives a compiler that takes as an input a code of an NC 1 implementation of some cryptographic primitive and generates an $\mathbf{NC}^{0}:{4}$ implementation of the same primitive.

Original languageEnglish
Title of host publicationInformation Security and Cryptography
PublisherSpringer Verlag
Pages33-78
Number of pages46
DOIs
StatePublished - 2014

Publication series

NameInformation Security and Cryptography
Volume19
ISSN (Print)1619-7100

All Science Journal Classification (ASJC) codes

  • Safety, Risk, Reliability and Quality
  • Computer Networks and Communications
  • Computational Theory and Mathematics
  • Information Systems and Management

Fingerprint

Dive into the research topics of 'Cryptography in NC0'. Together they form a unique fingerprint.

Cite this