scholarly journals Deterministic Public Key Encryption and Identity-Based Encryption from Lattices in the Auxiliary-Input Setting

2012 ◽  
pp. 1-18 ◽  
Author(s):  
Xiang Xie ◽  
Rui Xue ◽  
Rui Zhang
Keyword(s):  
Public Key ◽  
Public Key Encryption ◽  
Identity Based Encryption ◽  
Identity Based ◽  
Auxiliary Input

scholarly journals IIBE: An Improved Identity-Based Encryption Algorithm for WSN Security

2021 ◽  
Vol 2021 ◽  
pp. 1-8
Author(s):  
ChunHua Cao ◽  
YaNa Tang ◽  
DeYan Huang ◽  
WeiMin Gan ◽  
Chunjiong Zhang
Keyword(s):  
Encryption Algorithm ◽  
Public Key ◽  
Generation Process ◽  
Key Generation ◽  
Public Key Encryption ◽  
Computing Power ◽  
Identity Based Encryption ◽  
Communication Ability ◽  
Limited Power ◽  
Identity Based

Wireless sensor networks (WSN) have problems such as limited power, weak computing power, poor communication ability, and vulnerability to attack. However, the existing encryption methods cannot effectively solve the above problems when applied to WSN. To this end, according to WSN’s characteristics and based on the identity-based encryption idea, an improved identity-based encryption algorithm (IIBE) is proposed, which can effectively simplify the key generation process, reduce the network traffic, and improve the network security. The design idea of this algorithm lies between the traditional public key encryption and identity-based public tweezers’ encryption. Compared with the traditional public key encryption, the algorithm does not need a public key certificate and avoids the management of the certificate. Compared with identity-based public key encryption, the algorithm addresses the key escrow and key revocation problems. The results of the actual network distribution experiments demonstrate that IIBE has low energy consumption and high security, which are suitable for application in WSN with high requirements on security.

Pairing-Free Identity-Based Encryption with Authorized Equality Test in Online Social Networks

2019 ◽  
Vol 30 (04) ◽  
pp. 647-664
Author(s):  
Libing Wu ◽  
Yubo Zhang ◽  
Kim-Kwang Raymond Choo ◽  
Debiao He
Keyword(s):  
Social Networking ◽  
Online Social Networks ◽  
Keyword Search ◽  
Public Key ◽  
Encryption Scheme ◽  
Public Key Encryption ◽  
Identity Based Encryption ◽  
Identity Based ◽  
Equality Test ◽  
Chosen Ciphertext Attack

Online social networking applications have become more and more popular in the advance of the technological age. Much of our personal information has been disclosed in social networking activities and privacy-preserving still remains a research challenge in social network. Public key encryption scheme with equality test(PKEET), which is an extension of public key encryption with keyword search (PEKS), seems to be a solution. PKEET enables the tester to check whether two given ciphertexts are derived from the same plaintext. Recently, Zhu et al. proposed a pairing-free public key encryption scheme with equality test based on the traditional public key cryptosystem. However, it suffers from certificates management issue. In this paper, we propose a pairing-free identity-based encryption scheme with authorized equality test(PF-IBEAET). The PF-IBEAET scheme also provides fine-grained authorizations. We prove that the scheme is one way secure against chosen identity and chosen ciphertext attack (OW-ID-CCA) and indistinguishable against chosen-identity and chosen-ciphertext attack (IND-ID-CCA) in the random oracle model (ROM). Performance analysis shows that the scheme achieves a better performance than similar schemes.

scholarly journals Deterministic Identity-Based Encryption from Lattice-Based Programmable Hash Functions with High Min-Entropy

2019 ◽  
Vol 2019 ◽  
pp. 1-12 ◽  
Author(s):  
Daode Zhang ◽  
Jie Li ◽  
Bao Li ◽  
Xianhui Lu ◽  
Haiyang Xue ◽  
...  
Keyword(s):  
Hash Functions ◽  
The Other ◽  
Public Key ◽  
Identity Based Encryption ◽  
Other Hand ◽  
Identity Based ◽  
Learning With Errors ◽  
The One ◽  
Auxiliary Input

There only exists one deterministic identity-based encryption (DIBE) scheme which is adaptively secure in the auxiliary-input setting, under the learning with errors (LWE) assumption. However, the master public key consists of O(λ) basic matrices. In this paper, we consider to construct adaptively secure DIBE schemes with more compact public parameters from the LWE problem. (i) On the one hand, we gave a generic DIBE construction from lattice-based programmable hash functions with high min-entropy. (ii) On the other hand, when instantiating our generic DIBE construction with four LPHFs with high min-entropy, we can get four adaptively secure DIBE schemes with more compact public parameters. In one of our DIBE schemes, the master public key only consists of ω(log⁡λ) basic matrices.

scholarly journals Semi-generic construction of public key encryption and identity-based encryption with equality test

2016 ◽  
Vol 373 ◽  
pp. 419-440 ◽  
Author(s):  
Hyung Tae Lee ◽  
San Ling ◽  
Jae Hong Seo ◽  
Huaxiong Wang
Keyword(s):  
Public Key ◽  
Public Key Encryption ◽  
Identity Based Encryption ◽  
Generic Construction ◽  
Identity Based ◽  
Equality Test

Multi-use Deterministic Public Key Proxy Re-Encryption from Lattices in the Auxiliary-Input Setting

2020 ◽  
Vol 31 (05) ◽  
pp. 551-567
Author(s):  
Juyan Li ◽  
Chunguang Ma ◽  
Zhen Gu
Keyword(s):  
Standard Model ◽  
Public Key ◽  
Public Key Encryption ◽  
Basic Construction ◽  
Model Based ◽  
Cryptographic Primitive ◽  
Semantic Security ◽  
The Standard Model ◽  
Identity Based ◽  
Auxiliary Input

Proxy Re-Encryption (PRE) is a cryptographic primitive that allows a proxy to turn an Alice’s ciphertext into a Bob’s ciphertext on the same plaintext. All of the PRE schemes are public key encryption and semantic security. Deterministic Public Key Encryption (D-PKE) provides an alternative to randomized public key encryption in various scenarios where the latter exhibits inherent drawbacks. In this paper, we construct the first multi-use unidirectional D-PRE scheme from Lattices in the auxiliary-input setting. We also prove that it is PRIV1-INDr secure in the standard model based on the LWR. Finally, an identity-based D-PRE is obtained from the basic construction.

An Efficient Identity Based Encryption in Cloud Computing with Outsourced Revocation

2020 ◽  
pp. 72-82
Author(s):  
U. Vijay Sankar ◽  
M. Pavithra ◽  
R Suganya
Keyword(s):  
Cloud Computing ◽  
Cloud Service ◽  
Public Key Infrastructure ◽  
Third Party ◽  
Public Key ◽  
Public Key Encryption ◽  
Private Key ◽  
Identity Based Encryption ◽  
Identity Based ◽  
Key Update

Identity-Based Encryption (IBE) which simplifies the public key and certificate management at Public Key Infrastructure (PKI) is an important alternative to public key encryption. However, one of the main efficiency drawbacks of IBE is the overhead computation at Private Key Generator (PKG) during user revocation. Efficient revocation has been well studied in traditional PKI setting, but the cumbersome management of certificates is precisely the burden that IBE strives to alleviate [2]. It aiming at tackling the critical issue of identity revocation, we introduce outsourcing computation into IBE for the first time and propose a revocable IBE scheme in the server-aided setting. Our scheme offloads most of the key generation related operations during key-issuing and key-update processes to a Key Update Cloud Service Provider, leaving only a constant number of simple operations for PKG and users to perform locally [3]. This goal is achieved by utilizing a novel collusion-resistant technique: we employ a hybrid private key for each user, in which an AND gate is involved to connect and bound the identity component and the time component [4]. Furthermore, we propose another construction which is provable secure under the recently formulized Refereed Delegation of Computation model. Finally, we provide extensive experimental results to demonstrate the efficiency of our proposed construction. In public key encryption every user must have a pair of keys, public key and private key, for encrypting and decrypting messages. An Identity-based encryption (IBE) eliminates the need for a Public Key Infrastructure (PKI). IBE uses the human intelligible identities (e.g., unique name, email address, IP address, etc) as public keys [5]. The sender using IBE encrypts message with the receivers’ identity rather than looking for receivers’ public key and corresponding certificate. Accordingly, receiver decrypts ciphertext using private key associated with the corresponding identity [6]. The private keys of users are obtained from a trusted third party called as Private Key Generator (PKG). The motivation of this paper is to study and review an efficient and secure Identity based encryption scheme with outsourced revocation for cloud computing [7].

Sign in / Sign up

Export Citation Format

Share Document