Cryptography in Constant Parallel Time (Record no. 54050)
[ view plain ]
| 000 -LEADER | |
|---|---|
| fixed length control field | 03392nam a22004935i 4500 |
| 001 - CONTROL NUMBER | |
| control field | 978-3-642-17367-7 |
| 005 - DATE AND TIME OF LATEST TRANSACTION | |
| control field | 20200421111204.0 |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION | |
| fixed length control field | 131219s2014 gw | s |||| 0|eng d |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
| ISBN | 9783642173677 |
| -- | 978-3-642-17367-7 |
| 082 04 - CLASSIFICATION NUMBER | |
| Call Number | 004.0151 |
| 100 1# - AUTHOR NAME | |
| Author | Applebaum, Benny. |
| 245 10 - TITLE STATEMENT | |
| Title | Cryptography in Constant Parallel Time |
| 300 ## - PHYSICAL DESCRIPTION | |
| Number of Pages | XVI, 193 p. 3 illus. |
| 490 1# - SERIES STATEMENT | |
| Series statement | Information Security and Cryptography, |
| 505 0# - FORMATTED CONTENTS NOTE | |
| Remark 2 | 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. |
| 520 ## - SUMMARY, ETC. | |
| Summary, etc | 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. |
| 650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| General subdivision | Mathematics. |
| 856 40 - ELECTRONIC LOCATION AND ACCESS | |
| Uniform Resource Identifier | http://dx.doi.org/10.1007/978-3-642-17367-7 |
| 942 ## - ADDED ENTRY ELEMENTS (KOHA) | |
| Koha item type | eBooks |
| 264 #1 - | |
| -- | Berlin, Heidelberg : |
| -- | Springer Berlin Heidelberg : |
| -- | Imprint: Springer, |
| -- | 2014. |
| 336 ## - | |
| -- | text |
| -- | txt |
| -- | rdacontent |
| 337 ## - | |
| -- | computer |
| -- | c |
| -- | rdamedia |
| 338 ## - | |
| -- | online resource |
| -- | cr |
| -- | rdacarrier |
| 347 ## - | |
| -- | text file |
| -- | |
| -- | rda |
| 650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| -- | Computer science. |
| 650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| -- | Data structures (Computer science). |
| 650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| -- | Computer science |
| 650 14 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| -- | Computer Science. |
| 650 24 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| -- | Mathematics of Computing. |
| 650 24 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| -- | Data Structures, Cryptology and Information Theory. |
| 830 #0 - SERIES ADDED ENTRY--UNIFORM TITLE | |
| -- | 1619-7100 |
| 912 ## - | |
| -- | ZDB-2-SCS |
No items available.