6 papers
How to reconstruct (anonymously) a secret cellular automaton
Luca Mariot, Federico Mazzone, Luca Manzoni +1
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 o…
Self-Orthogonal Cellular Automata
Luca Mariot, Federico Mazzone
It is known that no-boundary Cellular Automata (CA) defined by bipermutive local rules give rise to Latin squares. In this paper, we study under which conditions the Latin square g…
Privacy-Preserving Vertical K-Means Clustering
Federico Mazzone, Trevor Brown, Florian Kerschbaum +4
Clustering is a fundamental data processing task used for grouping records based on one or more features. In the vertically partitioned setting, data is distributed among entities,…
Efficient Ranking, Order Statistics, and Sorting under CKKS
Federico Mazzone, Maarten Everts, Florian Hahn +1
Fully Homomorphic Encryption (FHE) enables operations on encrypted data, making it extremely useful for privacy-preserving applications, especially in cloud computing environments.…
Investigating Privacy Attacks in the Gray-Box Setting to Enhance Collaborative Learning Schemes
Federico Mazzone, Ahmad Al Badawi, Yuriy Polyakov +3
The notion that collaborative machine learning can ensure privacy by just withholding the raw data is widely acknowledged to be flawed. Over the past seven years, the literature ha…
On Maximal Families of Binary Polynomials with Pairwise Linear Common Factors
Maximilien Gadouleau, Luca Mariot, Federico Mazzone
We consider the construction of maximal families of polynomials over the finite field , all having the same degree and a nonzero constant term, where the degree o…