Cover Image

How to reconstruct (anonymously) a secret cellular automaton

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Mariot, Luca, Mazzone, Federico, Manzoni, Luca, Leporati, Alberto
Format:	Preprint
Published:	2026
Subjects:	Cryptography and Security Combinatorics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

A Discrete Particle Swarm Optimizer for the Design of Cryptographic Boolean Functions
by: Mariot, Luca, et al.
Published: (2024)

On Maximal Families of Binary Polynomials with Pairwise Linear Common Factors
by: Gadouleau, Maximilien, et al.
Published: (2024)

Combinatorial Designs and Cellular Automata: A Survey
by: Manzoni, Luca, et al.
Published: (2025)

Insights Gained after a Decade of Cellular Automata-based Cryptography
by: Mariot, Luca
Published: (2024)

Self-Orthogonal Cellular Automata
by: Mariot, Luca, et al.
Published: (2025)

Secure Change-Point Detection for Time Series under Homomorphic Encryption
by: Mazzone, Federico, et al.
Published: (2026)

New classes of reversible cellular automata
by: Haugland, Jan Kristian, et al.
Published: (2024)

Exact Hidden Paths in Noisy High Dimensional Path Spaces
by: Melo, Victor Duarte
Published: (2026)

Cyclic Equalizability Characterized by Parikh Vectors
by: Thongjarast, Sarunyu, et al.
Published: (2026)

The Zero-Difference Properties of Functions and Their Applications
by: Yi, Zongxiang, et al.
Published: (2018)

Tropical cryptography III: digital signatures
by: Chen, Jiale, et al.
Published: (2023)

Increasing subsequences, matrix loci, and Viennot shadows
by: Rhoades, Brendon
Published: (2023)

The log concavity of two graphical sequences
by: Shi, Minjia, et al.
Published: (2025)

A Generalized Shuffle Framework for Privacy Amplification: Strengthening Privacy Guarantees and Enhancing Utility
by: Chen, E, et al.
Published: (2023)

A formula for constructing Mignotte sequences
by: Putresza, Marek
Published: (2024)

Cyclic Equalizability of Words and Its Application to Card-Based Cryptography
by: Shinagawa, Kazumasa, et al.
Published: (2025)

On the transversals of Latin squares generated by nonlinear bipermutive cellular automata
by: Dennunzio, Alberto, et al.
Published: (2026)

IDEM Enough? Evolving Highly Nonlinear Idempotent Boolean Functions
by: Carlet, Claude, et al.
Published: (2026)

Degree is Important: On Evolving Homogeneous Boolean Functions
by: Carlet, Claude, et al.
Published: (2025)

A Systematic Evaluation of Evolving Highly Nonlinear Boolean Functions in Odd Sizes
by: Carlet, Claude, et al.
Published: (2024)

A Systematic Study on the Design of Odd-Sized Highly Nonlinear Boolean Functions via Evolutionary Algorithms
by: Carlet, Claude, et al.
Published: (2025)

Efficient Ranking, Order Statistics, and Sorting under CKKS
by: Mazzone, Federico, et al.
Published: (2024)

Asymptotic utility of spectral anonymization
by: Perkonoja, Katariina, et al.
Published: (2024)

Core Mondrian: Basic Mondrian beyond k-anonymity
by: Bloomston, Adam, et al.
Published: (2025)

Towards a conjecture on a special class of matrices over commutative rings of characteristic 2
by: Wu, Baofeng
Published: (2021)

The complexity of solving a system of equations of the same degree
by: Gaggero, Giulia, et al.
Published: (2023)

Lockcoin: a secure and privacy-preserving mix service for bitcoin anonymity
by: Bao, Zijian, et al.
Published: (2018)

On the matching arrangement of a graph, improper weight function problem and its application
by: Bolotnikov, Aleksey, et al.
Published: (2024)

Monotone but Exciting: On Evolving Monotone Boolean Functions with High Nonlinearity
by: Carlet, Claude, et al.
Published: (2026)

NegaBent, No Regrets: Evolving Spectrally Flat Boolean Functions
by: Carlet, Claude, et al.
Published: (2026)

On Counts and Densities of Homogeneous Bent Functions: An Evolutionary Approach
by: Carlet, Claude, et al.
Published: (2025)

Towards more accurate and useful data anonymity vulnerability measures
by: Francis, Paul, et al.
Published: (2024)

Frequency maps reveal the correlation between Adversarial Attacks and Implicit Bias
by: Basile, Lorenzo, et al.
Published: (2023)

Linear Hashing with $\ell_\infty$ guarantees and two-sided Kakeya bounds
by: Dhar, Manik, et al.
Published: (2022)

Fourier Sparsity of Delta Functions and Matching Vector PIRs
by: Ghasemi, Fatemeh, et al.
Published: (2025)

Code-Based Single-Server Private Information Retrieval: Circumventing the Sub-Query Attack
by: Verma, Neehar, et al.
Published: (2024)

Fine-Grained Cryptanalysis: Tight Conditional Bounds for Dense k-SUM and k-XOR
by: Dinur, Itai, et al.
Published: (2021)

Data anonymization in the presence of outliers via invariant coordinate selection
by: Perkonoja, Katariina, et al.
Published: (2026)

Investigating Privacy Attacks in the Gray-Box Setting to Enhance Collaborative Learning Schemes
by: Mazzone, Federico, et al.
Published: (2024)

Offensive AI: Enhancing Directory Brute-forcing Attack with the Use of Language Models
by: Castagnaro, Alberto, et al.
Published: (2024)