Cryptography In Constant Parallel Time
Download Cryptography In Constant Parallel Time PDF/ePub or read online books in Mobi eBooks. Click Download or Read Online button to get Cryptography In Constant Parallel Time book now. This website allows unlimited access to, at the time of writing, more than 1.5 million titles, including hundreds of thousands of titles in various foreign languages.
Cryptography in Constant Parallel Time
Author: Benny Applebaum
language: en
Publisher: Springer Science & Business Media
Release Date: 2013-12-19
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.
Tutorials on the Foundations of Cryptography
This is a graduate textbook of advanced tutorials on the theory of cryptography and computational complexity. In particular, the chapters explain aspects of garbled circuits, public-key cryptography, pseudorandom functions, one-way functions, homomorphic encryption, the simulation proof technique, and the complexity of differential privacy. Most chapters progress methodically through motivations, foundations, definitions, major results, issues surrounding feasibility, surveys of recent developments, and suggestions for further study. This book honors Professor Oded Goldreich, a pioneering scientist, educator, and mentor. Oded was instrumental in laying down the foundations of cryptography, and he inspired the contributing authors, Benny Applebaum, Boaz Barak, Andrej Bogdanov, Iftach Haitner, Shai Halevi, Yehuda Lindell, Alon Rosen, and Salil Vadhan, themselves leading researchers on the theory of cryptography and computational complexity. The book is appropriate for graduate tutorials and seminars, and for self-study by experienced researchers, assuming prior knowledge of the theory of cryptography.
Theory of Cryptography
The four-volume set LNCS 15364-15367 constitutes the refereed proceedings of the 22nd International Conference on Theory of Cryptography, TCC 2024, held in Milan, Italy, in December 2024. The total of 68 full papers presented in the proceedings was carefully reviewed and selected from 172 submissions. They focus on topics such as: proofs; math and foundations; consensus and messaging; quantum; kolmogorov and OWFs; encryption; quantum and black-box separations; authentication and sequentiality; obfuscation and homomorphism; multi-party computation; information-theoretic cryptography; and secret sharing.