NCO. This includes simple forms of natural computation that can be performed by real-world dynamical systems in a constant number of steps. 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 noteson 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. . The author's related thesis was honorably mentioned (runner-up) for the ACM Dissertation Award in 2007. Assumes only a minimal background in computational complexity and cryptography. Introduces general techniques and tools of interest to experts in the area. INDICE: Introduction. Preliminaries and Definitions. Randomized Encoding of Functions. Cryptography in NCO. Computationally Private Randomizing Polynomials and Their Applications. On Pseudorandom Generators with Linear Stretch in NCO. Cryptography with Constant Input Locality. One-Way Functions with OptimalOutput Locality. App. A, On Collections of Cryptographic Primitives.
- ISBN: 978-3-642-17366-0
- Editorial: Springer Berlin Heidelberg
- Encuadernacion: Cartoné
- Páginas: 200
- Fecha Publicación: 15/05/2011
- Nº Volúmenes: 1
- Idioma: Inglés