How to reconstruct (anonymously) a secret cellular automaton
Luca Mariot, Federico Mazzone, Luca Manzoni, Alberto Leporati
TL;DR
This paper introduces a novel threshold secret sharing scheme using cellular automata that enables anonymous secret reconstruction without revealing participant identities.
Contribution
It redefines the secret sharing scheme based on cellular automata and MOLS, allowing anonymous reconstruction of secret CA rules.
Findings
Scheme enables anonymous reconstruction of secret CA rules.
Redefines secret space as the MOLS family.
Discusses trade-offs between share capacity and computational complexity.
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 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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.