Filters








3,414 Hits in 4.0 sec

Improved Private Set Intersection Against Malicious Adversaries [chapter]

Peter Rindal, Mike Rosulek
2017 Lecture Notes in Computer Science  
Private set intersection (PSI) refers to a special case of secure two-party computation in which the parties each have a set of items and compute the intersection of these sets without revealing any additional  ...  Protocols in this paradigm achieving security against malicious adversaries include [DKT10]. Freedman et al.  ...  Private Set Intersection In Figure 2 we give the ideal functionality that specifies the goal of private set intersection.  ... 
doi:10.1007/978-3-319-56620-7_9 fatcat:ej7k7wegwbho3jcl54boduohlm

Outsourced private set intersection using homomorphic encryption

Florian Kerschbaum
2012 Proceedings of the 7th ACM Symposium on Information, Computer and Communications Security - ASIACCS '12  
Private set intersection enables two parties -a client and a server -to compute the intersection of their respective sets without disclosing anything else.  ...  In this paper we present a novel protocol that has linear complexity, is secure in the malicious model without random oracles, is client set size-independent and efficient.  ...  Figure 3 : 3 Malicious Private Set Intersection Protocol M P SI the ideal model.  ... 
doi:10.1145/2414456.2414506 dblp:conf/ccs/Kerschbaum12 fatcat:soibfleeezcizjfvrtbu4mfc6u

Private and Efficient Set Intersection Protocol for Big Data Analytics [chapter]

Zakaria Gheid, Yacine Challal
2017 Lecture Notes in Computer Science  
PSI allows mistrustful parties to compute the intersection of their private sets without leaking additional information.  ...  Private Set Intersection (PSI) is a fundamental multi-party computation primitive used to secure many political, commercial, and social applications.  ...  Introduction Private set intersection (PSI) protocol allows a client and a server to jointly compute the intersection of their private input sets without leaking any additional information.  ... 
doi:10.1007/978-3-319-65482-9_10 fatcat:ybvbfakpd5gr3fdjarp732faqq

Privacy-preserving data mining in the malicious model

Murat Kantarcioglu, Onur Kardes
2008 International Journal of Information and Computer Security  
However, there is an obvious trade-off: protocols that are secure against malicious adversaries are generally more expensive than those secure against semi-honest adversaries only.  ...  Secure protocols that are developed against malicious adversaries require utilisation of complex techniques. Clearly, protocols that can withstand malicious adversaries provide more security.  ...  We also prove that the given protocols are secure against malicious adversaries.  ... 
doi:10.1504/ijics.2008.022488 fatcat:ikb4tihqqngs5hvekblsei6k7q

Honest-Verifier Private Disjointness Testing Without Random Oracles [chapter]

Susan Hohenberger, Stephen A. Weis
2006 Lecture Notes in Computer Science  
The HW construction improves on existing results in settings where the prover is malicious and the verifier is honest-but-curious.  ...  The HW honest-but-curious (semi-honest) private intersection cardinality protocol presented in this paper as is becomes a private disjointness testing protocol in the malicious-prover setting.  ...  security against malicious provers without random oracles.  ... 
doi:10.1007/11957454_16 fatcat:hooc2qnkpzduxh3hzjtqfxg7fu

Multi-Party Privacy-Preserving Set Intersection with Quasi-Linear Complexity

Jung Hee CHEON, Stanislaw JARECKI, Jae Hong SEO
2012 IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences  
Specifically, our protocols require O(n 2 kλ) bits of communication andÕ(n 2 λ + (nλ + n 2 )k) group multiplications per player in the malicious adversary setting, where k is the size of each dataset and  ...  rendering secure computation of set intersection impractical on anything but small datasets.  ...  Dachman-Soled et al. improved security so that proposed a protocol secure against both malicious parities [5] .  ... 
doi:10.1587/transfun.e95.a.1366 fatcat:7l6eby3bprei5ej3m4pkly5kdm

A privacy-preserving fuzzy interest matching protocol for friends finding in social networks

Xu An Wang, Fatos Xhafa, Xiaoshuang Luo, Shuaiwei Zhang, Yong Ding
2017 Soft Computing - A Fusion of Foundations, Methodologies and Applications  
[7] don't use generic zero-knowledge proofs and presented an improved construction secure against malicious adversaries.  ...  malicious adversary.  ... 
doi:10.1007/s00500-017-2506-x fatcat:l5pwtfbmobgoxhqz7lbznajbq4

Scaling Private Set Intersection to Billion-Element Sets [chapter]

Seny Kamara, Payman Mohassel, Mariana Raykova, Saeed Sadeghian
2014 Lecture Notes in Computer Science  
We examine the feasibility of private set intersection (PSI) over massive datasets.  ...  Our protocols are secure in several adversarial models including against a semi-honest, covert and malicious server; and address a range of security and privacy concerns including fairness and the leakage  ...  We stress that the protocol of [23] is secure against semihonest adversaries in the standard MPC setting.  ... 
doi:10.1007/978-3-662-45472-5_13 fatcat:agyoneak6vexlmio7ee6z65ut4

Secure Set Intersection with Untrusted Hardware Tokens [chapter]

Marc Fischlin, Benny Pinkas, Ahmad-Reza Sadeghi, Thomas Schneider, Ivan Visconti
2011 Lecture Notes in Computer Science  
For untrusted tokens, our protocols ensure privacy against malicious adversaries, and correctness facing covert adversaries.  ...  In a recent work, Hazay and Lindell (ACM CCS 2008) introduced the idea of using trusted hardware tokens for the set intersection problem, devising protocols which improve over previous (in the standard  ...  To prove that A's input remains private in a simulation-based sense against a realworld malicious B we construct an ideal-world adversary B I that internally simulates a protocol run to B, extracts its  ... 
doi:10.1007/978-3-642-19074-2_1 fatcat:e5vrtmhimjbonnk764lozaepbq

Mutual Private Set Intersection with Linear Complexity [chapter]

Myungsun Kim, Hyung Tae Lee, Jung Hee Cheon
2012 Lecture Notes in Computer Science  
A private set intersection (PSI) protocol allows players to obtain the intersection of their inputs.  ...  While in its unilateral version only the client can obtain the intersection, the mutual PSI protocol enables all players to get the desired result.  ...  Introduction The mutual Private Set Intersection (PSI) problem is the following: both of two players with private sets learn the intersection of their sets without releasing any other information to each  ... 
doi:10.1007/978-3-642-27890-7_18 fatcat:avirc6eytve7fkf6afbcwv4qpa

Linear-Complexity Private Set Intersection Protocols Secure in Malicious Model [chapter]

Emiliano De Cristofaro, Jihye Kim, Gene Tsudik
2010 Lecture Notes in Computer Science  
Private Set Intersection (PSI) protocols allow one party ("client") to compute an intersection of its input set with that of another party ("server"), such that the client learns nothing other than the  ...  set intersection and the server learns nothing beyond client input size.  ...  Our PSI Protocol with linear complexity secure against malicious adversaries Table 2 . 2 Comparison of Authorized Private Set Intersection protocols Protocol Standard Malicious Assumption Communication  ... 
doi:10.1007/978-3-642-17373-8_13 fatcat:x3x5qarxbrhg3fdsyhgw22wxne

Privacy Preserving Set Intersection Protocol Secure against Malicious Behaviors

Yingpeng Sang, Hong Shen
2007 Eighth International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT 2007)  
In this paper, we address the Privacy Preserving Set Intersection (PPSI) problem, in which each of the N parties learns no elements other than the intersection of their N private datasets.  ...  We propose an efficient protocol in the malicious model, where the adversary may control arbitrary number of parties and execute the protocol for its own benefit.  ...  The PPSI protocol in [18] is only secure when the adversary controls one party, in this paper we strengthen the security of the protocol against the adversary who maliciously controls arbitrary number  ... 
doi:10.1109/pdcat.2007.59 dblp:conf/pdcat/SangS07 fatcat:qsbxdhgn5jcgtoh3ixm6e37gz4

Privacy Preserving Set Intersection Protocol Secure against Malicious Behaviors

Yingpeng Sang, Hong Shen
2007 Eighth International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT 2007)  
In this paper, we address the Privacy Preserving Set Intersection (PPSI) problem, in which each of the N parties learns no elements other than the intersection of their N private datasets.  ...  We propose an efficient protocol in the malicious model, where the adversary may control arbitrary number of parties and execute the protocol for its own benefit.  ...  The PPSI protocol in [18] is only secure when the adversary controls one party, in this paper we strengthen the security of the protocol against the adversary who maliciously controls arbitrary number  ... 
doi:10.1109/pdcat.2007.4420204 fatcat:4rxssl4oijcrxfs6ergcpvbhmq

Multi Party Distributed Private Matching, Set Disjointness and Cardinality of Set Intersection with Information Theoretic Security [chapter]

G. Sathya Narayanan, T. Aishwarya, Anugrah Agrawal, Arpita Patra, Ashish Choudhary, C. Pandu Rangan
2009 Lecture Notes in Computer Science  
In this paper, we focus on the specific problems of Private Matching, Set Disjointness and Cardinality Set Intersection in information theoretic settings.  ...  Previous solutions for Distributed Private Matching and Cardinality Set Intersection were cryptographically secure and the previous Set Disjointness solution, though information theoretically secure, is  ...  It is very efficient against honest-but-curious adversaries but invokes expensive sub-protocols to work against malicious adversaries.  ... 
doi:10.1007/978-3-642-10433-6_2 fatcat:myuw62dbtjckrbuic76ezm6br4

New Approach to Set Representation and Practical Private Set-Intersection Protocols

Ou Ruan, Zihao Wang, Jing Mi, Mingwu Zhang
2019 IEEE Access  
INDEX TERMS Private set-intersection, set representation, private set-intersection cardinality, privacy-preserving protocols.  ...  Private set intersection (PSI) is a fundamental cryptographic protocol, which has many important applications, such as personal properties matching, data sharing, or data mining.  ...  s OT-based PSI protocol [20] was extended to security against weakly malicious adversaries by Rindal and Rosulek [22] , and to security against a semi-honest party and a malicious party by Lambak [  ... 
doi:10.1109/access.2019.2917057 fatcat:yg2kfunxevdflamzvon2amuk6y
« Previous Showing results 1 — 15 out of 3,414 results