scholarly journals Public key encryption with equality test from generic assumptions in the random oracle model

2019 ◽  
Vol 500 ◽  
pp. 15-33 ◽  
Author(s):  
Hyung Tae Lee ◽  
San Ling ◽  
Jae Hong Seo ◽  
Huaxiong Wang
Keyword(s):  
Random Oracle Model ◽  
Random Oracle ◽  
Public Key ◽  
Public Key Encryption ◽  
Equality Test

scholarly journals Quantum Random Oracle Model for Quantum Public-Key Encryption

IEEE Access ◽  
2019 ◽  
Vol 7 ◽  
pp. 130024-130031 ◽  
Author(s):  
Tao Shang ◽  
Ranyiliu Chen ◽  
Qi Lei
Keyword(s):  
Random Oracle Model ◽  
Random Oracle ◽  
Public Key ◽  
Public Key Encryption ◽  
Quantum Public Key

scholarly journals Public Key Encryption with Keyword Search from Lattices in Multiuser Environments

2016 ◽  
Vol 2016 ◽  
pp. 1-7 ◽  
Author(s):  
Daini Wu ◽  
Xiaoming Wang ◽  
Qingqing Gan
Keyword(s):  
Data Privacy ◽  
Keyword Search ◽  
Random Oracle Model ◽  
Random Oracle ◽  
Public Key ◽  
Public Key Encryption ◽  
Encrypted Data ◽  
Cloud Server ◽  
Learning With Errors ◽  
Multiuser Environments

A public key encryption scheme with keyword search capabilities is proposed using lattices for applications in multiuser environments. The proposed scheme enables a cloud server to check if any given encrypted data contains certain keywords specified by multiple users, but the server would not have knowledge of the keywords specified by the users or the contents of the encrypted data, which provides data privacy as well as privacy for user queries in multiuser environments. It can be proven secure under the standard learning with errors assumption in the random oracle model.

Public Key Encryption With Equality Test for Industrial Internet of Things Based on Near-Ring

2021 ◽  
Vol 17 (3) ◽  
pp. 25-45
Author(s):  
Muthukumaran V. ◽  
Manimozhi I. ◽  
Praveen Sundar P. V. ◽  
Karthikeyan T. ◽  
Magesh Gopu
Keyword(s):  
Internet Of Things ◽  
Quantum Algorithm ◽  
Random Oracle Model ◽  
Public Key ◽  
Smart Devices ◽  
Type I ◽  
Public Key Encryption ◽  
Industrial Internet Of Things ◽  
Industrial Internet ◽  
Equality Test

Organizations have moved from the conventional industries to smart industries by embracing the approach of industrial internet of things (IIoT), which has provided an avenue for the integration of smart devices and communication technologies. In this context, this work presents a public key encryption with equality test based on DLP with decomposition problems over near-ring. The proposed method is highly secure, and it solves the problem of quantum algorithm attacks in industrial internet of thing systems. Further, the proposed system is highly secure, and it prevents the chosen-ciphertext attack in type-I adversary and it is indistinguishable against the random oracle model for the type-II adversary. The proposed scheme is highly secure, and the security analysis measures are comparatively stronger than existing techniques.

On the KDM-CCA Security from Partial Trapdoor One-Way Family in the Random Oracle Model

2019 ◽  
Vol 62 (8) ◽  
pp. 1232-1245
Author(s):  
Jinyong Chang ◽  
Genqing Bian ◽  
Yanyan Ji ◽  
Maozhi Xu
Keyword(s):  
Slight Modification ◽  
Random Oracle Model ◽  
Random Oracle ◽  
Public Key ◽  
Public Key Encryption ◽  
Know How ◽  
One Way Function ◽  
Chosen Ciphertext Attack

Abstract In PKC 2000, Pointcheval presented a generic technique to make a highly secure cryptosystem from any partially trapdoor one-way function in the random oracle model. More precisely, any suitable problem providing a one-way cryptosystem can be efficiently derived into a chosen-ciphertext attack (CCA) secure public key encryption (PKE) scheme. In fact, the overhead only consists of two hashing and a XOR. In this paper, we consider the key-dependent message (KDM) security of the Pointcheval’s transformation. Unfortunately, we do not know how to directly prove its KDM-CCA security because there are some details in the proof that we can not bypass. However, a slight modification of the original transformation (we call twisted Pointcheval’s scheme) makes it possible to obtain the KDM-CCA security. As a result, we prove that the twisted Pointcheval’s scheme achieves the KDM-CCA security without introducing any new assumption. That is, we can construct a KDM-CCA secure PKE scheme from partial trapdoor one-way injective family in the random oracle model.

scholarly journals ID-based key-insulated signcryption with equality test in cloud computing

2021 ◽  
Vol 3 (4) ◽  
Author(s):  
Seth Alornyo ◽  
Kingsford Kissi Mireku ◽  
Mustapha Adamu Mohammed ◽  
Daniel Adu-Gyamfi ◽  
Michael Asante
Keyword(s):  
Cloud Computing ◽  
Random Oracle Model ◽  
Random Oracle ◽  
Harsh Environments ◽  
Secret Key ◽  
Secret Keys ◽  
Security Property ◽  
Equality Test ◽  
Chosen Ciphertext Attack ◽  
Chosen Message Attack

AbstractKey-insulated encryption reduces the problem of secret key exposure in hostile setting while signcryption cryptosystem attains the benefits of digitally signing a ciphertext and public key cryptosystem. In this study, we merge the primitives of parallel key-insulation cryptosystem and signcryption with equality test to construct ID-based parallel key-insulated signcryption with a test for equality (ID-PKSET) in cloud computing. The construction prevent data forgery, data re-play attacks and reduces the leakage of secret keys in harsh environments. Our scheme attains the security property of existential unforgeable chosen message attack (EUF-CMA) and indistinquishable identity chosen ciphertext attack (IND-ID-CCA2) using random oracle model.

scholarly journals Pairing-Free Certificateless Signature with Security Proof

2014 ◽  
Vol 2014 ◽  
pp. 1-6 ◽  
Author(s):  
Wenhao Liu ◽  
Qi Xie ◽  
Shengbao Wang ◽  
Lidong Han ◽  
Bin Hu
Keyword(s):  
Discrete Logarithm ◽  
Random Oracle Model ◽  
Bilinear Pairings ◽  
Random Oracle ◽  
Public Key ◽  
Public Key Cryptosystem ◽  
Management Problem ◽  
Security Proof ◽  
Certificateless Public Key Cryptosystem ◽  
Certificateless Signature

Since certificateless public key cryptosystem can solve the complex certificate management problem in the traditional public key cryptosystem and the key escrow problem in identity-based cryptosystem and the pairing computation is slower than scalar multiplication over the elliptic curve, how to design certificateless signature (CLS) scheme without bilinear pairings is a challenge. In this paper, we first propose a new pairing-free CLS scheme, and then the security proof is presented in the random oracle model (ROM) under the discrete logarithm assumption. The proposed scheme is more efficient than the previous CLS schemes in terms of computation and communication costs and is more suitable for the applications of low-bandwidth environments.

PKE-ET-HS: Public Key Encryption with Equality Test for Heterogeneous Systems in IoT

2020 ◽  
Vol 113 (1) ◽  
pp. 313-335
Author(s):  
Rashad Elhabob ◽  
Yanan Zhao ◽  
Alzubair Hassan ◽  
Hu Xiong
Keyword(s):  
Heterogeneous Systems ◽  
Public Key ◽  
Public Key Encryption ◽  
Equality Test
Sign in / Sign up

Export Citation Format

Share Document