A family of new bounds that are tighter, applicable even to fully deterministic encoders, and applicable even to fully deterministic encoders can extend beyond MSE to other norm-based similarity metrics, by properly accounting for the encoder's spectral structure.
Abstract
Instance encoding is a popular empirical technique for privacy enhancement when sharing data to an untrusted server. It transforms sensitive data through an encoding process before sharing, with the hope that the encoding process retains utility but makes it hard to reconstruct the original data. However, most work offers no theoretical guarantee that the encoding process is actually irreversible. A recent work derived a mean-squared error (MSE) bound limiting any adversary's reconstruction accuracy, offering one of the first theoretical results in this domain. This bound, however, has three critical limitations: it is often too loose, only works with randomized encoders (excluding many deterministic encoders practitioners use), and only bounds MSE. We introduce a family of new bounds that (1) are tighter, (2) applicable even to fully deterministic encoders, and (3) can extend beyond MSE to other norm-based similarity metrics, by properly accounting for the encoder's spectral structure. We evaluate our bounds across a range of encoders, datasets, and attacks, showing they hold consistently and improve upon the existing bound.
Experimental evaluations demonstrate that encrypted low-rank matrix multiplications achieve both significant runtime improvements and reduction of ciphertext sizes over direct or tree-based encrypted multiplications while maintaining the prescribed accuracy.
D. Schoinianakis, M. Sabzevari· IACR Cryptology ePrint Archi...· 0 citations
SVIiT is described as communication-reduced relative to the evaluated MPC baselines rather than universally lightweight, and its present practical scope is primarily high-bandwidth LAN or provider-edge deployments.
Tingting Chen· ICST Transactions on Scalabl...· 0 citations
Module Learning with Errors (MLWE) cryptography normally treats decryption noise as a disturbance: it must be large enough to hide algebraic structure but small enough for reliable decoding. This paper studies a conditional design in which selected residual degrees of freedom also carry coarse physical sensing informat...
Aniket Chakraborty, S. Chakravarty· 2026 International Conferenc...· 0 citations
Cortado is compared with state-of-the-art approaches and it is found that it is the only progressive compressor that guarantees the evaluated error bounds on all tested inputs while achieving the highest throughputs, comparable reconstruction quality, and on-par compression ratios.
This work proposes Subsampled Stochastic TurboQuant (SSTQ), a framework that combines overcomplete equal-norm tight frames, coordinate subsampling, and privacy-aware one-dimensional quantization and empirically evaluates SSTQ against established baselines on federated learning tasks using CIFAR-10 and Fashion-MNIST, de...
Adel Javanmard, David P. Woodruff, V. Mirrokni· 0 citations
This paper introduces a unified multi-node, multidimensional formulation of the game of coding with input-dependent adversarial noise, and constructs an input-independent joint noise distribution that exactly preserves the probability of acceptance and the accepted mean-squared estimation error.
Hanzaleh Akbari Nodehi, M. Maddah-ali· arXiv.org· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.