Practical Provably Secure Encryption Scheme Based on Hashed Bilinear Pairing

2021 ◽  
pp. 705-711
Author(s):  
Menglin Xiao ◽  
Yun Song ◽  
Ningning Wang
Keyword(s):  
Bilinear Pairing ◽  
Encryption Scheme ◽  
Provably Secure

scholarly journals Cryptanalysis of PMACx, PMAC2x, and SIVx

2017 ◽  
pp. 162-176
Author(s):  
Kazuhiko Minematsu ◽  
Tetsu Iwata
Keyword(s):  
Provable Security ◽  
Block Cipher ◽  
Query Complexity ◽  
Block Length ◽  
Encryption Scheme ◽  
Authenticated Encryption ◽  
Pseudorandom Functions ◽  
Tweakable Block Cipher ◽  
Deterministic Authenticated Encryption ◽  
Provably Secure

At CT-RSA 2017, List and Nandi proposed two variable input length pseudorandom functions (VI-PRFs) called PMACx and PMAC2x, and a deterministic authenticated encryption scheme called SIVx. These schemes use a tweakable block cipher (TBC) as the underlying primitive, and are provably secure up to the query complexity of 2n, where n denotes the block length of the TBC. In this paper, we falsify the provable security claims by presenting concrete attacks. We show that with the query complexity of O(2n/2), i.e., with the birthday complexity, PMACx, PMAC2x, and SIVx are all insecure.

An ElGamal-like Secure Channel Free Public Key Encryption with Keyword Search Scheme

2019 ◽  
Vol 30 (02) ◽  
pp. 255-273 ◽  
Author(s):  
Min-Shiang Hwang ◽  
Cheng-Chi Lee ◽  
Shih-Ting Hsu
Keyword(s):  
Keyword Search ◽  
Bilinear Pairing ◽  
Public Key ◽  
Encryption Scheme ◽  
Public Key Encryption ◽  
Keyword Guessing Attack ◽  
Elgamal Cryptosystem ◽  
Guessing Attack ◽  
Secure Channel

The idea of public key encryption with keyword search (PEKS), proposed by Boneh et al., enables one to send a trapdoor containing a encrypted keyword to query data without revealing the keyword. In Boneh et al.’s design, the trapdoor has to be transferred through a secure channel, which is both costly and inefficient. Baek et al. then proposed an efficient secure channel free public key encryption scheme with keyword search (SCF-PEKS). After that, vast amounts of research have focused on the protection against the off-line keyword guessing attack (OKGA) by enhancing the model. However, most of the PEKS/SCF-PEKS schemes developed so far are constructed by applying bilinear pairing and are susceptible to off-line keyword guessing attacks. In this paper, we propose a new SCF-PEKS scheme based on the ElGamal cryptosystem. The proposed scheme is not only secure against off-line keyword guessing attacks but also improves the efficiency.

Efficient and provably-secure certificateless proxy re-encryption scheme for secure cloud data sharing

2014 ◽  
Vol 19 (4) ◽  
pp. 398-405 ◽  
Author(s):  
Liang-liang Wang ◽  
Ke-fei Chen ◽  
Xian-ping Mao ◽  
Yong-tao Wang
Keyword(s):  
Data Sharing ◽  
Encryption Scheme ◽  
Cloud Data ◽  
Provably Secure

Implementation of a Double Sequence Encryption Scheme Based on Chaotic Map

2013 ◽  
Vol 765-767 ◽  
pp. 1073-1076
Author(s):  
Fu Xiang Zhao
Keyword(s):  
Change Detection ◽  
Chaotic Map ◽  
Double Sequence ◽  
Time Sequence ◽  
Practical Implementation ◽  
Encryption Scheme ◽  
Theoretical Evaluation ◽  
Disk Encryption ◽  
Provably Secure ◽  
Full Disk

this paper presents a new scheme for enhancing the security of full disk encryption relying on the double sequence encryption based on chaotic map in order to improve the performance of its practical implementation. The aims of the proposed scheme are to design a keystream generator for the tweakable enciphering mode in space or time sequence using the real-time embedded device through sequential change detection on the disk read-and-write request. This design of the scheme is based on re-keying principle and derived from information-theoretical evaluation. Analyses show that the scheme is provably secure and can prevent inner and outer attackers from attacking. To the best of our knowledge, the scheme offers the first comprehensive solution to the watermarking attack in the same sector.

scholarly journals Storage and Communication Security in Cloud Computing Using a Homomorphic Encryption Scheme Based Weil Pairing

2020 ◽  
Vol 26 (1) ◽  
pp. 78-83
Author(s):  
Demet Cidem Dogan ◽  
Huseyin Altindis
Keyword(s):  
Cloud Computing ◽  
Elliptic Curve ◽  
Data Transfer ◽  
Homomorphic Encryption ◽  
Discrete Logarithm ◽  
Original Data ◽  
Bilinear Pairing ◽  
Encryption Scheme ◽  
Weil Pairing ◽  
Encrypted Data

With introduction of smart things into our lives, cloud computing is used in many different areas and changes the communication method. However, cloud computing should guarantee the complete security assurance in terms of privacy protection, confidentiality, and integrity. In this paper, a Homomorphic Encryption Scheme based on Elliptic Curve Cryptography (HES-ECC) is proposed for secure data transfer and storage. The scheme stores the data in the cloud after encrypting them. While calculations, such as addition or multiplication, are applied to encrypted data on cloud, these calculations are transmitted to the original data without any decryption process. Thus, the cloud server has only ability of accessing the encrypted data for performing the required computations and for fulfilling requested actions by the user. Hence, storage and transmission security of data are ensured. The proposed public key HES-ECC is designed using modified Weil-pairing for encryption and additional homomorphic property. HES-ECC also uses bilinear pairing for multiplicative homomorphic property. Security of encryption scheme and its homomorphic aspects are based on the hardness of Elliptic Curve Discrete Logarithm Problem (ECDLP), Weil Diffie-Hellman Problem (WDHP), and Bilinear Diffie-Helman Problem (BDHP).

scholarly journals Implementation of an Attribute-Based Encryption Scheme Based on SM9

2019 ◽  
Vol 9 (15) ◽  
pp. 3074
Author(s):  
Yang Shi ◽  
Zhiyuan Ma ◽  
Rufu Qin ◽  
Xiaoping Wang ◽  
Wujing Wei ◽  
...  
Keyword(s):  
Smart Phone ◽  
Regulatory Compliance ◽  
Bilinear Pairing ◽  
Encryption Scheme ◽  
Sensitive Data ◽  
Fine Grained ◽  
Fundamental Building Block ◽  
Attribute Based Encryption ◽  
Identity Based ◽  
Computing Platforms

In recent years, attribute-based encryption (ABE) has been widely applied in mobile computing, cloud computing, and the Internet of things, for supporting flexible and fine-grained access control of sensitive data. In this paper, we present a novel attribute-based encryption scheme that is based on bilinear pairing over Barreto and Naehrig curves (BN-curves). The identity-based encryption scheme SM9, which is a Chinese commercial cryptographic standard and a forthcoming part of ISO/IEC11770-3, has been used as the fundamental building block, and thus we first introduce SM9 and present our SM9 implementation in details. Subsequently, we propose the design and implementation of the ABE scheme. Moreover, we also develop a hybrid ABE for achieving lower ciphertext expansion rate when the size of access structure or plaintext is large. The performance and energy consumption of the implementation of the proposed ABE and its hybrid version are evaluated with a workstation, a PC, a smart phone, and an embedded device. The experimental results indicated that our schemes work well on various computing platforms. Moreover, the proposed schemes and their implementations would benefit developers in building applications that fulfill the regulatory compliance with the Chinese commercial cryptographic standard since there is no existing ABE scheme compatible with any Chinese cryptographic standard.

Sign in / Sign up

Export Citation Format

Share Document