Central Library

Normal view MARC view ISBD view

Cryptography in Constant Parallel Time [electronic resource] / by Benny Applebaum.

By: Applebaum, Benny [author.].
Contributor(s): SpringerLink (Online service).
Material type: materialTypeLabelBookSeries: Information Security and Cryptography: Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2014Description: XVI, 193 p. 3 illus. online resource.Content type: text Media type: computer Carrier type: online resourceISBN: 9783642173677.Subject(s): Computer science | Data structures (Computer science) | Computer science -- Mathematics | Computer Science | Mathematics of Computing | Data Structures, Cryptology and Information TheoryAdditional physical formats: Printed edition:: No titleDDC classification: 004.0151 Online resources: Click here to access online
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.
In: Springer eBooksSummary: 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 simplicity and simultaneously provide a high level of security. Such constructions are highly parallelizable and they can be realized by Boolean circuits of constant depth.  This book establishes, for the first time, the possibility of local implementations for many basic cryptographic primitives such as one-way functions, pseudorandom generators, encryption schemes and digital signatures. It also extends these results to other stronger notions of locality, and addresses a wide variety of fundamental questions about local cryptography. The author's related thesis was honorably mentioned (runner-up) for the ACM Dissertation Award in 2007, and this book includes some expanded sections and proofs, and notes on recent developments.  The book assumes only a minimal background in computational complexity and cryptography and is therefore suitable for graduate students or researchers in related areas who are interested in parallel cryptography. It also introduces general techniques and tools which are likely to interest experts in the area.
    average rating: 0.0 (0 votes)
No physical items for this record

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.

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 simplicity and simultaneously provide a high level of security. Such constructions are highly parallelizable and they can be realized by Boolean circuits of constant depth.  This book establishes, for the first time, the possibility of local implementations for many basic cryptographic primitives such as one-way functions, pseudorandom generators, encryption schemes and digital signatures. It also extends these results to other stronger notions of locality, and addresses a wide variety of fundamental questions about local cryptography. The author's related thesis was honorably mentioned (runner-up) for the ACM Dissertation Award in 2007, and this book includes some expanded sections and proofs, and notes on recent developments.  The book assumes only a minimal background in computational complexity and cryptography and is therefore suitable for graduate students or researchers in related areas who are interested in parallel cryptography. It also introduces general techniques and tools which are likely to interest experts in the area.

There are no comments for this item.

Log in to your account to post a comment.