Verwandte Artikel zu Cryptography in Constant Parallel Time (Information...

Cryptography in Constant Parallel Time (Information Security and Cryptography) - Softcover

 
9783662507131: Cryptography in Constant Parallel Time (Information Security and Cryptography)
Alle Exemplare der Ausgabe mit dieser ISBN anzeigen:
 
 
Críticas:

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)
Reseña del editor:

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.

„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.

  • VerlagSpringer
  • Erscheinungsdatum2016
  • ISBN 10 3662507137
  • ISBN 13 9783662507131
  • EinbandTapa blanda
  • Anzahl der Seiten212

Versand: EUR 23,00
Von Deutschland nach USA

Versandziele, Kosten & Dauer

In den Warenkorb

Weitere beliebte Ausgaben desselben Titels

9783642173660: Cryptography in Constant Parallel Time (Information Security and Cryptography)

Vorgestellte Ausgabe

ISBN 10:  3642173667 ISBN 13:  9783642173660
Verlag: Springer, 2014
Hardcover

Beste Suchergebnisse bei AbeBooks

Foto des Verkäufers

Benny Applebaum
ISBN 10: 3662507137 ISBN 13: 9783662507131
Neu Taschenbuch Anzahl: 2
Print-on-Demand
Anbieter:
BuchWeltWeit Ludwig Meier e.K.
(Bergisch Gladbach, Deutschland)
Bewertung

Buchbeschreibung Taschenbuch. Zustand: 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. Bestandsnummer des Verkäufers 9783662507131

Weitere Informationen zu diesem Verkäufer | Verkäufer kontaktieren

Neu kaufen
EUR 53,49
Währung umrechnen

In den Warenkorb

Versand: EUR 23,00
Von Deutschland nach USA
Versandziele, Kosten & Dauer
Foto des Verkäufers

Benny Applebaum
ISBN 10: 3662507137 ISBN 13: 9783662507131
Neu Taschenbuch Anzahl: 1
Anbieter:
AHA-BUCH GmbH
(Einbeck, Deutschland)
Bewertung

Buchbeschreibung Taschenbuch. Zustand: 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. Bestandsnummer des Verkäufers 9783662507131

Weitere Informationen zu diesem Verkäufer | Verkäufer kontaktieren

Neu kaufen
EUR 56,45
Währung umrechnen

In den Warenkorb

Versand: EUR 32,99
Von Deutschland nach USA
Versandziele, Kosten & Dauer
Foto des Verkäufers

Benny Applebaum
ISBN 10: 3662507137 ISBN 13: 9783662507131
Neu Softcover Anzahl: > 20
Print-on-Demand
Anbieter:
moluna
(Greven, Deutschland)
Bewertung

Buchbeschreibung Zustand: 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. Bestandsnummer des Verkäufers 449137416

Weitere Informationen zu diesem Verkäufer | Verkäufer kontaktieren

Neu kaufen
EUR 48,37
Währung umrechnen

In den Warenkorb

Versand: EUR 48,99
Von Deutschland nach USA
Versandziele, Kosten & Dauer
Beispielbild für diese ISBN

Applebaum, Benny
ISBN 10: 3662507137 ISBN 13: 9783662507131
Neu Paperback Anzahl: 1
Anbieter:
Revaluation Books
(Exeter, Vereinigtes Königreich)
Bewertung

Buchbeschreibung Paperback. Zustand: Brand New. reprint edition. 212 pages. 9.30x6.20x0.48 inches. In Stock. Bestandsnummer des Verkäufers 3662507137

Weitere Informationen zu diesem Verkäufer | Verkäufer kontaktieren

Neu kaufen
EUR 94,97
Währung umrechnen

In den Warenkorb

Versand: EUR 11,83
Von Vereinigtes Königreich nach USA
Versandziele, Kosten & Dauer