Cryptography in Constant Parallel Time (Information Security and Cryptography)
Applebaum, Benny
ISBN 10: 3642173667 ISBN 13: 9783642173660
Published by Springer, 2014
New
Hardcover
From
Best Price, Torrance, CA, U.S.A.
Seller rating 5 out of 5 stars
AbeBooks Seller since August 30, 2024
This specific item is no longer available.
About this Item
Description:
SUPER FAST SHIPPING. Seller Inventory # 9783642173660
Synopsis:
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.
About the Author:
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.
Bibliographic Details
Title: Cryptography in Constant Parallel Time (...
Publisher: Springer
Publication Date: 2014
Binding: Hardcover
Condition: New
Top Search Results from the AbeBooks Marketplace
Stock Image
Cryptography in Constant Parallel Time
Published by
Springer Berlin Heidelberg, 2014
ISBN 10: 3642173667
ISBN 13: 9783642173660
Used
Hardcover
Seller: Buchpark, Trebbin, Germany
Seller rating 5 out of 5 stars
Condition: Sehr gut. Zustand: Sehr gut | Sprache: Englisch | Produktart: Bücher. Seller Inventory # 10340028/2
Stock Image
Cryptography in Constant Parallel Time
Published by
Springer Berlin Heidelberg, 2014
ISBN 10: 3642173667
ISBN 13: 9783642173660
Used
Hardcover
Seller: Buchpark, Trebbin, Germany
Seller rating 5 out of 5 stars
Condition: Sehr gut. Zustand: Sehr gut | Sprache: Englisch | Produktart: Bücher. Seller Inventory # 10340028/12
Stock Image
Cryptography in Constant Parallel Time (Information Security and Cryptography) [Hardcover] Applebaum, Benny
Seller: SpringBooks, Berlin, Germany
Seller rating 5 out of 5 stars
Hardcover. Condition: As New. from Germany, will be dispatched immediately. Seller Inventory # CED-2406C-SAKKO-09-1000XS
Stock Image
Applebaum,B.:Cryptography in Constant (eng)
Print on DemandSeller: Brook Bookstore On Demand, Napoli, NA, Italy
Seller rating 4 out of 5 stars
Condition: new. Questo è un articolo print on demand. Seller Inventory # 7d965bb89f96d318740692223438071e
Seller Image
Cryptography in Constant Parallel Time
Published by
Springer Berlin Heidelberg, 2014
ISBN 10: 3642173667
ISBN 13: 9783642173660
New
Hardcover
Seller: moluna, Greven, Germany
Seller rating 4 out of 5 stars
Gebunden. Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. The author s related thesis was honorably mentioned (runner-up) for the ACM Dissertation Award in 2007Assumes only a minimal background in computational complexity and cryptographyIntroduces general techniques and tools of interest to exper. Seller Inventory # 5051410
Buy New
US$ 57.89
Shipping:
US$ 56.93
From Germany to U.S.A.
Quantity: Over 20 available
Seller Image
Cryptography in Constant Parallel Time
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Seller rating 5 out of 5 stars
Condition: New. Seller Inventory # 12273334-n
Stock Image
Cryptography in Constant Parallel Time (Information Security and Cryptography)
Seller: Lucky's Textbooks, Dallas, TX, U.S.A.
Seller rating 5 out of 5 stars
Condition: New. Seller Inventory # ABLIING23Mar3113020219993
Cryptography in Constant Parallel Time
Print on DemandSeller: preigu, Osnabrück, Germany
Seller rating 5 out of 5 stars
Buch. Condition: Neu. Cryptography in Constant Parallel Time | Benny Applebaum | Buch | xvi | Englisch | 2014 | Springer | EAN 9783642173660 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu Print on Demand. Seller Inventory # 107101137
Seller Image
Cryptography in Constant Parallel Time
Published by
Springer Berlin Heidelberg, 2014
ISBN 10: 3642173667
ISBN 13: 9783642173660
New
Hardcover
Seller: AHA-BUCH GmbH, Einbeck, Germany
Seller rating 5 out of 5 stars
Buch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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. Seller Inventory # 9783642173660
Seller Image
Cryptography in Constant Parallel Time
Published by
Springer Berlin Heidelberg Jan 2014, 2014
ISBN 10: 3642173667
ISBN 13: 9783642173660
New
Hardcover
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Seller rating 5 out of 5 stars
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