Single-Component Privacy Guarantees in Helper Data Systems and Sparse Coding with Ambiguation
We investigate the privacy of two approaches to (biometric) template protection: Helper Data Systems and Sparse Ternary Coding with Ambiguization. In particular, we focus on a privacy property that is often overlooked, namely how much leakage exists about one specific binary property of one component of the feature vector. This property is e.g. the sign or an indicator that a threshold is exceeded. We provide evidence that both approaches are able to protect such sensitive binary variables, and discuss how system parameters need to be set.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Inferring multiple helper Dafny assertions with LLMs
The Dafny verifier provides strong correctness guarantees but often requires numerous manual helper assertions, creating a significant barrier to adoption. We investigate the use of Large Language Models (LLMs) to automa…
Securing Secure Aggregation: Mitigating Multi-Round Privacy Leakage in Federated Learning
Secure aggregation is a critical component in federated learning (FL), which enables the server to learn the aggregate model of the users without observing their local models. Conventionally, secure aggregation algorithm…
FairnessFederated LearningTowards Multi-Domain Single Image Dehazing via Test-Time Training
Recent years have witnessed significant progress in the area of single image dehazing, thanks to the employment of deep neural networks and diverse datasets. Most of the existing methods perform well when the trainin…
Image DehazingMeta-LearningSingle Image DehazingUncertainty Minimization for Personalized Federated Semi-Supervised Learning
Since federated learning (FL) has been introduced as a decentralized learning technique with privacy preservation, statistical heterogeneity of distributed data stays the main obstacle to achieve robust performance and s…
Federated LearningUnified Convergence Theory of Stochastic and Variance-Reduced Cubic Newton Methods
We study stochastic Cubic Newton methods for solving general possibly non-convex minimization problems. We propose a new framework, which we call the helper framework, that provides a unified view of the stochastic and v…
Auxiliary Learning