Cocks’ Identity-Based Encryption in the Standard Model, via Obfuscation Techniques (Short Paper)

Author(s):  
Xin Wang ◽  
Shimin Li ◽  
Rui Xue
Informatica ◽  
2010 ◽  
Vol 21 (3) ◽  
pp. 393-407 ◽  
Author(s):  
Yanli Ren ◽  
Dawu Gu ◽  
Shuozhong Wang ◽  
Xinpeng Zhang

Symmetry ◽  
2019 ◽  
Vol 11 (7) ◽  
pp. 913
Author(s):  
Lifeng Guo ◽  
Jing Wang ◽  
Wei-Chuen Yau

Security is a main concern for the Internet of Things (IoT) infrastructure as large volumes of data are collected and processed in the systems. Due to the limited resources of interconnected sensors and devices in the IoT systems, efficiency is one of the key considerations when deploying security solutions (e.g., symmetric/asymmetric encryption, authentication, etc.) in IoT. In this paper, we present an efficient Hierarchical Identity-Based Encryption (HIBE) system with short parameters for protecting data confidentiality in distributed IoT infrastructure. Our proposed HIBE system has the public parameters, private key, and ciphertext, each consisting of a constant number of group elements. We prove the full security of the HIBE system in the standard model using the dual system encryption technique. We also implement the proposed scheme and compare the performance with the original Lewko–Waters HIBE. To the best of our knowledge, our construction is the first HIBE system that achieves both full security in the standard model and short parameters in terms of the public parameters, private key, and ciphertext.


2014 ◽  
Vol 2014 ◽  
pp. 1-7 ◽  
Author(s):  
Kambombo Mtonga ◽  
Anand Paul ◽  
Seungmin Rho

Time- and ID-based proxy reencryption scheme is proposed in this paper in which a type-based proxy reencryption enables the delegator to implement fine-grained policies with one key pair without any additional trust on the proxy. However, in some applications, the time within which the data was sampled or collected is very critical. In such applications, for example, healthcare and criminal investigations, the delegatee may be interested in only some of the messages with some types sampled within some time bound instead of the entire subset. Hence, in order to carter for such situations, in this paper, we propose a time-and-identity-based proxy reencryption scheme that takes into account the time within which the data was collected as a factor to consider when categorizing data in addition to its type. Our scheme is based on Boneh and Boyen identity-based scheme (BB-IBE) and Matsuo’s proxy reencryption scheme for identity-based encryption (IBE to IBE). We prove that our scheme is semantically secure in the standard model.


2018 ◽  
Vol 62 (8) ◽  
pp. 1087-1091
Author(s):  
Xi-Jun Lin ◽  
Lin Sun ◽  
Haipeng Qu ◽  
He-Qun Xian

AbstractRecently, Zhang et al. proposed a new anonymous hierarchical identity-based encryption (anonymous HIBE) over prime order groups to achieve both constant size private key and constant size ciphertext. Moreover, a double exponent technique was used to provide anonymity. They proved that their scheme is secure and anonymous against chosen plaintext attacks in the standard model. In this paper, we point out that their scheme is insecure.


2019 ◽  
Vol 62 (8) ◽  
pp. 1092-1105 ◽  
Author(s):  
Yanwei Zhou ◽  
Bo Yang ◽  
Hongxia Hou ◽  
Lina Zhang ◽  
Tao Wang ◽  
...  

Abstract In the actual applications, an adversary can break the security of cryptography scheme through various leakage attacks (e.g. side-channel attacks, cold-boot attacks, etc.), even the continuous leakage attacks. That is, a practical cryptography scheme must maintain its claimed security in the continuous leakage setting. However, the previous constructions on the leakage-resilient identity-based encryption (IBE) scheme could tolerate a leakage that is bounded, and cannot resist the continuous leakage attacks. In order to further achieve the better security, a novel method to build the continuous leakage-resilient IBE scheme with tight security is presented in this paper, and the scheme’s security is proved, in the standard model, based on a stronger security assumption that depends on the number of queries made by the adversary. In addition, our proposal has several advantages over previous such constructions, e.g. shorter public parameters, higher communication efficiency, tight security, etc.


2021 ◽  
Vol 2021 ◽  
pp. 1-11
Author(s):  
Yi-Fan Tseng ◽  
Chun-I Fan

Multireceiver identity-based encryption is a cryptographic primitive, which allows a sender to encrypt a message for multiple receivers efficiently and securely. In some applications, the receivers may not want their identities to be revealed. Motivated by this issue, in 2010, Fan et al. first proposed the concept of anonymous multireceiver identity-based encryption (AMRIBE). Since then, lots of literature studies in this field have been proposed. After surveying the existing works, however, we found that most of them fail to achieve provable anonymity with tight reduction. A security proof with tight reduction means better quality of security and better efficiency of implementation. In this paper, we focus on solving the open problem in this field that is to achieve the ANON-IND-CCA security with tight reduction by giving an AMRIBE scheme. The proposed scheme is proven to be IND-MID-CCA and ANON-MID-CCA secure with tight reduction under a variant of the DBDH assumption. To the best of our knowledge, this is the first scheme proven with tight reducible full CCA security in the standard model.


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

Sign in / Sign up

Export Citation Format

Share Document