Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Lecture notes in computer science

Identity-Based Anamorphic Encryption from Lattices with Chosen-Ciphertext Security

Guotao Chai, Renjie Jin, Yi Wang, Longjiang Qu

Published Nov 3, 2026• 0 citations
Publisher
DOI
10.1007/978-981-92-7681-3_6

Related papers

Identity-Based Encryption Tightly Secure Under Chosen-Ciphertext Attacks

Dennis Hofheinz, Dingding Jia, Jiaxin Pan

Lecture notes in computer science•Jan 1, 2018•35 citations

Efficient Chosen-Ciphertext Secure Identity-Based Encryption with Wildcards

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

Springer eBooks•Jul 4, 2007•26 citations

Chosen Ciphertext Security for Blind Identity-Based Encryption with Certified Identities

Sohto Chiku, Keisuke Hara, Junji Shikata

Lecture notes in computer science•Jan 1, 2023•2 citations

Computational Quantum Anamorphic Encryption and Quantum Anamorphic Secret-Sharing

Sayantan Ganguly, Shion Samadder Chaudhury

The concept of anamorphic encryption, first formally introduced by Persiano et al. in their influential 2022 paper titled ``Anamorphic Encryption: Private Communication Against a Dictator,'' enables embedding covert messages within ciphertexts. One of the key distinctions between a ciphertext embedding a covert message and an original ciphertext, compared to an anamorphic ciphertext, lies in the indistinguishability between the original ciphertext and the anamorphic ciphertext. This encryption procedure has been defined based on a public-key cryptosystem. Initially, we present a quantum analogue of the classical anamorphic encryption definition that is based on public-key encryption. Additionally, we introduce a definition of quantum anamorphic encryption that relies on symmetric key encryption. Furthermore, we provide a detailed generalized construction of quantum anamorphic symmetric key encryption within a general framework, which involves taking any two quantum density matrices of any different dimensions and constructing a single quantum density matrix, which is the quantum anamorphic ciphertext containing ciphertexts of both of them. Subsequently, we introduce a definition of computational anamorphic secret-sharing and extend the work of Çakan et al. on computational quantum secret-sharing to computational quantum anamorphic secret-sharing, specifically addressing scenarios with multiple messages, multiple keys, and a single share function. This proposed secret-sharing scheme demonstrates impeccable security measures against quantum adversaries.

quant-pharXiv:2511.17924•Nov 25, 2025•0 citations

Identity-based encryption with leakage-amplified chosen-ciphertext attacks security

Yanwei Zhou, Bo Yang, Zhe Xia +2 more

Theoretical Computer Science•Dec 31, 2019•6 citations

Identity-Based Encryption Secure against Selective Opening Chosen-Ciphertext Attack

Junzuo Lai, Robert Huijie Deng, Shengli Liu +2 more

Lecture notes in computer science•Jan 1, 2014•32 citations
The concept of anamorphic encryption, first formally introduced by Persiano et al. in their influential 2022 paper titled ``Anamorphic Encryption: Private Communication Against a Dictator,'' enables embedding covert messages within ciphertexts. One of the key distinctions between a ciphertext embedding a covert message and an original ciphertext, compared to an anamorphic ciphertext, lies in the indistinguishability between the original ciphertext and the anamorphic ciphertext. This encryption procedure has been defined based on a public-key cryptosystem. Initially, we present a quantum analogue of the classical anamorphic encryption definition that is based on public-key encryption. Additionally, we introduce a definition of quantum anamorphic encryption that relies on symmetric key encryption. Furthermore, we provide a detailed generalized construction of quantum anamorphic symmetric key encryption within a general framework, which involves taking any two quantum density matrices of any different dimensions and constructing a single quantum density matrix, which is the quantum anamorphic ciphertext containing ciphertexts of both of them. Subsequently, we introduce a definition of computational anamorphic secret-sharing and extend the work of Çakan et al. on computational quantum secret-sharing to computational quantum anamorphic secret-sharing, specifically addressing scenarios with multiple messages, multiple keys, and a single share function. This proposed secret-sharing scheme demonstrates impeccable security measures against quantum adversaries.