Cryptography in Constant Parallel Time

Locally computable (NC0) functions are "simple" functions for which every bit of the output can be computed by reading a small number of bits of their input. The study of locally computable cryptography attempts to construct cryptographic functions that achieve this strong notion of simpli...

Full description

Main Author: Applebaum, Benny.
Corporate Author: SpringerLink (Online service)
Format: Electronic
Language: English
Published: Berlin, Heidelberg : Springer Berlin Heidelberg : 2014.
Series: Information Security and Cryptography,
Subjects:
Online Access: http://dx.doi.org/10.1007/978-3-642-17367-7
Tags: Add Tag
No Tags, Be the first to tag this record!
Table of Contents:
  • Introduction
  • Preliminaries and Definitions
  • Randomized Encoding of Functions
  • Cryptography in NC0
  • Computationally Private Randomizing Polynomials and Their Applications
  • On Pseudorandom Generators with Linear Stretch in NC0
  • Cryptography with Constant Input Locality
  • One-Way Functions with Optimal Output Locality
  • App. A, On Collections of Cryptographic Primitives.