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.
"synopsis" may belong to another edition of this title.
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)The author is an assistant professor in the School of Electrical Engineering of Tel Aviv University. He had postdoctoral positions in the Faculty of Mathematics and Computer Science of the Weizmann Institute of Science, and the Department of Computer Science of Princeton University. He received his PhD in 2007 from the Computer Science Department of the Technion for the dissertation "Cryptography in Constant Parallel Time"; this was honorably mentioned (runner-up) for the ACM Dissertation Award in 2007. His research interests include cryptography, computational complexity, and coding theory.
"About this title" may belong to another edition of this title.
Shipping:
£ 20.96
From Germany to U.S.A.
Seller: booksXpress, Bayonne, NJ, U.S.A.
Hardcover. Condition: new. Seller Inventory # 9783642173660
Quantity: 10 available
Seller: Lucky's Textbooks, Dallas, TX, U.S.A.
Condition: New. Seller Inventory # ABLIING23Mar3113020219993
Quantity: Over 20 available
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Condition: New. Seller Inventory # 12273334-n
Quantity: 5 available
Seller: SpringBooks, Berlin, Germany
Hardcover. Condition: As New. from Germany, will be dispatched immediately. Seller Inventory # CED-2406C-SAKKO-09-1000XS
Quantity: 1 available
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Condition: New. PRINT ON DEMAND Book; New; Fast Shipping from the UK. No. book. Seller Inventory # ria9783642173660_lsuk
Quantity: Over 20 available
Seller: Buchpark, Trebbin, Germany
Condition: Sehr gut. Zustand: Sehr gut - Gepflegter, sauberer Zustand. | Seiten: 212 | Sprache: Englisch | Produktart: Bücher. Seller Inventory # 10340028/2
Quantity: 1 available
Seller: Buchpark, Trebbin, Germany
Condition: Sehr gut. Zustand: Sehr gut | Seiten: 212 | Sprache: Englisch | Produktart: Bücher. Seller Inventory # 10340028/12
Quantity: 1 available
Seller: GreatBookPricesUK, Castle Donington, DERBY, United Kingdom
Condition: New. Seller Inventory # 12273334-n
Quantity: 5 available
Seller: Revaluation Books, Exeter, United Kingdom
Hardcover. Condition: Brand New. 2013 edition. 193 pages. 9.25x6.25x0.50 inches. In Stock. Seller Inventory # x-3642173667
Quantity: 2 available
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Buch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 212 pp. Englisch. Seller Inventory # 9783642173660
Quantity: 2 available