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.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
À propos de l?auteur
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.
Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.
Autres éditions populaires du même titre
Résultats de recherche pour Cryptography in Constant Parallel Time
Image d'archives
Applebaum:Cryptography in Constant Para (eng)
impression à la demandeVendeur : Brook Bookstore On Demand, Napoli, NA, Italie
Évaluation du vendeur 4 sur 5 étoiles
Etat : new. Questo è un articolo print on demand. N° de réf. du vendeur 6930de58681509a49bbd148d6e9e40f4
Acheter neuf
EUR 46,22
Frais de port :
EUR 24,20
De Italie vers Etats-Unis
Quantité disponible : Plus de 20 disponibles
Image fournie par le vendeur
Cryptography in Constant Parallel Time
Edité par
Springer Berlin Heidelberg Aug 2016, 2016
ISBN 10 : 3662507137
ISBN 13 : 9783662507131
Neuf
Taschenbuch
Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Taschenbuch. Etat : 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. N° de réf. du vendeur 9783662507131
Acheter neuf
EUR 53,49
Frais de port :
EUR 23
De Allemagne vers Etats-Unis
Quantité disponible : 2 disponible(s)
Image d'archives
Cryptography in Constant Parallel Time (Information Security and Cryptography)
Vendeur : Books Puddle, New York, NY, Etats-Unis
Évaluation du vendeur 4 sur 5 étoiles
Etat : New. N° de réf. du vendeur 26374996864
Acheter neuf
EUR 75,30
Frais de port :
EUR 3,45
Vers Etats-Unis
Quantité disponible : 4 disponible(s)
Image d'archives
Cryptography in Constant Parallel Time (Information Security and Cryptography)
impression à la demandeVendeur : Majestic Books, Hounslow, Royaume-Uni
Évaluation du vendeur 4 sur 5 étoiles
Etat : New. Print on Demand. N° de réf. du vendeur 372129887
Acheter neuf
EUR 78,60
Frais de port :
EUR 7,39
De Royaume-Uni vers Etats-Unis
Quantité disponible : 4 disponible(s)
Image d'archives
Cryptography in Constant Parallel Time (Information Security and Cryptography)
impression à la demandeVendeur : Biblios, Frankfurt am main, HESSE, Allemagne
Évaluation du vendeur 4 sur 5 étoiles
Etat : New. PRINT ON DEMAND. N° de réf. du vendeur 18374996874
Acheter neuf
EUR 79,49
Frais de port :
EUR 9,95
De Allemagne vers Etats-Unis
Quantité disponible : 4 disponible(s)
Image fournie par le vendeur
Cryptography in Constant Parallel Time
Edité par
Springer Berlin Heidelberg, 2016
ISBN 10 : 3662507137
ISBN 13 : 9783662507131
Neuf
Couverture souple
Vendeur : moluna, Greven, Allemagne
Évaluation du vendeur 4 sur 5 étoiles
Etat : 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. N° de réf. du vendeur 449137416
Acheter neuf
EUR 48,37
Frais de port :
EUR 48,99
De Allemagne vers Etats-Unis
Quantité disponible : Plus de 20 disponibles
Image fournie par le vendeur
Cryptography in Constant Parallel Time
Edité par
Springer Berlin Heidelberg, Springer Berlin Heidelberg Aug 2016, 2016
ISBN 10 : 3662507137
ISBN 13 : 9783662507131
Neuf
Taschenbuch
Vendeur : buchversandmimpf2000, Emtmannsberg, BAYE, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Taschenbuch. Etat : Neu. 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.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 212 pp. Englisch. N° de réf. du vendeur 9783662507131
Acheter neuf
EUR 53,49
Frais de port :
EUR 60
De Allemagne vers Etats-Unis
Quantité disponible : 2 disponible(s)
Image d'archives
Cryptography in Constant Parallel Time
Edité par
Springer-Verlag New York Inc, 2016
ISBN 10 : 3662507137
ISBN 13 : 9783662507131
Neuf
Paperback
Vendeur : Revaluation Books, Exeter, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Paperback. Etat : Brand New. reprint edition. 212 pages. 9.30x6.20x0.48 inches. In Stock. N° de réf. du vendeur 3662507137
Acheter neuf
EUR 85,40
Frais de port :
EUR 28,44
De Royaume-Uni vers Etats-Unis
Quantité disponible : 1 disponible(s)
Image fournie par le vendeur
Cryptography in Constant Parallel Time
Edité par
Springer Berlin Heidelberg, 2016
ISBN 10 : 3662507137
ISBN 13 : 9783662507131
Neuf
Taschenbuch
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Taschenbuch. Etat : 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. N° de réf. du vendeur 9783662507131
Acheter neuf
EUR 53,49
Frais de port :
EUR 61,65
De Allemagne vers Etats-Unis
Quantité disponible : 1 disponible(s)
Image fournie par le vendeur
Cryptography in Constant Parallel Time
Vendeur : preigu, Osnabrück, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Taschenbuch. Etat : Neu. Cryptography in Constant Parallel Time | Benny Applebaum | Taschenbuch | xvi | Englisch | 2016 | Springer | EAN 9783662507131 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu. N° de réf. du vendeur 103493326
Acheter neuf
EUR 50,35
Frais de port :
EUR 70
De Allemagne vers Etats-Unis
Quantité disponible : 5 disponible(s)