An efficient revocable ID-based encryption scheme in the standard model

2017 ◽  
Vol 9 (2) ◽  
pp. 168
Author(s):  
Jianfeng Ma ◽  
Futai Zhang ◽  
Yinxia Sun ◽  
Limin Shen
2020 ◽  
Vol 63 (12) ◽  
pp. 1904-1914
Author(s):  
Janaka Alawatugoda

Abstract Over the years, security against adaptively chosen-ciphertext attacks (CCA2) is considered as the strongest security definition for public-key encryption schemes. With the uprise of side-channel attacks, new security definitions are proposed, addressing leakage of secret keys together with the standard CCA2 definition. Among the new security definitions, security against continuous and after-the-fact leakage-resilient CCA2 can be considered as the strongest security definition, which is called as security against (continuous) adaptively chosen-ciphertext leakage attacks (continuous CCLA2). In this paper, we present a construction of a public-key encryption scheme, namely LR-PKE, which satisfies the aforementioned security definition. The security of our public-key encryption scheme is proven in the standard model, under decision BDH assumption. Thus, we emphasize that our public-key encryption scheme LR-PKE is (continuous) CCLA2-secure in the standard model. For our construction of LR-PKE, we have used a strong one-time signature scheme and a leakage-resilient refreshing protocol as underlying building blocks. The leakage bound is $0.15n\log p -1$ bits per leakage query, for a security parameter $k$ and a statistical security parameter $n$, such that $\log p \geq k$ and $n$ is a function of $k$. It is possible to see that LR-PKE is efficient enough to be used for real-world usage.


Informatica ◽  
2012 ◽  
Vol 23 (2) ◽  
pp. 299-314
Author(s):  
Xu An Wang ◽  
Xiaoyuan Yang ◽  
Minqing Zhang ◽  
Yong Yu

2017 ◽  
Vol 9 (2) ◽  
pp. 168 ◽  
Author(s):  
Limin Shen ◽  
Futai Zhang ◽  
Yinxia Sun ◽  
Jianfeng Ma

Sign in / Sign up

Export Citation Format

Share Document