USENIX Security2024Top-tier venue
Being Transparent is Merely the Beginning: Enforcing Purpose Limitation with Polynomial Approximation
Shuofeng Liu, Zihan Wang, Minhui Xue, Long Wang, Yuanchao Zhang, Guangdong Bai
Abstract
Obtaining the authorization of users (i.e., data owners) prior to data collection has become commonplace for online service providers (i.e., data processors), in light of the stringent data regulations around the world. However, it remains a challenge to uphold the principle of purpose limitation, which mandates that collected data should only be processed for the purpose that the data owner has originally authorized. In this work, we advocate algorithm specificity, as a means to enforce the purpose limitation principle. We propose ALGOSPEC, which obscures data to restrict its usability solely to an authorized algorithm or algorithm group. ALGOSPEC exploits the nature of polynomial approximation that given the input data and the highest order, any algorithm can be approximated with a unique polynomial. It converts the original authorized algorithm (or a part of it) into a polynomial and then creates a list of alternatives to the original data. To assess the efficacy and efficiency of ALGOSPEC, we apply it to the entropy method and Naive Bayes classification under datasets of different magnitudes from 10 2 to 10 6 . ALGOSPEC significantly outperforms cryptographic solutions such as fully homomorphic encryption (FHE) in efficiency. On accuracy, it achieves a negligible Mean Squared Error (MSE) of 0.289 in the entropy method against computation over plaintext data, and identical accuracy (92.11%) and similar F1 score (87.67%) in the Naive Bayes classification.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext d184e2d3-96e2-4023-92f9-245c98f1467eCited by top-tier papers3
- AI Model Modulation with Logits RedistributionZihan Wang, Zhongkui Ma, Xinguo Feng, Zhiyang Mei et al.WWW 2025 · 5 citations
- ReTrace: Reinforcement Learning-Guided Reconstruction Attacks on Machine UnlearningMengyao Ma, Shuofeng Liu, Minhui Xue, Surya Nepal et al.ICLR 2026
- Modifier Unlocked: Jailbreaking Text-to-Image Models Through PromptsShuofeng Liu, Mengyao Ma, Minhui Xue, Guangdong BaiS&P 2025
Builds on4
- Practical Secure Aggregation for Privacy-Preserving Machine LearningKallista A. Bonawitz, Vladimir Ivanov, Ben Kreuter, Antonio Marcedone et al.CCS 2017 · 3,936 citations
- A Polynomial-Time Classical Algorithm for Noisy Random Circuit SamplingDorit Aharonov, Xun Gao, Zeph Landau, Yunchao Liu et al.STOC 2023 · 74 citations
- SoK: Differential Privacy as a Causal PropertyMichael Carl Tschantz, Shayak Sen, Anupam DattaS&P 2020 · 49 citations
- Private and Reliable Neural Network InferenceNikola Jovanovic, Marc Fischer, Samuel Steffen, Martin T. VechevCCS 2022 · 16 citations
Related papers
- Privacy-Preserving Gaussian Process Regression - A Modular Approach to the Application of Homomorphic EncryptionPeter Fenner, Edward Pyzer-KnappAAAI 2020 · 25 citations
- SHARP: A Short-Word Hierarchical Accelerator for Robust and Practical Fully Homomorphic EncryptionJongmin Kim, Sangpyo Kim, Jaewan Choi, Jaiyoung Park et al.ISCA 2023 · 110 citations
- Falcon: Algorithm-Hardware Co-Design for Efficient Fully Homomorphic Encryption AcceleratorLiang Kong, Xianglong Deng, Guang Fan, Shengyu Fan et al.ASPLOS 2026
- Homomorphic Matrix CompletionXiao-Yang Liu, Zechu (Steven) Li, Xiaodong WangNeurIPS 2022 · 4 citations
- IDFace: Face Template Protection for Efficient and Secure IdentificationSunpill Kim, Seunghun Paik, Chanwoo Hwang, Dongsoo Kim et al.ICCV 2025 · 2 citations
