CCA-secure revocable identity-based encryption schemes with decryption key exposure resistance

2017 ◽  
Vol 3 (3) ◽  
pp. 288 ◽  
Author(s):  
Yuu Ishida ◽  
Junji Shikata ◽  
Yohei Watanabe
2019 ◽  
Vol 15 (7) ◽  
pp. 155014771986039 ◽  
Author(s):  
Baokang Zhao ◽  
Puguang Liu ◽  
Xiaofeng Wang ◽  
Ilsun You

Space-air-ground integrated Internet of things can improve the scope of Internet of things applications significantly by offering truly global coverage all over the world. While space-air-ground integrated Internet of things is promising to be very useful in many aspects, its deployment and application should overcome severe security threats, for example, interceptions, identity forgery, data tampering, and so on. Authentication is an essential step to protect the Internet of things security, and mutual authentication (i.e. two-way authentication) is especially important to ensure the security of both communication parties simultaneously. However, the intrinsical properties of network dynamics and wide coverage make the authentication concern in space-air-ground integrated Internet of things extremely challenging than traditional Internet of things networks. In this article, we propose MASIT, an identity-based efficient and lightweight mutual authentication scheme for space-air-ground integrated Internet of things. MASIT exploits the natural broadcast property of space-air-ground integrated Internet of things to speed up authentication process, and leverage the distinguished feature of IPv6 to support concurrent numerous nodes. Theoretically, we prove that MASIT is existential unforgeable secure under adaptively chosen message and identity Attacks. We also implement MASIT and other existing typical identity-based encryption schemes and evaluate their performance in real platforms. Experimental results showed that, MASIT outperforms the existing identity-based encryption schemes significantly, that is, the signature verification time can be reduced by 50% to 60%, and the user signature size can be reduced by 13% to 50%.


Author(s):  
Aravind Karrothu ◽  
Jasmine Norman

Fog networking supports the internet of things (IoT) concept, in which most of the devices used by humans on a daily basis will be connected to each other. Security issues in fog architecture are still a major research area as the number of security threats increases every day. Identity-based encryption (IBE) has a wide range of new cryptographic schemes and protocols that are particularly found to be suitable for lightweight architecture such as IoT and wireless sensor networks. This chapter focuses on these schemes and protocols in the background of wireless sensor networks. Also, this chapter analyses identity-based encryption schemes and the various attacks they are prone to.


Author(s):  
Keita Emura ◽  
Atsushi Takayasu ◽  
Yohei Watanabe

AbstractHierarchical key-insulated identity-based encryption (HKIBE) is identity-based encryption (IBE) that allows users to update their secret keys to achieve (hierarchical) key-exposure resilience, which is an important notion in practice. However, existing HKIBE constructions have limitations in efficiency: sizes of ciphertexts and secret keys depend on the hierarchical depth. In this paper, we first triumph over the barrier by proposing simple but effective design methodologies to construct efficient HKIBE schemes. First, we show a generic construction from any hierarchical IBE (HIBE) scheme that satisfies a special requirement, called MSK evaluatability introduced by Emura et al. (Des. Codes Cryptography 89(7):1535–1574, 2021). It provides several new and efficient instantiations since most pairing-based HIBE schemes satisfy the requirement. It is worth noting that it preserves all parameters’ sizes of the underlying HIBE scheme, and hence we obtain several efficient HKIBE schemes under the k-linear assumption in the standard model. Since MSK evaluatability is dedicated to pairing-based HIBE schemes, the first construction restricts pairing-based instantiations. To realize efficient instantiation from various assumptions, we next propose a generic construction of an HKIBE scheme from any plain HIBE scheme. It is based on Hanaoka et al.’s HKIBE scheme (Asiacrypt 2005), and does not need any special properties. Therefore, we obtain new efficient instantiations from various assumptions other than pairing-oriented ones. Though the sizes of secret keys and ciphertexts are larger than those of the first construction, it is more efficient than Hanaoka et al.’s scheme in the sense of the sizes of master public/secret keys.


Author(s):  
Pengqi Cheng ◽  
Yan Gu ◽  
Zihong Lv ◽  
Jianfei Wang ◽  
Wenlei Zhu ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document