aqora

Chosen-Ciphertext Secure Dual-Receiver Encryption in the Standard Model Based on Post-quantum Assumptions

Laurin Benz, Wasilij Beskorovajnov, Sarai Eilebrecht +3 more

Lecture notes in computer scienceJan 1, 20242 citations

Chosen Ciphertext Secure Identity-Based Broadcast Encryption in the Standard Model

孙瑾, 胡予濮, 张乐友

上海交通大学学报：英文版Jan 1, 20110 citations

Efficient Chosen-Ciphertext Secure Encryption from R-LWE

Ting Wang, Guoqiang Han, Jianping Yu +2 more

Wireless Personal CommunicationsFeb 1, 20175 citations

Efficient chosen ciphertext secure key encapsulation mechanism in standard model over ideal lattices

Xiaopeng Yang, Wenping Ma, Chengli Zhang

Key encapsulation mechanism (KEM) is an important key distribution mechanism that not only allows both sender and receiver to safely share a random session key, but also can be mainly applied to construct a hybrid public key encryption scheme. In this paper, we give an positive answer to the question of if it is possible to build an efficient KEM over lattices. More precisely, we design an efficient KEM scheme in standard model based on ideal lattices. We prove that the proposed scheme captures indistinguishability against active chosen ciphertext attacks (IND-CCA) under the ring learning with errors problem, or more formally, IND-CCA security. Compared with the current CCA secure KEM schemes based on lattices in the standard model, our scheme has shorter public key, secret key and encapsulation ciphertext. In addition, our KEM scheme realizes IND-CCA security in the standard model.Key encapsulation mechanism (KEM) is an important key distribution mechanism that not only allows both sender and receiver to safely share a random session key, but also can be mainly applied to construct a hybrid public key encryption scheme. In this paper, we give an positive answer to the question of if it is possible to build an efficient KEM over lattices. More precisely, we design an efficient KEM scheme in standard model based on ideal lattices. We prove that the proposed scheme captures indistinguishability against active chosen ciphertext attacks (IND-CCA) under the ring learning with errors problem, or more formally, IND-CCA security. Compared with the current CCA secure KEM schemes based on lattices in the standard model, our scheme has shorter public key, secret key and encapsulation ciphertext. In addition, our KEM scheme realizes IND-CCA security in the standard model.

International Journal of Computer MathematicsFeb 6, 20163 citations

Efficient Chosen-Ciphertext Secure Identity-Based Encryption with Wildcards

James Birkett, Alexander W. Dent, Gregory Neven +1 more

Abstract. We propose new instantiations of chosen-ciphertext secure identitybased encryption schemes with wildcards (WIBE). Our schemes outperform all existing alternatives in terms of efficiency as well as security. We achieve these results by extending the hybrid encryption (KEM–DEM) framework to the case of WIBE schemes. We propose and prove secure one generic construction in the random oracle model, and one direct construction in the standard model. 1

Lecture notes in computer scienceJan 1, 20060 citations

A LWE-Based Receiver-Deniable Encryption Scheme

Po-Wen Chi, Ming-Hung Wang, Yun‐Hsin Chuang

Smart innovation, systems and technologiesNov 29, 20220 citations

Efficient RLWE Based Chosen-Ciphertext Secure Dual-Receiver Encryption and Sender-Binding KEM in the Standard Model

Related papers

Efficient RLWE Based Chosen-Ciphertext Secure Dual-Receiver Encryption and Sender-Binding KEM in the Standard Model

Related papers