Exposure-resilient cryptography

作者: Madhu Sudan , Yevgeniy Dodis

DOI:

关键词: Secure communicationBlock cipherKey (cryptography)Theoretical computer scienceCryptographyRandom oracleMathematicsSecret sharingPseudorandom number generatorStandard 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.)

参考文章(39)
Sang Uk Shin, Kyung Hyune Rhee, Jae Woo Yoon, Hash Functions and the MAC Using All-or-Nothing Property public key cryptography. pp. 263- 275 ,(1999) , 10.1007/3-540-49162-7_21
Mihir Bellare, Sara K. Miner, A Forward-Secure Digital Signature Scheme international cryptology conference. pp. 431- 448 ,(1999) , 10.1007/3-540-48405-1_28
Matt Blaze, High-Bandwidth Encryption with Low-Bandwidth Smartcards fast software encryption. pp. 33- 40 ,(1996) , 10.1007/3-540-60865-6_40
Mihir Bellare, Phillip Rogaway, Optimal asymmetric encryption theory and application of cryptographic techniques. pp. 92- 111 ,(1994) , 10.1007/BFB0053428
Ronald L. Rivest, All-or-Nothing Encryption and the Package Transform fast software encryption. pp. 210- 218 ,(1997) , 10.1007/BFB0052348
J. Black, S. Halevi, H. Krawczyk, T. Krovetz, P. Rogaway, UMAC: Fast and Secure Message Authentication international cryptology conference. pp. 216- 233 ,(1999) , 10.1007/3-540-48405-1_14
Florence Jessie MacWilliams, Neil James Alexander Sloane, The Theory of Error-Correcting Codes ,(1977)
Markus Jakobsson, Julien P. Stern, Moti Yung, Scramble All, Encrypt Small fast software encryption. ,vol. 1636, pp. 95- 111 ,(1999) , 10.1007/3-540-48519-8_8
J. Radhakrishnan, A. Ta-Shma, Tight bounds for depth-two superconcentrators foundations of computer science. pp. 585- 594 ,(1997) , 10.1109/SFCS.1997.646148
Mark Etzel, Sarvar Patel, Zulfikar Ramzan, SQUARE HASH: Fast Message Authenication via Optimized Universal Hash Functions international cryptology conference. pp. 234- 251 ,(1999) , 10.1007/3-540-48405-1_15