Exposure-Resilient Functions and All-or-Nothing Transforms

Abstract. We study the problem of partial key exposure. Standard cryptographic definitions and constructions do not guarantee any security even if a tiny fraction of the secret key is compromised. We show how to build cryptographic primitives that remain secure even when an adversary is able to learn almost all of the secret key. The key to our approach is a new primitive of independent interest, which we call an Exposure-Resilient Function (ERF)

• Type: Conference
• Year: 2000
• Where: EUROCRYPT
• Authors: Ran Canetti, Yevgeniy Dodis, Shai Halevi, Eyal Kushilevitz, Amit Sahai
• Keywords: Cryptology, EUROCRYPT 2000, Key Exposure Problem, Partial Key Exposure, Secret Key