Limitar la búsqueda a ejemplares disponibles

Cubierta del libro
Autor Applebaum, Benny. author.

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

Descripción física XVI, 193 p. 3 illus. online resource.
text txt rdacontent
computer c rdamedia
online resource cr rdacarrier
text file PDF rda
Colección Information Security and Cryptography, 1619-7100
Information Security and Cryptography, 1619-7100
       Mostrar referencias similares
Springer eBooks. Computer Science
       Mostrar referencias similares
Contiene: 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.
Resumen: 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.
Materia Computer science.
Data structures (Computer science).
Computer science -- Mathematics.
Computer Science.
       Mostrar referencias similares
Mathematics of Computing.
       Mostrar referencias similares
Data Structures, Cryptology and Information Theory.
       Mostrar referencias similares
Autor secundario SpringerLink (Online service)
En Springer eBooks
OTRO SOPORTE Printed edition: 9783642173660
ISBN 9783642173677 978-3-642-17367-7
ISBN/ISSN 10.1007/978-3-642-17367-7 doi