The Design And Improvements Of Adaptive Leakage-Resilient Encryption Scheme In The BRM Model

So far, modern cryptography has been made great success both in theoretical research and practical applications. As we all known, one of the key premises of modern cryptography is to ensure private key perfectly secure. While in our real life many attacks known as "side channels", virus and so on, make the encryption scheme leak its privete key, which has been proved their security keep their security against these attacks no longer. Therefore it is urgent for researchers to construct leakage-resilienct encryption model or cryptographic systems. From Micali and Reyzin’s work, how to construct a secure cryptographic model in case of secret key is leaking becomes a hot field.This paper, we revolve how to construct adaptive leakage-resilient cryptography in the bounded retrieval model. Our main research focuses on such as how to increase encryption scheme the amount of leakage, improve scheme security and so on. First, we introduce the leakage-resilient cryptography in details and analyze the existing encryption schemes and protocols. Then we introduce the adaptive leakage pseudo-entropy functions, but the amount of leakage is not high enough, so based on composite residuosity assumption we propose a new pseudo-entropy function which can stand up more leakage. After that, we introduce a cryptography scheme against adaptive leakage, which is chosen-plaintext-attack secure. Then we propose a scheme that is adaptive chosen-ciphertext-attack secure based on double encryption with the fact that the complexity is unchanged. At last, we give an instantiation of Hash proof system used in adaptive leakage-resilient cryptography based on DDH assumption, enhence we give instantiation of CPA and CCA2security adaptive leakage-resilient cryptography.Leakage-resilient cryptography provides a practicable method to solve the side channel attack in our real life, which is of great significance.