1,094 Hits in 7.2 sec

Phasing: Private Set Intersection Using Permutation-based Hashing

Benny Pinkas, Thomas Schneider, Gil Segev, Michael Zohner
2015 USENIX Security Symposium  
We denote this approach as Phasing, for Permutation-based Hashing Set Intersection.  ...  Private Set Intersection (PSI) allows two parties to compute the intersection of private sets while revealing nothing more than the intersection itself.  ...  In this work we present Phasing, Permutation-based Hashing Set Intersection, which is a new approach for constructing PSI protocols based on a hashing technique that ensures that hashed elements can be  ... 
dblp:conf/uss/Pinkas0SZ15 fatcat:hdp7auzzzndc5n5qxuiqvrk6jq

Efficient Private Set Intersection Using Point-Value Polynomial Representation

Ou Ruan, Hao Mao
2020 Security and Communication Networks  
We optimize the protocol based on the permutation-based hash technique which divides a set into multisubsets to reduce the degree of the polynomial.  ...  Private set intersection (PSI) allows participants to securely compute the intersection of their inputs, which has a wide range of applications such as privacy-preserving contact tracing of COVID-19.  ...  Introduction Private set intersection (PSI) can be described that participants complete computation based on their private inputs and cannot learn additional information other than the set intersection  ... 
doi:10.1155/2020/8890677 fatcat:7dmzra2eubghzbp35kzcgfloqm

Is min-wise hashing optimal for summarizing set intersection?

Rasmus Pagh, Morten Stöckel, David P. Woodruff
2014 Proceedings of the 33rd ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems - PODS '14  
Min-wise hashing is an important method for estimating the size of the intersection of sets, based on a succinct summary (a "min-hash") independently computed for each set.  ...  But for conjunctions of m > 2 predicates we show that the performance of b-bit min-wise hashing (and more generally any method based on "k-permutation" min-hash) deteriorates as m grows. • We describe  ...  Our second result is a simple estimator for set intersection of an arbitrary number of sets, based on one-permutation min-wise hashing.  ... 
doi:10.1145/2594538.2594554 dblp:conf/pods/PaghSW14 fatcat:53axvweeuvd6vcwtqe2vljdg4q

A Secure and Efficient Privacy-Preserving Attribute Matchmaking Protocol for Mobile Social Networks

K. Arthi, M. Chandra Mouli Reddy
2017 International Journal of Network Security  
Many existing matchmaking protocols are based on user's private and specific data.  ...  Malicious participants may opt their attribute set arbitrarily so as to discover more information about the attributes of an honest participant.  ...  A private matchmaking is a primary feature of private set intersection.  ... 
dblp:journals/ijnsec/ArthiR17 fatcat:w6nwxjniabhqdj4w74se3mzo7q

SEPSI: A Secure and Efficient Privacy-Preserving Set Intersection with Identity Authentication in IoT

Bai Liu, Xiangyi Zhang, Runhua Shi, Mingwu Zhang, Guoxing Zhang
2022 Mathematics  
Privacy-preserving set intersection in IoT is used for a wide range of basic services, and its privacy protection issues have received widespread attention.  ...  The traditional candidate protocols to solve the privacy-preserving set intersection are classical encryption protocols based on computational difficulty.  ...  Privacy-preserving set intersection (PSI) protocol-there are two communicating parties, i.e., a client with a private set C and an SP with a private set S.  ... 
doi:10.3390/math10122120 fatcat:6jaawqstkzga7k7ub4cybiznbq

On InstaHide, Phase Retrieval, and Sparse Matrix Factorization [article]

Sitan Chen, Xiaoxiao Li, Zhao Song, Danyang Zhuo
2021 arXiv   pre-print
Motivated by this connection, we design a provable algorithm that can recover private vectors using only the public vectors and synthetic vectors generated by InstaHide, under the assumption that the private  ...  We show that the answer to this appears to be quite subtle and closely related to the average-case complexity of a new multi-task, missing-data version of the classic problem of phase retrieval.  ...  Algorithm 1; Lijie Chen, Baihe Huang, Runzhou Tao, and Ruizhe Zhang for proofreading of the draft; and Sanjeev Arora, Mark Braverman, Shumo Chu, Yangsibo Huang, Binghui Peng, Kai Li, and Hengjie Zhang for useful  ... 
arXiv:2011.11181v2 fatcat:b3io2v5rkfgdblt73b6yiv2gvq

Scalable Private Set Intersection Based on OT Extension

Benny Pinkas, Thomas Schneider, Michael Zohner
2018 ACM Transactions on Privacy and Security  
Private set intersection (PSI) allows two parties to compute the intersection of their sets without revealing any information about items that are not in the intersection.  ...  In addition, existing PSI protocols are several orders of magnitude slower than an insecure naive hashing solution which is used in practice.  ...  The efficiency gain in using the random oracle model is particularly true with regards to protocols for private set intersection.  ... 
doi:10.1145/3154794 fatcat:rans6apzyfghvkywqa6rxyesoq

Privately Computing Set-Union and Set-Intersection Cardinality via Bloom Filters [chapter]

Rolf Egert, Marc Fischlin, David Gens, Sven Jacob, Matthias Senker, Jörn Tillmanns
2015 Lecture Notes in Computer Science  
In this paper we propose a new approach to privately compute the set-union cardinality and the set-intersection cardinality among multiple honest-but-curious parties.  ...  We therefore propose a new Bloom filter based protocol, also forgoing heavy cryptography, and prove its security. 1 The hash functions do not need to be cryptographically secure, but can still be based  ...  [DCW13] used so-called garbled Bloom filters to compute intersections based on oblivious transfer.  ... 
doi:10.1007/978-3-319-19962-7_24 fatcat:z5q4innxzvcdhbklfgzbkwqzgi

Outsourced Mutual Private Set Intersection Protocol for Edge-Assisted IoT

Jing Zhang, Rongxia Qin, Ruijie Mu, Xiaojun Wang, Yongli Tang, Shifeng Sun
2021 Security and Communication Networks  
Aiming at the data privacy security problem of edge-assisted Internet of Things, an outsourced mutual Private Set Intersection protocol is proposed.  ...  After that, the protocol maps the set elements to the corresponding hash bin under the execution of two hash functions and calculates the intersection in a bin-to-bin manner, reducing the number of comparisons  ...  In the data encryption phase, parties P 1 and P 2 use the ElGamal threshold encryption algorithm in Section 4.2.1 to encrypt the elements in their hash table and at the same time add a permutation sequence  ... 
doi:10.1155/2021/3159269 fatcat:xxts763wlfc53hhmldbc2fpwcq

Fast Private Set Intersection from Homomorphic Encryption

Hao Chen, Kim Laine, Peter Rindal
2017 Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security - CCS '17  
Private Set Intersection (PSI) is a cryptographic technique that allows two parties to compute the intersection of their sets without revealing anything except the intersection.  ...  The most computationally efficient PSI protocols have been constructed using tools such as hash functions and oblivious transfer, but a potential limitation with these approaches is the communication complexity  ...  We think our protocol is particularly interesting for the private contact discovery use-case, where it achieves a very low communication overhead: about 12MB to intersect a set of 5 thousand items with  ... 
doi:10.1145/3133956.3134061 dblp:conf/ccs/ChenLR17 fatcat:djnzrezqenblplkkhklikequli

Fast Unbalanced Private Set Union from Fully Homomorphic Encryption [article]

Binbin Tu, Yu Chen, Qi Liu, Cong Zhang
2022 IACR Cryptology ePrint Archive  
In this work, we propose a generic framework of using the leveled fully homomorphic encryption and a newly introduced protocol called permute matrix Private EQuality Test (pm-PEQT) to construct the unbalanced  ...  Private set union (PSU) allows two parties to compute the union of their sets without revealing anything except the union and it has found numerous applications in practice.  ...  [9, 7] first consider unbalanced case and design an efficient unbalanced private set intersection (uPSI) based on the leveled fully homomorphic encryption (FHE).  ... 
dblp:journals/iacr/TuCLZ22 fatcat:xhr7nyyh6ffijlul5jsn2zm6le

Unbalanced Approximate Private Set Intersection [article]

Amanda C. Davi Resende, Diego F. Aranha
2017 IACR Cryptology ePrint Archive  
They allow two parties to compute the intersection of their private sets without revealing any additional information beyond the intersection itself.  ...  Protocols for Private Set Intersection (PSI) are important cryptographic primitives that perform joint operations on datasets in a privacy-preserving way.  ...  In many applications where it is necessary to compute the private set intersection, the sets have unequal sizes.  ... 
dblp:journals/iacr/ResendeA17 fatcat:znskt52ugnefbmnjqisymboksi

PIR-PSI: Scaling Private Contact Discovery

Daniel Demmler, Peter Rindal, Mike Rosulek, Ni Trieu
2018 Proceedings on Privacy Enhancing Technologies  
Our protocol has provable security guarantees and combines new ideas with state-of-the-art techniques from private information retrieval and private set intersection.  ...  In this work, we present a system for private contact discovery, in which the client learns only the intersection of its own contact list and a server's user database, and the server learns only the (approximate  ...  Private Set Intersection (PSI) Private Set Intersection (PSI) is an application of secure computation that allows parties, each holding a set of private items, to compute the intersection of their sets  ... 
doi:10.1515/popets-2018-0037 dblp:journals/popets/DemmlerRRT18 fatcat:i3osdnnwybfmvizlyy4p67iv6a


Arjan Jeckmans, Qiang Tang, Pieter Hartel
2011 Proceedings of the 18th ACM conference on Computer and communications security - CCS '11  
Currently, none of the existing online social networks (OSNs) enables its users to make new friends without revealing their private information.  ...  Stage 2) Two-Party Profile Similarity Computation In this phase, Alice and the OSN (representing Bob) run a two-party private set intersection protocol, which is an adapted version of that proposed by  ...  [R b (x)] EKs o o 7.Permuted R i (1≤i≤na) o o Set Up Phase In this phase, the users and the OSN agree on a group G of prime order p and a generator g for ElGamal scheme [2] .  ... 
doi:10.1145/2046707.2093495 fatcat:afevq52vizejndupj42l5rpfqe

Secure and efficient multiparty private set intersection cardinality

Sumit Kumar Debnath, ,Department of Mathematics, National Institute of Technology Jamshedpur, Jamshedpur-831014, India, Pantelimon Stǎnicǎ, Nibedita Kundu, Tanmay Choudhury, ,Department of Applied Mathematics, Naval Postgraduate School, Monterey, CA 93943, USA, ,Department of Mathematics, The LNM Institute of Information Technology, Jaipur-302031, India
2019 Advances in Mathematics of Communications  
In the field of privacy preserving protocols, Private Set Intersection (PSI) plays an important role.  ...  In most of the cases, PSI allows two parties to securely determine the intersection of their private input sets, and no other information.  ...  [29] came up with the an improved hashing-based generic PSI in semi-honest environment. • Multiparty Private Set Intersection.  ... 
doi:10.3934/amc.2020071 fatcat:vy4da3qbcncyzhlyhaezw63nda
« Previous Showing results 1 — 15 out of 1,094 results