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 NC40 for any function in NC1 or even circle plus L/poly. The combination of these results gives a compiler that takes as an input a code of an NC1 implementation of some cryptographic primitive and generates an NC40 implementation of the same primitive.
Original languageEnglish
Title of host publicationCRYPTOGRAPHY IN CONSTANT PARALLEL TIME
PublisherSpringer Verlag
Pages33-78
Number of pages46
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 'Cryptography in NC0'. Together they form a unique fingerprint.

Cite this