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

IEEE Transactions on Communications

Construction of Quantum Anamorphic Evolving Dynamic-Threshold Secret-Sharing Schemes

Shion Samadder Chaudhury, Sayantan Ganguly

Published Jul 8, 2025• 2 citations
Publisher

Abstract

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.

DOI
10.1109/tcomm.2025.3587045

Related papers

On quantum evolving schemes

Shion Samadder Chaudhury

A quantum secret sharing scheme is a method to share a quantum secret among participants in such a way that only certain specified subsets of the set of participants can combine to recover the secret. A quantum evolving secret sharing scheme is a recently introduced variant of secret sharing schemes where the sets of participants is not fixed and an unbounded and unspecified number of participants arrive one by one with time. The number of participants can be potentially infinite and and a quantum secret is shared and protected among the participants. The existing construction has some major drawbacks such as 1) the exponential quantum memory requirement and 2) the very high dimensions of the shares which makes the scheme difficult to implement. In this paper we overcome these drawbacks by constructing a scheme which uses quantum memory linear in the number of participants and significantly improves on the dimensions of the shares of the participants. This construction uses quantum secret redistribution and trap codes. The construction is flexible and can be modified to different types of access structures(subsets of participants which can recover the secret). Certain ramp properties can also be incorporated in the scheme.

Quantum Information and Computation•Apr 1, 2022•1 citation

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

Experimental Analysis of Quantum Anamorphic Evolving Dynamic Threshold Secret-Sharing: A Proof of Concept Study

Ayush Banerjee, Rajesh Doriya, Kapil Kumar Soni

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.

International Conference on Trends in Quantum Computing and Emerging Business Technologies (TQCEBT)•Apr 1, 2026•0 citations

Lattice-Based Threshold Secret Sharing Scheme and Its Applications: A Survey

Jingyu Chen, Haitao Deng, Huachang Su +2 more

As the most popular cryptographic scheme in the post-quantum field, lattices have received extensive attention and research. Not only do they provide quantum-resistant security, they also enable the construction of complex applications. Currently, lattice cryptography schemes based on different difficult problems have been applied in different fields. The threshold secret sharing (TSS) scheme is an important field of cryptography and has important application value and development prospects in key protection, secure multi-party computation, privacy protection, etc. However, with the rapid development of quantum computing, many existing cryptography-underlying technologies are facing huge difficulties and challenges. Therefore, post-quantum TSS has important research significance and value for the future development of cryptography. In this paper, we summarize the existing secret sharing schemes based on lattice-hard problems and the relevant applications of these schemes in the post-quantum realm. We classify existing lattice-based TSS according to different functions and introduce typical solutions. To the best of our knowledge, this is the first review paper on lattice-based TSS schemes.

Electronics•Jan 8, 2024•21 citations

Secret sharing scheme based on the Goldwasser-Goldrich-Halevi cryptosystem

Artemii Likhachov, Bogdana Oliynyk

With the development of quantum technologies, the issue of research and implementation of cryptographic primitives based on complex problems for quantum computing becomes relevant. Such cryptographic primitives are resistant to quantum cryptanalysis. Examples of problems with exponential complexity for quantum computing is lattice problems such as finding the shortest vector or finding the closest vector. One of the first and most famous quantum-resistant cryptosystems that use lattice problems as the basis of its mathematical apparatus is the Goldwasser-Goldrich-Halevi cryptosystem.A secret distribution scheme is a fundamental cryptographic primitive that allows the distribution of a secret among a set of participants while the secret recovery is possible only when all or a certain part of the participants (the threshold of participants) is authorized. Also, a necessary condition for a secret distribution scheme is the impossibility of individual participants, or groups of participants whose number is less than the threshold, to recover the secret. Variants of constructing secret sharing schemes on various mathematical models, including lattices, are currently being actively studied since they allow for security multiparty calculations and secure information dissemination by distributing the original data between different servers. It is also used for constructing compilers of schemes with protection against leakage, etc. In this paper, a new quantum-stable n-threshold secret sharing scheme for n participants, based on the Goldwasser-Goldrich-Halevi cryptosystem, is proposed.

Mohyla Mathematical Journal•May 12, 2025•1 citation

Quantum Access Structure and Secret Sharing

Chen‐Ming Bai, Zhihui Li, Yongming Li

In this paper we define a kind of decomposition for a quantum access structure. We propose a conception of minimal maximal quantum access structure and obtain a sufficient and necessary condition for minimal maximal quantum access structure, which shows the relationship between the number of minimal authorized sets and that of the players. Moreover, we investigate the construction of efficient quantum secret schemes by using these techniques, a decomposition and minimal maximal quantum access structure. A major advantage of these techniques is that it allows us to construct a method to realize a general quantum access structure. For these quantum access structures, we present two quantum secret schemes via the idea of concatenation or a decomposition of a quantum access structure. As a consequence, the application of these techniques allow us to save more quantum shares and reduce more cost than the existing scheme.

arXiv:1701.01951•Jan 8, 2017•0 citations
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.
A quantum secret sharing scheme is a method to share a quantum secret among participants in such a way that only certain specified subsets of the set of participants can combine to recover the secret. A quantum evolving secret sharing scheme is a recently introduced variant of secret sharing schemes where the sets of participants is not fixed and an unbounded and unspecified number of participants arrive one by one with time. The number of participants can be potentially infinite and and a quantum secret is shared and protected among the participants. The existing construction has some major drawbacks such as 1) the exponential quantum memory requirement and 2) the very high dimensions of the shares which makes the scheme difficult to implement. In this paper we overcome these drawbacks by constructing a scheme which uses quantum memory linear in the number of participants and significantly improves on the dimensions of the shares of the participants. This construction uses quantum secret redistribution and trap codes. The construction is flexible and can be modified to different types of access structures(subsets of participants which can recover the secret). Certain ramp properties can also be incorporated in the scheme.
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.
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%\mathbf{1 0 0} \boldsymbol{\%}100%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.
As the most popular cryptographic scheme in the post-quantum field, lattices have received extensive attention and research. Not only do they provide quantum-resistant security, they also enable the construction of complex applications. Currently, lattice cryptography schemes based on different difficult problems have been applied in different fields. The threshold secret sharing (TSS) scheme is an important field of cryptography and has important application value and development prospects in key protection, secure multi-party computation, privacy protection, etc. However, with the rapid development of quantum computing, many existing cryptography-underlying technologies are facing huge difficulties and challenges. Therefore, post-quantum TSS has important research significance and value for the future development of cryptography. In this paper, we summarize the existing secret sharing schemes based on lattice-hard problems and the relevant applications of these schemes in the post-quantum realm. We classify existing lattice-based TSS according to different functions and introduce typical solutions. To the best of our knowledge, this is the first review paper on lattice-based TSS schemes.
With the development of quantum technologies, the issue of research and implementation of cryptographic primitives based on complex problems for quantum computing becomes relevant. Such cryptographic primitives are resistant to quantum cryptanalysis. Examples of problems with exponential complexity for quantum computing is lattice problems such as finding the shortest vector or finding the closest vector. One of the first and most famous quantum-resistant cryptosystems that use lattice problems as the basis of its mathematical apparatus is the Goldwasser-Goldrich-Halevi cryptosystem.A secret distribution scheme is a fundamental cryptographic primitive that allows the distribution of a secret among a set of participants while the secret recovery is possible only when all or a certain part of the participants (the threshold of participants) is authorized. Also, a necessary condition for a secret distribution scheme is the impossibility of individual participants, or groups of participants whose number is less than the threshold, to recover the secret. Variants of constructing secret sharing schemes on various mathematical models, including lattices, are currently being actively studied since they allow for security multiparty calculations and secure information dissemination by distributing the original data between different servers. It is also used for constructing compilers of schemes with protection against leakage, etc. In this paper, a new quantum-stable n-threshold secret sharing scheme for n participants, based on the Goldwasser-Goldrich-Halevi cryptosystem, is proposed.
In this paper we define a kind of decomposition for a quantum access structure. We propose a conception of minimal maximal quantum access structure and obtain a sufficient and necessary condition for minimal maximal quantum access structure, which shows the relationship between the number of minimal authorized sets and that of the players. Moreover, we investigate the construction of efficient quantum secret schemes by using these techniques, a decomposition and minimal maximal quantum access structure. A major advantage of these techniques is that it allows us to construct a method to realize a general quantum access structure. For these quantum access structures, we present two quantum secret schemes via the idea of concatenation or a decomposition of a quantum access structure. As a consequence, the application of these techniques allow us to save more quantum shares and reduce more cost than the existing scheme.