Quantum Anamorphic evolving secret sharing protocol is one of the best solution to share secret messages in high censorship regimes. This work discusses about real time deployment of the quantum anamorphic encryption protocol proposed by Samadder and Chaudhary as a proof of concept study. We record the quantum fidelity rates, the protocol's computational overhead resource consumption and the scalability in relation to the present NISQ quantum devices. The results show$\mathbf{1 0 0} \boldsymbol{\%}$fidelity rates for the covert secret, which is in alignment with the theoretical estimations. Furthermore, we also propose a circuit and analyse circuit depth analysis for implementing this using IBM Qiskit framework. We use 4096 shots by IBM Aer simulator to run the proposed model and report that the adversary cant detect the hidden covert message with a probability rate of approx 0.0008%. The trap encoding works with giving an output of 7% for each possible outcome implying the concept of indistinguishability working fine.
Quantum Anamorphic evolving secret sharing protocol is one of the best solution to share secret messages in high censorship regimes. This work discusses about real time deployment of the quantum anamorphic encryption protocol proposed by Samadder and Chaudhary as a proof of concept study. We record the quantum fidelity rates, the protocol's computational overhead resource consumption and the scalability in relation to the present NISQ quantum devices. The results show100%fidelity rates for the covert secret, which is in alignment with the theoretical estimations. Furthermore, we also propose a circuit and analyse circuit depth analysis for implementing this using IBM Qiskit framework. We use 4096 shots by IBM Aer simulator to run the proposed model and report that the adversary cant detect the hidden covert message with a probability rate of approx 0.0008%. The trap encoding works with giving an output of 7% for each possible outcome implying the concept of indistinguishability working fine.
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.
We propose the concept ofQuantum Anamorphic Evolving Secret-Sharing(QAESS), combining two different cryptographic primitives in this paper. In QAESS, we have theanamorphic property, allowing alternate secrets to be embedded within the primary secret-sharing framework, accessible only under specific constraints, and theevolvingproperty ofsecret-sharing(ESS) where the scheme can dynamically adapt by accommodating potentially an infinite number of new parties without reinitialization. To achieve this, the major hurdles we encounter are 1) the large dimensions of shares and the requirement of huge quantum memory, and 2) the system breakdown by inserting a spy. In our first construction, we present a QAESS scheme, and in the second construction, we use secret redistribution to mitigate the above challenges. Our constructions extensively use quantum trap codes, random permutations, and data structure techniques. We analyze the schemes’ efficiency, scalability, and robustness through theoretical proofs and complexity estimates. This integration of quantum anamorphism and evolving properties finds potential application in several Internet of Things (IoT) and other practical scenarios. We close the paper by discussing several advantages of our constructions and some interesting problems for further study.
Anamorphic signatures allow covert communication through signatures in environments where encryption is restricted. They enable trusted recipients with a double-key to extract hidden messages while the signature remains indistinguishable from a regular one. However, the traditional notion of anamorphic signatures suffers from vulnerabilities, particularly when a single recipient or sender is compromised, exposing all hidden messages and providing undeniable proof that citizens are part of the anamorphic exchange. To address these limitations, we explore a threshold-based approach to distribute trust among multiple recipients, preventing adversaries from decrypting anamorphic messages even if some recipients are compromised. Our first contribution is the formalization of the notion of threshold-recipient anamorphic signatures, where decryption is possible only through collaboration among a subset of recipients. We then explore a stronger model in which the dictator controls the key-generation process through which it learns all secret keys, as well as how citizens store cryptographic keys. A particular example of this model in the real world is a dictator providing citizens with electronic identity documents (eIDs) and blocking all other usage of cryptography. We demonstrate that anamorphic communication is still possible even in such a scenario. Our construction is secure against quantum adversaries and does not rely on any computational assumptions beyond the random-oracle model. Finally, we present an impossibility result for encoding anamorphic messages with a threshold-sender model when using many existing threshold signature schemes, even when the adversary is part of the signing group. Our work outlines both the possibilities and limitations of extending anamorphic signatures with threshold cryptography, offering new insights into improving the security and privacy of individuals under authoritarian regimes.
Quantum communication protocols can be designed to detect eavesdropping attacks, something that classical technologies are unable to do since classical information can be replicated in a non-destructive manner. Eavesdropping detection is, therefore, a standard feature in all the proposed quantum secret sharing (QSS) protocols. However, detection is often done by a statistical analysis of the outcome of multiple decoy rounds, and this causes a significant communication overhead.
In our quest for a QSS protocol that works even in one round, we came across a one-shot secret-sharing framework proposed by Hsu (Phys. Rev. A 2003). The scheme was designed to work over public channels without requiring multiple rounds to detect eavesdropping but it lacked a thorough security analysis. In this work we present a complete characterisation of the correctness and security properties of this framework. Our characterisation allowed us to improve the original protocol to be more resistant towards eavesdropping. However, we prove a couple of impossibility results, including one that dictates that complete security against an eavesdropper is not possible in this framework. Thus, it is not possible to design a perfect QSS using this framework.
Quantum secret sharing is a cryptographic scheme that enables the secure storage and reconstruction of quantum information. While the theory of secret sharing is mature in its development, relatively few studies have explored the performance of quantum secret sharing on actual devices. In this work, we provide a pedagogical description of encoding and decoding circuits for different secret sharing codes, and we test their performance on IBM’s 127-qubit Brisbane system. We evaluate the quality of the implementation by performing a SWAP test between the decoded state and the ideal one, as well as by estimating how well the code preserves entanglement with a reference system. The results indicate that a ((3,5)) threshold secret sharing scheme and a non-threshold 7-qubit scheme perform similarly based on the SWAP test and entanglement fidelity, with both attaining a roughly 70–75% pass rate on the SWAP test for the reconstructed secret. We also investigate one implementation of a ((2,3)) qutrit threshold scheme and find that it performs the worst of all, which is expected due to the additional number of multi-qubit gate operations needed to encode and decode qutrits. A comparison is also made between schemes using mid-circuit measurement versus delayed-circuit measurement.
Anamorphic encryption is a cryptographic paradigm that allows covert messages to be hidden inside ordinary ciphertexts of a public-key encryption scheme. The covert channel is enabled by a secret double-key shared between the sender and an authorized receiver. Even if an adversary coerces the receiver into revealing the secret-key, the hidden communication remains undetectable without the double-key. Existing formulations of asymmetric anamorphic encryption suffer from two limitations. First, key pairs of a public-key encryption scheme and double-keys are tightly coupled: once a public-key is deployed, it is no longer possible to associate fresh double-keys with it. Second, existing constructions of asymmetric anamorphic encryption either rely on additional cryptographic primitives or on stronger structural assumptions, or they are scheme-specific.In this work, we refine the syntax of asymmetric anamorphic encryption so that double-key generation is separated from key deployment, allowing multiple double-keys to be registered with the same public-key after setup. We then construct an asymmetric anamorphic encryption scheme from the group-action-based public-key encryption scheme $ \mathsf{gaPKE} $, which is built from a regular effective group action over a commutative group. The resulting scheme is secure in the standard model. Our construction combines a hybrid encryption scheme, built under the $ \textsf{GA-DDH}$ assumption and entropy smoothing of hash functions, with a second independent group-action instance that carries the covert message. The resulting scheme satisfies anamorphic security, sender indistinguishability under chosen-plaintext attack security and colluder indistinguishability under chosen-plaintext attack security. We instantiate our framework in both post-quantum and classical settings. Using $ \textsf{CSIDH}$ group actions, we obtain the first isogeny-based asymmetric anamorphic encryption scheme. Using $ \textsf{DDH}$-hard groups, we obtain a classical anamorphic encryption scheme based on hashed ElGamal.