Modern privacy-preserving record linkage techniques: An overview

A Gkoulalas-Divanis, D Vatsalan… - IEEE Transactions …, 2021 - ieeexplore.ieee.org
Record linkage is the challenging task of deciding which records, coming from disparate
data sources, refer to the same entity. Established back in 1946 by Halbert L. Dunn, the area …

Fuzzy keyword search over encrypted data in cloud computing

J Li, Q Wang, C Wang, N Cao, K Ren… - 2010 Proceedings IEEE …, 2010 - ieeexplore.ieee.org
As Cloud Computing becomes prevalent, more and more sensitive information are being
centralized into the cloud. For the protection of data privacy, sensitive data usually have to …

Efficient private matching and set intersection

MJ Freedman, K Nissim, B Pinkas - … on the theory and applications of …, 2004 - Springer
We consider the problem of computing the intersection of private datasets of two parties,
where the datasets contain lists of elements taken from a large domain. This problem has …

Data streams: Algorithms and applications

S Muthukrishnan - Foundations and Trends® in Theoretical …, 2005 - nowpublishers.com
In the data stream scenario, input arrives very rapidly and there is limited memory to store
the input. Algorithms have to work with one or few passes over the data, space less than …

Bumblebee: Secure two-party inference framework for large transformers

W Lu, Z Huang, Z Gu, J Li, J Liu, C Hong… - Cryptology ePrint …, 2023 - eprint.iacr.org
Large transformer-based models have realized state-of-the-art performance on lots of real-
world tasks such as natural language processing and computer vision. However, with the …

Extending oblivious transfers efficiently

Y Ishai, J Kilian, K Nissim, E Petrank - Annual International Cryptology …, 2003 - Springer
We consider the problem of extending oblivious transfers: Given a small number of oblivious
transfers “for free,” can one implement a large number of oblivious transfers? Beaver has …

Privacy preserving data mining

Y Lindell, B Pinkas - Annual international cryptology conference, 2000 - Springer
In this paper we introduce the concept of privacy preserving data mining. In our model, two
parties owning confidential databases wish to run a data mining algorithm on the union of …

Practical privacy: the SuLQ framework

A Blum, C Dwork, F McSherry, K Nissim - Proceedings of the twenty …, 2005 - dl.acm.org
We consider a statistical database in which a trusted administrator introduces noise to the
query responses with the goal of maintaining privacy of individual database entries. In such …

A statistical framework for differential privacy

L Wasserman, S Zhou - Journal of the American Statistical …, 2010 - Taylor & Francis
One goal of statistical privacy research is to construct a data release mechanism that
protects individual privacy while preserving information content. An example is a random …

Private queries in location based services: anonymizers are not necessary

G Ghinita, P Kalnis, A Khoshgozaran… - Proceedings of the …, 2008 - dl.acm.org
Mobile devices equipped with positioning capabilities (eg, GPS) can ask location-dependent
queries to Location Based Services (LBS). To protect privacy, the user location must not be …