Entry Date:
May 20, 2002

Exposure-Resilient Cryptography


Standard cryptographic definitions and constructions do not guarantee any security even if a tiny fraction of the secret entity is compromised. The goal of this project is to design cryptographic primitives that remain provably secure even when an adversary is able to learn almost the entire secret. Numerous applications include combatting almost total key-exposure, enhancing the security of block-ciphers, hash functions, constructing computational "gap" secret-sharing schemes with shares as small as 1 bit, and building exposure-resilient pseudorandom functions and pseudorandom generators.