CHEN Ke-Fei, Editor of Journal of Cryptologic Research, Professor of Hangzhou Normal University

Deniable encryption allows a sender or a receiver, that has already executed an encrypted communication, to still produce a randomness or secret key that opens a ciphertext to another different plaintext, and thus enhances the security of traditional communication. Deniable encryption has found important applications including the prevention of vote-buying, secure multi-party computation, non-committing encryption, etc. However, through the development over twenty years, deniable encryption is still in the phase of theoretical study, and the concrete efficiency of all existing schemes is still low. The paper, that is entitled “Concretely Efficient Deniable Encryption Scheme from Single-key Functional Encryption” and was published in “Journal of Cryptologic Research” in 2022, proposed an efficient approach of designing deniable encryption schemes based on new functional encryption. In the case that a sender shares the secret key with a receiver, this paper designed two kinds of concretely efficient deniable encryption schemes, and both of them achieve the optimal length of deniable keys. The ciphertext length of the proposed deniable edit scheme reduces that of the scheme by Goldwasser et al. (TCC 2017) by about a half. The plan-ahead deniable encryption scheme proposed in this paper can achieve constant ciphertext rate, and supports highly efficient encryption of long plaintexts. This paper will promote the development of deniable encryption from theoretical study to practical application, and can provide inspiration and reference for researchers in the area.

Article

Concretely Efficient Deniable Encryption Scheme from Single-key Functional Encryption

Cite

YANG K, ZHANG J. Concretely efficient deniable encryption scheme from single-key functional encryption[J]. Journal of Cryptologic Research, 2022, 9(2): 353–378. [DOI: 10.13868/j.cnki.jcr.000524]