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

Limits of Black-Box Anamorphic Encryption

Dario Catalano, Emanuele Giunta, Francesco Migliaro

Published Jan 1, 2024• 15 citations
Publisher
DOI
10.1007/978-3-031-68379-4_11

Related papers

Generic Anamorphic Encryption, Revisited: New Limitations and Constructions

Dario Catalano, Emanuele Giunta, Francesco Migliaro

Lecture notes in computer science•Jan 1, 2025•11 citations

Anamorphic Resistant Encryption: the Good, the Bad and the Ugly

Davide Carnemolla, Dario Catalano, Emanuele Giunta +1 more

Lecture notes in computer science•Jan 1, 2025•6 citations

Revisiting Security Definitions of Sender-Anamorphic Encryption

Yuichi Tanishita, Takahiro Matsuda, Kanta Matsuura

Lecture notes in computer science•Jan 1, 2026•0 citations

Anamorphic Encryption: Private Communication Against a Dictator

Giuseppe Persiano, Duong Hieu Phan, Moti M. Yung

Lecture notes in computer science•Jan 1, 2022•46 citations

Sender-Anamorphic Encryption Reformulated: Achieving Robust and Generic Constructions

Yi Wang, Rongmao Chen, Xinyi Huang +1 more

Lecture notes in computer science•Jan 1, 2023•23 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
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.