Cryptography in Constant Parallel Time

• Κύριος συγγραφέας: Applebaum, Benny (Συγγραφέας)
• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2014.
• Σειρά: Information Security and Cryptography,
• Θέματα: Computer science.; Data structures (Computer science).; Computer science > Mathematics.; Computer Science.; Mathematics of Computing.; Data Structures, Cryptology and Information Theory.

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 simpli...

Πίνακας περιεχομένων:

• Introduction
• Preliminaries and Definitions
• Randomized Encoding of Functions
• Cryptography in NC0
• Computationally Private Randomizing Polynomials and Their Applications
• On Pseudorandom Generators with Linear Stretch in NC0
• Cryptography with Constant Input Locality
• One-Way Functions with Optimal Output Locality
• App. A, On Collections of Cryptographic Primitives.