Cryptography in constant parallel time / Benny Applebaum.
Material type:
TextSeries: Information security and cryptographyPublication details: Berlin : Springer-Verlag, 2014.Description: xvi, 193 pISBN: - 9783642173660
- 23 Ap648 005.82
| Item type | Current library | Call number | Status | Date due | Barcode | Item holds | |
|---|---|---|---|---|---|---|---|
| Books | ISI Library, Kolkata | 005.82 Ap648 (Browse shelf(Opens below)) | Available | 135541 |
Browsing ISI Library, Kolkata shelves Close shelf browser (Hides shelf browser)
| No cover image available | ||||||||
| 005.8 Z54 Multimedia security technologies for digital rights management | 005.8 Z91 Trust and security in collaborative computing | 005.8068 T783 Managing information systems security and privacy | 005.82 Ap648 Cryptography in constant parallel time / | 005.82 As844 Quantum cryptography and secret-key distillation | 005.82 B221 Watermarking systems engineering | 005.82 B245 Algebraic cryptanalysis |
Includes bibliographical references.
1. Introduction --
2. Preliminaries and Definitions --
3. Randomized Encoding of Functions --
4. Cryptography in NC0 --
5. Computationally Private Randomizing Polynomials and Their Applications --
6. One-Way functions with optimal output locality--
7. On Pseudorandom Generators with Linear Stretch in NC0 --
8. Cryptography with Constant Input Locality --
References.
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 on this title.
