Cryptography in Constant Parallel Time

Name: Cryptography in Constant Parallel Time
Price: 101.37 AUD
Availability: OutOfStock
ISBN: 9783642173660

Benny Applebaum

$126.95 $101.37

Hardback

Not in-store but you can order this
How long will it take?

Availability Information

We source books from suppliers in Australia and overseas. For books we don't currently have in stock, the time it takes to get them from our suppliers can vary widely - from a few days to a few months - so we check each book with each supplier to determine the expected time it will take to be supplied to us.

We will update you on expected arrival time to us. If this delay is too long, please let us know within 2 business days and we can give you options regarding cancelling or adjusting your order. More details on cancelling your order can be found in our Terms of Trade.

To find out the anticipated arrival time for specific items prior to ordering, please contact us by phone or email:

Phone +61 2 9264 3111, or 1800 4 BOOKS (1800 4 26657) if outside Sydney:
option 1 Abbey's Bookshop (Crime, History, Science, Kids & more) • info@abbeys.com.au
option 2 Language Book Centre (ESL & Foreign Languages) • language@abbeys.com.au
option 3 Galaxy Bookshop (Sci-fi, Fantasy, Romance, Graphic Novels) • sf@galaxybooks.com.au

QTY:

English

Springer-Verlag Berlin and Heidelberg GmbH & Co. K
10 January 2014

Algorithms & data structures; Computer security; Mathematical theory of computation

Series: Information Security and Cryptography

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.

By: Benny Applebaum
Imprint: Springer-Verlag Berlin and Heidelberg GmbH & Co. K
Country of Publication: Germany
Edition: 2011
Dimensions: Height: 235mm, Width: 155mm, Spine: 13mm
Weight: 4.439kg
ISBN: 9783642173660
ISBN 10: 3642173667
Series: Information Security and Cryptography
Pages: 193
Publication Date: 10 January 2014
Audience: Professional and scholarly , Undergraduate
Format: Hardback
Publisher's Status: Active

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.

The author is a postdoctoral fellow at the Weizmann Institute of Science; his related thesis was honorably mentioned (runner-up) for the ACM Dissertation Award in 2007.

Reviews for Cryptography in Constant Parallel Time

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)