000 03392nam a22004935i 4500
001 978-3-642-17367-7
003 DE-He213
005 20200421111204.0
007 cr nn 008mamaa
008 131219s2014 gw | s |||| 0|eng d
020 _a9783642173677
_9978-3-642-17367-7
024 7 _a10.1007/978-3-642-17367-7
_2doi
050 4 _aQA76.9.M35
072 7 _aUYA
_2bicssc
072 7 _aUYAM
_2bicssc
072 7 _aCOM018000
_2bisacsh
072 7 _aMAT003000
_2bisacsh
082 0 4 _a004.0151
_223
100 1 _aApplebaum, Benny.
_eauthor.
245 1 0 _aCryptography in Constant Parallel Time
_h[electronic resource] /
_cby Benny Applebaum.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2014.
300 _aXVI, 193 p. 3 illus.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aInformation Security and Cryptography,
_x1619-7100
505 0 _aIntroduction -- 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 _aLocally 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 _aComputer science.
650 0 _aData structures (Computer science).
650 0 _aComputer science
_xMathematics.
650 1 4 _aComputer Science.
650 2 4 _aMathematics of Computing.
650 2 4 _aData Structures, Cryptology and Information Theory.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783642173660
830 0 _aInformation Security and Cryptography,
_x1619-7100
856 4 0 _uhttp://dx.doi.org/10.1007/978-3-642-17367-7
912 _aZDB-2-SCS
942 _cEBK
999 _c54050
_d54050