Overview
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.
Full Product Details
Author: Benny Applebaum
Publisher: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
Imprint: Springer-Verlag Berlin and Heidelberg GmbH & Co. K
Edition: 2011
Dimensions:
Width: 15.50cm
, Height: 1.30cm
, Length: 23.50cm
Weight: 4.439kg
ISBN: 9783642173660
ISBN 10: 3642173667
Pages: 193
Publication Date: 10 January 2014
Audience:
Professional and scholarly
,
Professional & Vocational
Format: Hardback
Publisher's Status: Active
Availability: Awaiting stock
The supplier is currently out of stock of this item. It will be ordered for you and placed on backorder. Once it does come back in stock, we will ship it out for you.
Reviews
From the book reviews: The book explores the minimal computational complexity of these cryptographic primitives necessary to keep them secure. ... This is an important book with groundbreaking results that will continue to influence research in this area for years to come. ... The ideal audience for this book comprises advanced graduate students or other researchers in the same field. (Burkhard Englert, Computing Reviews, August, 2014)
From the book reviews: The book explores the minimal computational complexity of these cryptographic primitives necessary to keep them secure. ... This is an important book with groundbreaking results that will continue to influence research in this area for years to come. ... The ideal audience for this book comprises advanced graduate students or other researchers in the same field. (Burkhard Englert, Computing Reviews, August, 2014)
From the book reviews: The book explores the minimal computational complexity of these cryptographic primitives necessary to keep them secure. ... This is an important book with groundbreaking results that will continue to influence research in this area for years to come. ... The ideal audience for this book comprises advanced graduate students or other researchers in the same field. (Burkhard Englert, Computing Reviews, August, 2014)
Author Information
The author is a postdoctoral fellow at the Weizmann Institute of Science; his related thesis was honorably mentioned (runner-up) for the ACM Dissertation Award in 2007.
