作者: Madhu Sudan , Yevgeniy Dodis
DOI:
关键词: Secure communication 、 Block cipher 、 Key (cryptography) 、 Theoretical computer science 、 Cryptography 、 Random oracle 、 Mathematics 、 Secret sharing 、 Pseudorandom number generator 、 Standard model (cryptography)
摘要: We develop the notion of Exposure-Resilient Cryptography. While standard cryptographic definitions and constructions do not guarantee any security even if a tiny fraction secret entity (e.g., key) is compromised, objective Cryptography to build information structures such that almost complete (intentional or unintentional) exposure structure still protects embedded in this structure. The key our approach new primitive independent interest, which we call an Function (ERF)—a deterministic function whose output appears random (in perfect, statistical computational sense) all bits input are known. ERF's by themselves efficiently solve partial secrets setting where simply value, like private-key cryptography. They can also be viewed as very secure pseudorandom generators have many other applications. To general secrets, use (generalized) All-Or-Nothing Transform (AONT) introduced Rivest [51] refined Boyko [16]: invertible (randomized) transformation T which, nevertheless, reveals “no information” about x T(x) By applying AONT (of arbitrary structure), obtain against total secrets. AONT's diverse applications design block ciphers, sharing communication. To date, however, only known analyses candidates were made oracle model (by [16]). In thesis construct with nearly optimal parameters (without oracles), settings (the latter based on one-way functions). show close relationship between examine additional properties what hope will become important primitives—Exposure-Resilient Functions Transforms. (Copies available exclusively from MIT Libraries, Rm. 14-0551, Cambridge, MA 02139-4307. Ph. 617-253-5668; Fax 617-253-1690.)