Zu dieser ISBN ist aktuell kein Angebot verfügbar.
Alle Exemplare der Ausgabe mit dieser ISBN anzeigen:Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.
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)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.
Versand:
Gratis
Innerhalb der USA
Buchbeschreibung Hardcover. Zustand: new. Bestandsnummer des Verkäufers 9783642173660
Weitere Informationen zu diesem Verkäufer | Verkäufer kontaktieren
Buchbeschreibung Zustand: New. Bestandsnummer des Verkäufers ABLIING23Mar3113020219993
Weitere Informationen zu diesem Verkäufer | Verkäufer kontaktieren
Buchbeschreibung Zustand: New. Bestandsnummer des Verkäufers 12273334-n
Weitere Informationen zu diesem Verkäufer | Verkäufer kontaktieren
Buchbeschreibung Zustand: New. PRINT ON DEMAND Book; New; Fast Shipping from the UK. No. book. Bestandsnummer des Verkäufers ria9783642173660_lsuk
Weitere Informationen zu diesem Verkäufer | Verkäufer kontaktieren
Buchbeschreibung Buch. 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 9783642173660
Weitere Informationen zu diesem Verkäufer | Verkäufer kontaktieren
Buchbeschreibung Hardcover. Zustand: Brand New. 2013 edition. 193 pages. 9.25x6.25x0.50 inches. In Stock. Bestandsnummer des Verkäufers x-3642173667
Weitere Informationen zu diesem Verkäufer | Verkäufer kontaktieren
Buchbeschreibung Buch. 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 9783642173660
Weitere Informationen zu diesem Verkäufer | Verkäufer kontaktieren
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 5051410
Weitere Informationen zu diesem Verkäufer | Verkäufer kontaktieren
Buchbeschreibung Bestandsnummer des Verkäufers STOCK12364503
Weitere Informationen zu diesem Verkäufer | Verkäufer kontaktieren
Buchbeschreibung Zustand: New. Cryptography in Constant Parallel Time Series: Information Security and Cryptography. Num Pages: 193 pages, 3 black & white illustrations, biography. BIC Classification: UMB; UR; UYA. Category: (P) Professional & Vocational. Dimension: 242 x 162 x 16. Weight in Grams: 462. . 2013. 2013th Edition. Hardcover. . . . . Books ship from the US and Ireland. Bestandsnummer des Verkäufers V9783642173660
Weitere Informationen zu diesem Verkäufer | Verkäufer kontaktieren