Cryptography in Constant Parallel Time
Author:   Benny Applebaum
Publisher:   Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
Edition:   Softcover reprint of the original 1st ed. 2014
ISBN:  

9783662507131


Pages:   193
Publication Date:   23 August 2016
Format:   Paperback
Availability:   Manufactured on demand   Availability explained
We will order this item for you from a manufactured on demand supplier.

Our Price $145.17 Quantity:  
Add to Cart

Share |

Cryptography in Constant Parallel Time


Add your own review!

Overview

Full Product Details

Author:   Benny Applebaum
Publisher:   Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
Imprint:   Springer-Verlag Berlin and Heidelberg GmbH & Co. K
Edition:   Softcover reprint of the original 1st ed. 2014
Dimensions:   Width: 15.50cm , Height: 1.10cm , Length: 23.50cm
Weight:   3.285kg
ISBN:  

9783662507131


ISBN 10:   3662507137
Pages:   193
Publication Date:   23 August 2016
Audience:   Professional and scholarly ,  Professional & Vocational
Format:   Paperback
Publisher's Status:   Active
Availability:   Manufactured on demand   Availability explained
We will order this item for you from a manufactured on demand supplier.

Table of Contents

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.

Reviews

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)


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)


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)


Author Information

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.

Tab Content 6

Author Website:  

Customer Reviews

Recent Reviews

No review item found!

Add your own review!

Countries Available

All regions
Latest Reading Guide

MRG2025CC

 

Shopping Cart
Your cart is empty
 Shopping cart
Mailing List

 

Sign up now