Authors:
- The author's related thesis was honorably mentioned (runner-up) for the ACM Dissertation Award in 2007
- Assumes only a minimal background in computational complexity and cryptography
- Introduces general techniques and tools of interest to experts in the area
- Includes supplementary material: sn.pub/extras
Part of the book series: Information Security and Cryptography (ISC)
Buy it now
Buying options
Tax calculation will be finalised at checkout
Other ways to access
This is a preview of subscription content, log in via an institution to check for access.
Table of contents (8 chapters)
-
Front Matter
-
Back Matter
About this book
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.
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)Authors and Affiliations
-
Tel Aviv University, School of Electrical Engineering, Tel Aviv, Israel
Benny Applebaum
About the author
The author is an assistant professor in the School of Electrical Engineering of Tel Aviv University. He had postdoctoral positions in the Faculty of Mathematics and Computer Science of the Weizmann Institute of Science, and the Department of Computer Science of Princeton University. He received his PhD in 2007 from the Computer Science Department of the Technion for the dissertation "Cryptography in Constant Parallel Time"; this was honorably mentioned (runner-up) for the ACM Dissertation Award in 2007. His research interests include cryptography, computational complexity, and coding theory.
Bibliographic Information
Book Title: Cryptography in Constant Parallel Time
Authors: Benny Applebaum
Series Title: Information Security and Cryptography
DOI: https://doi.org/10.1007/978-3-642-17367-7
Publisher: Springer Berlin, Heidelberg
eBook Packages: Computer Science, Computer Science (R0)
Copyright Information: Springer-Verlag Berlin Heidelberg 2014
Hardcover ISBN: 978-3-642-17366-0Published: 10 January 2014
Softcover ISBN: 978-3-662-50713-1Published: 23 August 2016
eBook ISBN: 978-3-642-17367-7Published: 19 December 2013
Series ISSN: 1619-7100
Series E-ISSN: 2197-845X
Edition Number: 1
Number of Pages: XVI, 193
Number of Illustrations: 3 b/w illustrations
Topics: Mathematics of Computing, Data Structures and Information Theory