中文
相关论文

相关论文: Order-Revealing Encryption and the Hardness of Pri…

200 篇论文

Order-revealing encryption is a useful cryptographic primitive that provides range queries on encrypted data since anyone can compare the order of plaintexts by running a public comparison algorithm. Most studies on order-revealing…

密码学与安全 · 计算机科学 2018-09-06 Jieun Eom , Dong Hoon Lee , Kwangsu Lee

Ciphertexts of an order-preserving encryption (OPE) scheme preserve the order of their corresponding plaintexts. However, OPEs are vulnerable to inference attacks that exploit this preserved order. At another end, differential privacy has…

密码学与安全 · 计算机科学 2022-09-19 Amrita Roy Chowdhury , Bolin Ding , Somesh Jha , Weiran Liu , Jingren Zhou

Due to statistical lower bounds on the learnability of many function classes under privacy constraints, there has been recent interest in leveraging public data to improve the performance of private learning algorithms. In this model,…

机器学习 · 统计学 2024-02-16 Adam Block , Mark Bun , Rathin Desai , Abhishek Shetty , Steven Wu

We continue the study of the computational complexity of differentially private PAC learning and how it is situated within the foundations of machine learning. A recent line of work uncovered a qualitative equivalence between the private…

机器学习 · 计算机科学 2024-02-20 Mark Bun , Aloni Cohen , Rathin Desai

We construct a universally Bayes consistent learning rule that satisfies differential privacy (DP). We first handle the setting of binary classification and then extend our rule to the more general setting of density estimation (with…

A private machine learning algorithm hides as much as possible about its training data while still preserving accuracy. In this work, we study whether a non-private learning algorithm can be made private by relying on an instance-encoding…

Training deep neural networks often forces users to work in a distributed or outsourced setting, accompanied with privacy concerns. Split learning aims to address this concern by distributing the model among a client and a server. The…

密码学与安全 · 计算机科学 2022-09-19 Ege Erdogan , Alptekin Kupcu , A. Ercument Cicek

Learning problems form an important category of computational tasks that generalizes many of the computations researchers apply to large real-life data sets. We ask: what concept classes can be learned privately, namely, by an algorithm…

机器学习 · 计算机科学 2012-10-10 Shiva Prasad Kasiviswanathan , Homin K. Lee , Kobbi Nissim , Sofya Raskhodnikova , Adam Smith

Recent work by Maddah-Ali and Niesen introduced coded caching which demonstrated the benefits of joint design of storage and transmission policies in content delivery networks. They studied a setup where a server communicates with a set of…

Motivated by settings in which predictive models may be required to be non-discriminatory with respect to certain attributes (such as race), but even collecting the sensitive attribute may be forbidden or restricted, we initiate the study…

Type-two constructions abound in cryptography: adversaries for encryption and authentication schemes, if active, are modeled as algorithms having access to oracles, i.e. as second-order algorithms. But how about making cryptographic schemes…

计算机科学中的逻辑 · 计算机科学 2020-02-19 Boaz Barak , Raphaëlle Crubillé , Ugo Dal Lago

The rise of connected personal devices together with privacy concerns call for machine learning algorithms capable of leveraging the data of a large number of agents to learn personalized models under strong privacy requirements. In this…

机器学习 · 计算机科学 2018-02-20 Aurélien Bellet , Rachid Guerraoui , Mahsa Taziki , Marc Tommasi

We study the computational relationship between replicability (Impagliazzo et al. [STOC `22], Ghazi et al. [NeurIPS `21]) and other stability notions. Specifically, we focus on replicable PAC learning and its connections to differential…

机器学习 · 计算机科学 2026-05-29 Moshe Noivirt , Jessica Sorrell , Eliad Tsfadia

We present a new, but simple, randomised order-preserving encryption (OPE) scheme based on the general approximate common divisor problem (GACDP). This appears to be the first OPE scheme to be based on a computational hardness primitive,…

密码学与安全 · 计算机科学 2017-06-26 James Dyer , Martin Dyer , Jie Xu

We formulate a private learning model to study an intrinsic tradeoff between privacy and query complexity in sequential learning. Our model involves a learner who aims to determine a scalar value, $v^*$, by sequentially querying an external…

机器学习 · 计算机科学 2020-02-27 John N. Tsitsiklis , Kuang Xu , Zhi Xu

This paper puts a new light on secure data storage inside distributed systems. Specifically, it revisits computational secret sharing in a situation where the encryption key is exposed to an attacker. It comes with several contributions:…

密码学与安全 · 计算机科学 2020-02-18 Katarzyna Kapusta , Gerard Memmi , Matthieu Rambaud

Ensuring differential privacy of models learned from sensitive user data is an important goal that has been studied extensively in recent years. It is now known that for some basic learning problems, especially those involving…

机器学习 · 计算机科学 2018-05-10 Cynthia Dwork , Vitaly Feldman

Order-preserving encryption allows encrypting data, while still enabling efficient range queries on the encrypted data. Moreover, it does not require any change to the database management system, because comparison operates on ciphertexts…

密码学与安全 · 计算机科学 2018-02-06 Anselme Tueno , Florian Kerschbaum

We study secure and privacy-preserving data analysis based on queries executed on samples from a dataset. Trusted execution environments (TEEs) can be used to protect the content of the data during query computation, while supporting…

密码学与安全 · 计算机科学 2020-09-30 Sajin Sasy , Olga Ohrimenko

Privacy and communication efficiency are important challenges in federated training of neural networks, and combining them is still an open problem. In this work, we develop a method that unifies highly compressed communication and…

机器学习 · 计算机科学 2021-12-09 Aleksei Triastcyn , Matthias Reisser , Christos Louizos
‹ 上一页 1 2 3 10 下一页 ›