Inicio  /  Applied Sciences  /  Vol: 11 Par: 24 (2021)  /  Artículo
ARTÍCULO
TITULO

Efficient Lattice-Based Cryptosystems with Key Dependent Message Security

Bo Yang    
Ruwei Huang and Jianan Zhao    

Resumen

Key-dependent message (KDM) security is of great research significance, to better analyse and solve the potential security problems in complex application scenarios. Most of the current KDM security schemes are based on traditional hard mathematical problems, where the public key and ciphertext are not compact enough, and make the ciphertext size grow linearly with the degree of the challenge functions. To solve the above problems and the inefficient ciphertext operation, the authors propose a compact lattice-based cryptosystem with a variant of the RLWE problem, which applies an invertible technique to obtain the RLWE* RLWE * problem. It remains hard after the modification from the RLWE problem. Compared with the ACPS scheme, our scheme further expands the set of challenge functions based on the affine function of the secret key, and the size of public key and ciphertext is ??~(??) O ? ( n ) , which is independent of the challenge functions. In addition, this scheme enjoys a high level of efficiency, the cost of encryption and decryption is only ploylog(??) ploylog ( n ) bit operations per message symbol, and we also prove that our scheme is KDM-CPA secure under the RLWE* RLWE * assumption.

 Artículos similares

       
 
Tao Feng, Dewei Wang and Renbin Gong    
When choosing a third-party cloud storage platform, the confidentiality of data should be the primary concern. To address the issue of one-to-many access control during data sharing, it is important to encrypt data with an access policy that enables fine... ver más
Revista: Information

 
Yongbo Jiang, Juncheng Lu and Tao Feng    
Searchable encryption is a keyword-based ciphertext retrieval scheme, which can selectively retrieve encrypted documents on encrypted cloud data. Most existing searchable encryption schemes focus only on exact keyword searches and cannot return data of i... ver más
Revista: Information

 
Zhu Fang and Zhengquan Xu    
Advances in network technology have enhanced the concern for network security issues. In order to address the problem that hopping graph are vulnerable to external attacks (e.g., the changing rules of fixed graphs are more easily grasped by attackers) an... ver más
Revista: Information

 
Nursulu Kapalova, Kairat Sakan, Kunbolat Algazy and Dilmukhanbet Dyusenbayev    
A new symmetric block cipher algorithm called AL02 has been developed. The algorithm scheme provides five-round encryption of 128-bit blocks, while the data size at the input and output of the S-box is 8 bits. The main transformation is the F transformat... ver más
Revista: Computation

 
Angga Wijaya     Pág. 133 - 139
Classical cryptography is study of securing a secret message (plaintext) into a hidden message (ciphertext) which in the process changes each character. The process of converting plaintext into ciphertext is called encryption, the reverse process is call... ver más