Efficient leakage-resilient public key encryption from DDH assumption

Security and Communication Networks

Lang

Zheng

et al. 2018

With the development of the smart health (s-health), data security and patient privacy are becoming more and more important. However, some traditional cryptographic schemes can not guarantee data security and patient privacy under various forms of leakage attacks. To prevent the adversary from capturing the part of private keys by leakage attacks, we propose a secure leakageresilient s-health system which realizes privacy protection and the safe transmission of medical information in the case of leakage attacks. The key technique is a promising public key cryptographic primitive called leakage-resilient anonymous Hierarchical Identity-Based Encryption. Our construction is proved to be secure against chosen plaintext attacks in the standard model under the Diffie-Hellman exponent assumption and decisional linear assumption. We also blind the public parameters and ciphertexts by using double exponent technique to achieve the recipient anonymity. Finally, the performance analysis shows the practicability of our scheme, and the leakage rate of the private key approximates to 1/6.

Section: Related Workmentioning

confidence: 99%

A Secure and Privacy-Aware Smart Health System with Secret Key Leakage Resilience

Security and Communication Networks

Lang

Zheng

et al. 2018

“…Recently, some new leakage resilient IBE schemes were presented [24,25]. In 2013, Li et al [26] provided an efficient leakage-resilient public key encryption, which is formally proved semantically secure against adaptive chosen ciphertext attacks under DDH assumption. Recently, Qin et al [27] proposed a new method to construct leakageresilient CCA2-secure public key encryption scheme from any tag-based strongly universal HPS, which has the better leakage rate.…”

Section: Related Workmentioning

confidence: 99%

A Leakage-Resilient CCA-Secure Identity-Based Encryption Scheme

Teng

et al. 2016

The Computer Journal

Identity-based encryption (IBE) has many appealing applications. However, some traditional IBE schemes may not be secure in the real world due to the side-channel attacks. Leakage-resilient cryptography can capture these attacks by modeling information leakage that adversary can access. In this paper, we apply a hash proof technique in the existing CCA-secure variant of the Gentry's IBE scheme to construct a new leakage-resilient IBE scheme in the bounded-leakage model. The proposed scheme is more computationally efficient than the original Alwen et al.'s leakage-resilient IBE scheme. It enjoys a shorter key (public/secret key) length, and a higher relative key leakage ratio. The new leakage-resilient scheme is proved semantically secure against adaptive chosen ciphertext attack in the standard model under the truncated augmented bilinear Diffie-Hellman exponent (q-TABDHE) assumption.

“…With the development of various side-channel attacks, it is clear that the traditional view is inconsistent with some physical realities [7]. To stand against such attacks, cryptographic researchers have paid much to the design of leakage-resilient cryptosystems [8][9][10][11][12][13][14].…”

Section: Introductionmentioning

confidence: 99%

Continuous Leakage Resilient Lossy Trapdoor Functions

et al. 2017

Information

Self Cite

Lossy trapdoor functions (LTFs) were first introduced by Peikert and Waters (STOC'08). Since their introduction, lossy trapdoor functions have found numerous applications. They can be used as tools to construct important cryptographic primitives such as injective one-way trapdoor functions, chosen-ciphertext-secure public key encryptions, deterministic encryptions, et al. In this paper, we focus on the lossy trapdoor functions in the presence of continuous leakage. We introduce the new notion of updatable lossy trapdoor functions (ULTFs) and give their formal definition and security properties. Based on these, we extend the security model to the LTFs against continuous leakage when the evaluation algorithm is leakage resilient. Under the standard DDH assumption and DCR assumption, respectively, we show two explicit lossy trapdoor functions against continuous leakage in the standard model. In these schemes, using the technology of matrix kernel, the trapdoor can be refreshed at regular intervals and the adversaries can learn unbounded leakage information on the trapdoor along the whole system life. At the same time, we also show the performance of the proposed schemes compared with the known existing continuous leakage resilient lossy trapdoor functions.