scholarly journals Efficient Chosen Ciphertext Secure Public Key Encryption under the Computational Diffie-Hellman Assumption

2008 ◽  
pp. 308-325 ◽  
Author(s):  
Goichiro Hanaoka ◽  
Kaoru Kurosawa
Keyword(s):  
Public Key ◽  
Public Key Encryption ◽  
Diffie Hellman

scholarly journals Certificateless Public Key Encryption Scheme with Hybrid Problems and Its Application to Internet of Things

2014 ◽  
Vol 2014 ◽  
pp. 1-9 ◽  
Author(s):  
Rui Guo ◽  
Qiaoyan Wen ◽  
Huixian Shi ◽  
Zhengping Jin ◽  
Hua Zhang
Keyword(s):  
Internet Of Things ◽  
Public Key Cryptography ◽  
Public Key ◽  
Encryption Scheme ◽  
Public Key Encryption ◽  
Certificateless Cryptography ◽  
Diffie Hellman ◽  
Identity Based ◽  
Certificate Management ◽  
Certificateless Public Key Encryption

Certificateless cryptography aims at combining the advantages of public key cryptography and identity based cryptography to avoid the certificate management and the key escrow problem. In this paper, we present a novel certificateless public key encryption scheme on the elliptic curve over the ring, whose security is based on the hardness assumption of Bilinear Diffie-Hellman problem and factoring the large number as in an RSA protocol. Moreover, since our scheme requires only one pairing operation in decryption, it is significantly more efficient than other related schemes. In addition, based on our encryption system, we also propose a protocol to protect the confidentiality and integrity of information in the scenario of Internet of Things with constrained resource nodes.

Complexity results for security protocols with Diffie-Hellman exponentiation and commuting public key encryption

2008 ◽  
Vol 9 (4) ◽  
pp. 1-52 ◽  
Author(s):  
Yannick Chevalier ◽  
Ralf Küsters ◽  
Michaël Rusinowitch ◽  
Mathieu Turuani
Keyword(s):  
Security Protocols ◽  
Public Key ◽  
Public Key Encryption ◽  
Complexity Results ◽  
Diffie Hellman

scholarly journals Efficient KDM-CCA Secure Public-Key Encryption via Auxiliary-Input Authenticated Encryption

2017 ◽  
Vol 2017 ◽  
pp. 1-27 ◽  
Author(s):  
Shuai Han ◽  
Shengli Liu ◽  
Lin Lyu
Keyword(s):  
Public Key ◽  
Authenticated Encryption ◽  
Public Key Encryption ◽  
Secret Key ◽  
Diffie Hellman ◽  
Affine Functions ◽  
Generic Construction ◽  
Hash Proof System ◽  
Auxiliary Input ◽  
Ddh Assumption

KDM[F]-CCA security of public-key encryption (PKE) ensures the privacy of key-dependent messages f(sk) which are closely related to the secret key sk, where f∈F, even if the adversary is allowed to make decryption queries. In this paper, we study the design of KDM-CCA secure PKE. To this end, we develop a new primitive named Auxiliary-Input Authenticated Encryption (AIAE). For AIAE, we introduce two related-key attack (RKA) security notions, including IND-RKA and weak-INT-RKA. We present a generic construction of AIAE from tag-based hash proof system (HPS) and one-time secure authenticated encryption (AE) and give an instantiation of AIAE under the Decisional Diffie-Hellman (DDH) assumption. Using AIAE as an essential building block, we give two constructions of efficient KDM-CCA secure PKE based on the DDH and the Decisional Composite Residuosity (DCR) assumptions. Specifically, (i) our first PKE construction is the first one achieving KDM[Faff]-CCA security for the set of affine functions and compactness of ciphertexts simultaneously. (ii) Our second PKE construction is the first one achieving KDM[Fpolyd]-CCA security for the set of polynomial functions and almost compactness of ciphertexts simultaneously. Our PKE constructions are very efficient; in particular, they are pairing-free and NIZK-free.

scholarly journals Tightly Secure Lossy Trapdoor Functions: Constructions and Applications

2019 ◽  
Vol 2019 ◽  
pp. 1-13
Author(s):  
Baodong Qin
Keyword(s):  
Polynomial Time ◽  
Public Key ◽  
Formal Definition ◽  
Public Key Encryption ◽  
Trapdoor Functions ◽  
Diffie Hellman ◽  
Encryption Schemes ◽  
Lossy Trapdoor Functions ◽  
Tight Security ◽  
Probabilistic Polynomial Time

Lossy trapdoor functions (LTFs), introduced by Peiker and Waters in STOC’08, are functions that may be working in another injective mode or a lossy mode. Given such a function key, it is impossible to distinguish an injective key from a lossy key for any (probabilistic) polynomial-time adversary. This paper studies lossy trapdoor functions with tight security. First, we give a formal definition for tightly secure LTFs. Loosely speaking, a collection of LTFs is tightly secure if the advantage to distinguish a tuple of injective keys from a tuple of lossy keys does not degrade in the number of function keys. Then, we show that tightly secure LTFs can be used to construct public-key encryption schemes with tight CPA security in a multiuser, multichallenge setting, and with tight CCA security in a multiuser, one-challenge setting. Finally, we present a construction of tightly secure LTFs from the decisional Diffie-Hellman assumption.

scholarly journals Mutual query data sharing protocol for public key encryption through chosen-ciphertext attack in cloud environment

2022 ◽  
Vol 12 (1) ◽  
pp. 853
Author(s):  
Tarasvi Lakum ◽  
Barige Thirumala Rao
Keyword(s):  
Data Sharing ◽  
Public Key ◽  
Communication Overhead ◽  
Public Key Encryption ◽  
Cloud Environment ◽  
Diffie Hellman ◽  
User Data ◽  
Time Limitations ◽  
Chosen Ciphertext Attack ◽  
Existing Data

<p><span>In this paper, we are proposing a mutual query data sharing protocol (MQDS) to overcome the encryption or decryption time limitations of exiting protocols like Boneh, rivest shamir adleman (RSA), Multi-bit transposed ring learning parity with noise (TRLPN), ring learning parity with noise (Ring-LPN) cryptosystem, key-Ordered decisional learning parity with noise (kO-DLPN), and KD_CS protocol’s. Titled scheme is to provide the security for the authenticated user data among the distributed physical users and devices. The proposed data sharing protocol is designed to resist the chosen-ciphertext attack (CCA) under the hardness solution for the query shared-strong diffie-hellman (SDH) problem. The evaluation of proposed work with the existing data sharing protocols in computational and communication overhead through their response time is evaluated.</span></p>

A New Framework of IND-CCA Secure Public Key Encryption with Keyword Search

2020 ◽  
Vol 63 (12) ◽  
pp. 1849-1858 ◽  
Author(s):  
Sha Ma ◽  
Qiong Huang
Keyword(s):  
Keyword Search ◽  
Public Key ◽  
Public Key Encryption ◽  
Diffie Hellman ◽  
The Standard Model ◽  
Identity Based ◽  
Hash Key ◽  
Chosen Ciphertext Attack ◽  
Security Notion ◽  
New Framework

Abstract In the era of cloud computing, public key encryption with keyword search (PEKS) is an extremely useful cryptographic tool for searching on encryption data, whose strongest security notion is indistinguishability encryption against chosen ciphertext attack (ind-cca). Adballa et al. presented a transformation from identity based encryption (IBE) to PEKS in the Theory of Cryptography Conference 2010. This paper proposes a new framework of ind-cca secure PEKS in the standard model. Our main technical tool is a newly introduced notion of smooth projective hash function with key mapping, in which the hash key hk is mapped into another mapping projection key mhp besides the classical projection key hp. Finally, we provide an instantiation of our framework based on symmetric eXternal Diffie–Hellman assumption.

Provably Secure Length-saving Public-Key Encryption Scheme under the Computational Diffie-Hellman Assumption

ETRI Journal ◽  
2000 ◽  
Vol 22 (4) ◽  
pp. 25-31 ◽  
Author(s):  
Joonsang Baek Baek ◽  
Byoungcheon Lee Lee ◽  
Kwangjo Kim Kim
Keyword(s):  
Public Key ◽  
Encryption Scheme ◽  
Public Key Encryption ◽  
Diffie Hellman ◽  
Provably Secure
Sign in / Sign up

Export Citation Format

Share Document