Librería:
Best Price, Torrance, CA, Estados Unidos de America
Calificación del vendedor: 5 de 5 estrellas
Vendedor de AbeBooks desde 30 de agosto de 2024
SUPER FAST SHIPPING. N° de ref. del artículo 9783642173660
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.
Acerca del autor: The author is a postdoctoral fellow at the Weizmann Institute of Science; his related thesis was honorably mentioned (runner-up) for the ACM Dissertation Award in 2007.
Título: Cryptography in Constant Parallel Time (...
Editorial: Springer
Año de publicación: 2014
Encuadernación: Encuadernación de tapa dura
Condición: New
Librería: Buchpark, Trebbin, Alemania
Condición: Sehr gut. Zustand: Sehr gut | Sprache: Englisch | Produktart: Bücher. Nº de ref. del artículo: 10340028/2
Cantidad disponible: 1 disponibles
Librería: Buchpark, Trebbin, Alemania
Condición: Sehr gut. Zustand: Sehr gut | Sprache: Englisch | Produktart: Bücher. Nº de ref. del artículo: 10340028/12
Cantidad disponible: 1 disponibles
Librería: SpringBooks, Berlin, Alemania
Hardcover. Condición: As New. from Germany, will be dispatched immediately. Nº de ref. del artículo: CED-2406C-SAKKO-09-1000XS
Cantidad disponible: 1 disponibles
Librería: Brook Bookstore On Demand, Napoli, NA, Italia
Condición: new. Questo è un articolo print on demand. Nº de ref. del artículo: 7d965bb89f96d318740692223438071e
Cantidad disponible: Más de 20 disponibles
Librería: moluna, Greven, Alemania
Gebunden. Condición: 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 ref. del artículo: 5051410
Cantidad disponible: Más de 20 disponibles
Librería: preigu, Osnabrück, Alemania
Buch. Condición: 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. Nº de ref. del artículo: 107101137
Cantidad disponible: 5 disponibles
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
Condición: New. Nº de ref. del artículo: 12273334-n
Cantidad disponible: Más de 20 disponibles
Librería: Lucky's Textbooks, Dallas, TX, Estados Unidos de America
Condición: New. Nº de ref. del artículo: ABLIING23Mar3113020219993
Cantidad disponible: Más de 20 disponibles
Librería: AHA-BUCH GmbH, Einbeck, Alemania
Buch. Condición: 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 ref. del artículo: 9783642173660
Cantidad disponible: 1 disponibles
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania
Buch. Condición: 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 ref. del artículo: 9783642173660
Cantidad disponible: 2 disponibles