How to forget a secret

作者: Giovanni Di Crescenzo , Niels Ferguson , Russell Impagliazzo , Markus Jakobsson

DOI: 10.1007/3-540-49116-3_47

关键词:

摘要: We uncover a new class of attacks that can potentially affect any cryptographic protocol. The attack is performed by an adversary at some point has access to the physical memory participant, including all its previous states. In order protect protocols from such attacks, we introduce primitive call erasable memory. Using this primitive, it possible implement essential action forgetting secret. show how use small in transform large non-erasable into and In practice, shows turn type storage device selectively forget. Moreover, transformation be using minimal assumption existence one-way function, implemented block cipher, which case quite efficient. conclude suggesting concrete implementations amounts

参考文章(18)
Dan Boneh, Richard J. Lipton, A revocable backup system usenix security symposium. pp. 9- 9 ,(1996)
Bennet S. Yee, Using Secure Coprocessors ,(1994)
W. Aiello, M. Bellare, G. Di Crescenzo, R. Venkatesan, Security Amplification by Composition: The Case of Doubly-Iterated, Ideal Ciphers international cryptology conference. pp. 390- 407 ,(1998) , 10.1007/BFB0055743
Rafail Ostrovsky, Moti Yung, How to withstand mobile virus attacks (extended abstract) Proceedings of the tenth annual ACM symposium on Principles of distributed computing - PODC '91. pp. 51- 59 ,(1991) , 10.1145/112600.112605
Amir Herzberg, Markus Jakobsson, Stanislław Jarecki, Hugo Krawczyk, Moti Yung, Proactive public key and signature systems computer and communications security. pp. 100- 110 ,(1997) , 10.1145/266420.266442
Oded Goldreich, Rafail Ostrovsky, Software protection and simulation on oblivious RAMs Journal of the ACM. ,vol. 43, pp. 431- 473 ,(1996) , 10.1145/233551.233553
Whitfield Diffie, Paul C. Van Oorschot, Michael J. Wiener, Authentication and authenticated key exchanges Designs, Codes and Cryptography. ,vol. 2, pp. 107- 125 ,(1992) , 10.1007/BF00124891
Johan HÅstad, Russell Impagliazzo, Leonid A. Levin, Michael Luby, A Pseudorandom Generator from any One-way Function SIAM Journal on Computing. ,vol. 28, pp. 1364- 1396 ,(1999) , 10.1137/S0097539793244708
Rafail Ostrovsky, Victor Shoup, Private information storage (extended abstract) symposium on the theory of computing. pp. 294- 303 ,(1997) , 10.1145/258533.258606
Michael Luby, Charles Rackoff, How to construct pseudorandom permutations from pseudorandom functions SIAM Journal on Computing. ,vol. 17, pp. 373- 386 ,(1988) , 10.1137/0217022