How to reconstruct (anonymously) a secret cellular automaton

• URL: http://arxiv.org/abs/2604.11362v1
• Date: Mon, 13 Apr 2026 12:04:06 GMT
• Title: How to reconstruct (anonymously) a secret cellular automaton
• Abstract summary: We consider threshold secret sharing schemes based on cellular automata (CA) that allows for anonymous reconstruction.<n>We show that the new resulting scheme enables anonymous reconstruction of secret CA rules.
• Score: 1.018462284491991
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We consider threshold secret sharing schemes based on cellular automata (CA) that allows for anonymous reconstruction, meaning that the secret can be recovered only as a function of the shares, without knowing the participants' identities. To this end, we revisit the basic characterization of $(2,n)$ threshold schemes based on CA in terms of Mutually Orthogonal Latin Squares (MOLS), and redefine the secret space as the MOLS family itself, showing that the new resulting scheme enables anonymous reconstruction of secret CA rules. Finally, we discuss the trade-off between the number of secret CA that can be shared and the computational complexity of the recovery phase.

Related papers

• Encrypted Cloning, Absolute Maximal Entanglement and Quantum Secret Sharing [0.0]
  We develop a framework for arbitrary dimensions based on Weyl-Heisenberg displacement operators.<n>We prove that an encrypted qudit system comprising two signal-noise qudit pairs is equivalent to a five-party AME state in any dimension.
  arXiv  Detail & Related papers  (2026-05-26T11:24:54Z)
• Geometric Factual Recall in Transformers [57.48371649045765]
  A common view casts internal weight matrices as associative memories over pairs of embeddings, requiring memorization counts that scale linearly with the number of facts.<n>We develop a theoretical and empirical account of an alternative, emphgeometric form of memorization in which learned embeddings encode structure directly.<n>In a controlled setting where a single-layer transformer must memorize random vectors from subjects to a shared attribute set, we prove that a logarithmic embedding dimension suffices.<n>We extend these results to the multi-hop setting, providing constructions with and without chain-of-thought that exhibit a provable
  arXiv  Detail & Related papers  (2026-05-12T17:22:22Z)
• Encrypted clones can leak: Classification of informative subsets in Quantum Encrypted Cloning [1.9201151941485035]
  We classify subsets of the encrypted-clone storage register into authorized, completely non-informative, and partially informative sets.<n>We show that intermediate non-authorized subsets may retain only a restricted residual dependence on the input state.
  arXiv  Detail & Related papers  (2026-04-11T11:02:06Z)
• Cloning Games, Black Holes and Cryptography [50.022147589030304]
  We introduce a new toolkit for analyzing cloning games.<n>This framework allows us to analyze a new cloning game based on binary phase states.<n>We show that the binary phase variantally optimal bound offers quantitative insights into information scrambling in idealized models of black holes.
  arXiv  Detail & Related papers  (2024-11-07T14:09:32Z)
• Secret Sharing with Certified Deletion [4.082216579462796]
  Secret sharing allows a user to split a secret into many shares so that the secret can be recovered if, and only if, an authorized set of shares is collected. In secret sharing with certified deletion, a (classical) secret is split into quantum shares which can be verifiably destroyed. We show how to construct (i) a secret sharing scheme with no-signaling certified deletion for any monotone access structure, and (ii) a threshold secret sharing scheme with adaptive certified deletion.
  arXiv  Detail & Related papers  (2024-05-13T19:01:08Z)
• A Construction of Evolving $k$-threshold Secret Sharing Scheme over A Polynomial Ring [55.17220687298207]
  The threshold secret sharing scheme allows the dealer to distribute the share to every participant that the secret is correctly recovered from a certain amount of shares. We propose a brand-new construction of evolving $k$-threshold secret sharing scheme for an $ell$-bit secret over a ring, with correctness and perfect security.
  arXiv  Detail & Related papers  (2024-02-02T05:04:01Z)
• Quantum Secret Reconstruction [2.8233507229238177]
  This paper proposes the first quantum secret reconstruction protocol based on cluster states. It is shown that the proposed protocol is secure against several common attacks.
  arXiv  Detail & Related papers  (2023-06-15T05:24:29Z)
• Controlled State Reconstruction and Quantum Secret Sharing [0.0]
  We present a benchmark for resource characterization in the process of controlled quantum state reconstruction and secret sharing. We formulate the idea of quantum advantage in approximate state reconstruction as surpassing the classical limit set at 2/3. This article brings out new interoperability between teleportation and state reconstruction.
  arXiv  Detail & Related papers  (2023-05-10T11:30:30Z)
• Revocable Cryptography from Learning with Errors [61.470151825577034]
  We build on the no-cloning principle of quantum mechanics and design cryptographic schemes with key-revocation capabilities. We consider schemes where secret keys are represented as quantum states with the guarantee that, once the secret key is successfully revoked from a user, they no longer have the ability to perform the same functionality as before.
  arXiv  Detail & Related papers  (2023-02-28T18:58:11Z)
• ByzSecAgg: A Byzantine-Resistant Secure Aggregation Scheme for Federated Learning Based on Coded Computing and Vector Commitment [61.540831911168226]
  ByzSecAgg is an efficient secure aggregation scheme for federated learning.<n>ByzSecAgg is resistant to Byzantine attacks and privacy leakages.
  arXiv  Detail & Related papers  (2023-02-20T11:15:18Z)
• Hiding Images in Deep Probabilistic Models [58.23127414572098]
  We describe a different computational framework to hide images in deep probabilistic models. Specifically, we use a DNN to model the probability density of cover images, and hide a secret image in one particular location of the learned distribution. We demonstrate the feasibility of our SinGAN approach in terms of extraction accuracy and model security.
  arXiv  Detail & Related papers  (2022-10-05T13:33:25Z)
• Quantum Proofs of Deletion for Learning with Errors [91.3755431537592]
  We construct the first fully homomorphic encryption scheme with certified deletion. Our main technical ingredient is an interactive protocol by which a quantum prover can convince a classical verifier that a sample from the Learning with Errors distribution in the form of a quantum state was deleted.
  arXiv  Detail & Related papers  (2022-03-03T10:07:32Z)
• Quantum secret sharing using GHZ state qubit positioning and selective qubits strategy for secret reconstruction [4.378411442784295]
  The work presents a novel quantum secret sharing strategy based on GHZ product state sharing between three parties. Unlike the other protocols, this protocol does not involve the entire initial state reconstruction, rather uses selective qubits to discard the redundant qubits at the time of reconstruction to decrypt the secret. The protocol also allows for security against malicious attacks by an adversary without affecting the integrity of the secret.
  arXiv  Detail & Related papers  (2020-02-21T08:45:07Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.