Quantum Random Oracle Model for Quantum Public-Key Encryption

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.

Download Full-text

Practical Public-Key Encryption Scheme Tightly Secure in the Random Oracle Model

IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences ◽

10.1587/transfun.2019cip0020 ◽

2020 ◽

Vol E103.A (1) ◽

pp. 165-172

Author(s):

Yusuke SAKAI ◽

Goichiro HANAOKA

Keyword(s):

Random Oracle Model ◽

Random Oracle ◽

Public Key ◽

Encryption Scheme ◽

Public Key Encryption

Download Full-text

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

The Computer Journal ◽

10.1093/comjnl/bxz044 ◽

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.

Download Full-text

Quantum public-key encryption protocols with information-theoretic security

10.1117/12.922444 ◽

2012 ◽

Cited By ~ 5

Author(s):

Li Yang ◽

Biyao Yang ◽

Jiangyou Pan

Keyword(s):

Public Key ◽

Public Key Encryption ◽

Information Theoretic ◽

Information Theoretic Security ◽

Quantum Public Key

Download Full-text

Keyword guessing attacks on a public key encryption with keyword search scheme without random oracle and its improvement

Information Sciences ◽

10.1016/j.ins.2018.12.004 ◽

2019 ◽

Vol 479 ◽

pp. 270-276 ◽

Cited By ~ 13

Author(s):

Yang Lu ◽

Gang Wang ◽

Jiguo Li

Keyword(s):

Keyword Search ◽

Random Oracle ◽

Public Key ◽

Public Key Encryption

Download Full-text

Pairing-Free Certificateless Signature with Security Proof

Journal of Computer Networks and Communications ◽

10.1155/2014/792063 ◽

2014 ◽

Vol 2014 ◽

pp. 1-6 ◽

Cited By ~ 3

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.

Download Full-text

Another Attack on Tso's Short Signature Scheme Based on Bilinear Pairings

Applied Mechanics and Materials ◽

10.4028/www.scientific.net/amm.63-64.785 ◽

2011 ◽

Vol 63-64 ◽

pp. 785-788

Author(s):

Fan Yu Kong ◽

Lei Wu ◽

Jia Yu

Keyword(s):

Random Oracle Model ◽

Bilinear Pairings ◽

Random Oracle ◽

Public Key ◽

Signature Scheme ◽

Short Signature ◽

Provably Secure

In 2009, R. Tso et al. proposed an efficient pairing-based short signature scheme which is provably secure in the Random Oracle Model. In this paper, we propose a new key substitution attack on Raylin Tso et al.’s short signature scheme. For a given message and the corresponding valid signature, the malicious attacker can generate a substituted public key. Everyone verifies the signature successfully with the malicious attacker’s substituted public key. Therefore, Raylin Tso et al.’s short signature scheme has a security flaw in the multi-user setting.

Download Full-text