Filters








4,308 Hits in 11.0 sec

Actively Secure 1-out-of-N OT Extension with Application to Private Set Intersection [chapter]

Michele Orrù, Emmanuela Orsini, Peter Scholl
2017 Lecture Notes in Computer Science  
Random 1-out-of-N OT is a key building block in recent, very efficient, passively secure private set intersection (PSI) protocols.  ...  This paper describes a 1-out-of-N oblivious transfer (OT) extension protocol with active security, which achieves very low overhead on top of the passively secure protocol of Kolesnikov and Kumaresan (  ...  Acknowledgements We thank Ranjit Kumaresan for providing us with an extended version of [KK13] .  ... 
doi:10.1007/978-3-319-52153-4_22 fatcat:k2o5xndd4fbjtcgv6j77l3ycgq

Ad-Hoc Secure Two-Party Computation on Mobile Devices using Hardware Tokens

Daniel Demmler, Thomas Schneider, Michael Zohner
2014 USENIX Security Symposium  
Our use cases include private set intersection for finding shared contacts and private scheduling of a meeting with location preferences.  ...  For private set intersection, our token-aided implementation on mobile phones is up to two orders of magnitude faster than previous generic secure two-party computation protocols on mobile phones and even  ...  Acknowledgements We thank the anonymous reviewers of USENIX Security 2014 for their helpful comments on our paper.  ... 
dblp:conf/uss/Demmler0Z14 fatcat:yhw7hk65fvgkhmi2csvcnw4vwm

Faster Private Set Intersection Based on OT Extension

Benny Pinkas, Thomas Schneider, Michael Zohner
2014 USENIX Security Symposium  
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.  ...  It is one of the best studied applications of secure computation and many PSI protocols have been proposed.  ...  Acknowledgements We thank the anonymous reviewers of USENIX Security 2014 for their helpful comments on our paper.  ... 
dblp:conf/uss/Pinkas0Z14 fatcat:mrwrizrb4rgtxjkit5b3sj6yve

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.  ...  We then focus on PSI protocols that are secure against semi-honest adversaries and take advantage of the most recent efficiency improvements in OT extension and propose significant optimizations to previous  ...  We describe the OT extension protocol of [3, 35] , the random OT functionality, and the N 1 -OT extension protocol of [39] in more detail next. 1-out-of-2 OT Extension In [35] , a 2 1 -OT extension  ... 
doi:10.1145/3154794 fatcat:rans6apzyfghvkywqa6rxyesoq

Mobile Private Contact Discovery at Scale

Daniel Kales, Christian Rechberger, Thomas Schneider, Matthias Senker, Christian Weinert
2019 USENIX Security Symposium  
The most promising approaches addressing this problem revolve around private set intersection (PSI) protocols.  ...  Furthermore, we implement both protocols with security against malicious clients in C/C++ and utilize the ARM Cryptography Extensions available in most recent smartphones.  ...  Acknowledgments This work was co-funded by the DFG as part of project E4 within the CRC 1119 CROSSING and project A.1 within the RTG 2050 "Privacy and Trust for Mobile Users", by the BMBF and the HMWK  ... 
dblp:conf/uss/KalesR0SW19 fatcat:ey2gfxl4czfyvasafzxz7waqdu

A Framework of Private Set Intersection Protocols [article]

Ziyuan Liang, Weiran Liu, Fan Zhang, Bingsheng Zhang, Jian Liu, Lei Zhang, Kui Ren
2020 IACR Cryptology ePrint Archive  
Private Set Intersection (PSI) is a specified protocol of secure Multi-Party Computation (MPC). PSI allows two parties to obtain the intersection of their private sets while nothing else is revealed.  ...  We adopt filters to significantly reduce the communication of OT-based PSI protocols.  ...  Actively secure 1-out-of-n ot extension with application to private set intersection. pages 381-396, 2017. 39. Rasmus Pagh and Flemming Friche Rodler. Cuckoo hashing. pages 121-133, 2001. 40.  ... 
dblp:journals/iacr/LiangLZZLZR20 fatcat:6fio2w4ee5g2rgjlc7k53krcmq

Fast Actively Secure OT Extension for Short Secrets [article]

Arpita Patra, Pratik Sarkar, Ajith Suresh
2019 arXiv   pre-print
We present a fast OT extension protocol for small secrets in the active setting. Our protocol when used to produce 1-out-of-n OTs outperforms all the known actively secure OT extensions.  ...  problems of interest such as private set intersection (PSI), private information retrieval (PIR), contract signing to name a few.  ...  Acknowledgements We thank Peter Scholl and Emmanuela Orsini for pointing out a bug in the initial version of the paper.  ... 
arXiv:1911.08834v1 fatcat:qbfglhr5vvcxdmixkic64mmdpq

Combining Private Set-Intersection with Secure Two-Party Computation [chapter]

Michele Ciampi, Claudio Orlandi
2018 Lecture Notes in Computer Science  
Private Set-Intersection (PSI) is one of the most popular and practically relevant secure two-party computation (2PC) tasks.  ...  In particular, a recent line of work has proposed PSI protocols based on oblivious transfer (OT) which, thanks to recent advances in OT-extension techniques, is nowadays a very cheap cryptographic building  ...  Using the protocol together with an actively secure OT-extension protocol such as [ALSZ15, KOS15] would result in a protocol with privacy but not correctness (i.e., the view of the protocol without the  ... 
doi:10.1007/978-3-319-98113-0_25 fatcat:q6uulq3vwjdvpdqi7gmxcmzqym

When private set intersection meets big data

Changyu Dong, Liqun Chen, Zikai Wen
2013 Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security - CCS '13  
In this paper, we present a new Private Set Intersection (PSI) protocol that is extremely efficient and highly scalable compared with existing protocols.  ...  To compute the intersection of two million-element sets, our protocol needs only 41 seconds (80-bit security) and 339 seconds (256-bit security) on moderate hardware in parallel mode. * A preliminary version  ...  The subject of study in this paper is the Private Set Intersection (PSI) problem.  ... 
doi:10.1145/2508859.2516701 dblp:conf/ccs/DongCW13 fatcat:msc5j6sxd5hchicjqljl34a3ae

More efficient oblivious transfer and extensions for faster secure computation

Gilad Asharov, Yehuda Lindell, Thomas Schneider, Michael Zohner
2013 Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security - CCS '13  
We propose a novel OT protocol with security in the standard model and improve OT extensions with respect to communication complexity, computation complexity, and scalability.  ...  A more efficient way to perform many OTs is to extend a small number of base OTs using OT extensions based on symmetric cryptography.  ...  Set-Intersection Privacy-preserving set-intersection allows two parties, each holding a set of σ-bit elements, to learn the elements they have in common.  ... 
doi:10.1145/2508859.2516738 dblp:conf/ccs/AsharovL0Z13 fatcat:k274ljin3zayviyenztorqd3p4

Faster Secure Comparisons with Offline Phase for Efficient Private Set Intersection [article]

Florian Kerschbaum and Erik-Oliver Blass and Rasoul Akhavan Mahdavi
2022 arXiv   pre-print
In a Private section intersection (PSI) protocol, Alice and Bob compute the intersection of their respective sets without disclosing any element not in the intersection.  ...  In this paper, we present a new private, extremely efficient comparison protocol that leads to a PSI protocol with low constants.  ...  ACKNOWLEDGEMENTS We gratefully acknowledge the support of NSERC for grants RGPIN-05849, IRC-537591, and the Royal Bank of Canada for funding this research.  ... 
arXiv:2209.13913v1 fatcat:cgzuctrw4jg3hhlxveflfi3owu

Private Join and Compute from PIR with Default [article]

Tancrède Lepoint, Sarvar Patel, Mariana Raykova, Karn Seth, Ni Trieu
2020 IACR Cryptology ePrint Archive  
The private join and compute (PJC) functionality enables secure computation over data distributed across different databases, and is applicable to a wide range of applications, many of which address settings  ...  We construct inner-product PJC, which has applications to ads conversion measurement and contact tracing, relying on an extension of PIR with default.  ...  Recently, several works [KK13, KKRT16, PSZ18] have proposed efficient protocols to generalize 1-out-of-2 OT extension to 1-out-of-N OT.  ... 
dblp:journals/iacr/LepointPRST20 fatcat:gxrgysd2dngtjddfhctuqq437u

A Survey of Oblivious Transfer Protocol

Vijay Kumar Yadav, Nitish Andola, Shekhar Verma, S Venkatesan
2022 ACM Computing Surveys  
Oblivious transfer (OT) protocol is an essential tool in cryptography that provides a wide range of applications like secure multi-party computation, private information retrieval, private set intersection  ...  The OT protocol has different variants such as one-out-of-2, one-out-of- n , k -out-of- n , and OT extension.  ...  We found that the performance and security of one-out-of-OT protocols behaved identically to the one-out-of-2 OT protocols.  ... 
doi:10.1145/3503045 fatcat:zp73i55tsjgadg7q2gb62x5fra

A Note on Cryptographic Algorithms for Private Data Analysis in Contact Tracing Applications [article]

Rajan M A, Manish Shukla, Sachin Lodha
2020 arXiv   pre-print
As part of this study, we focus on various cryptographic techniques that can help in addressing the Private Set Intersection problem which lies at the heart of privacy respecting contact tracing.  ...  The manual approach is cumbersome, time consuming and also requires active participation of a large number of people to realize it.  ...  One of the main enablers for these kinds of apps is the Private Set Intersection (PSI) technique [1] .  ... 
arXiv:2005.10634v1 fatcat:ajba5sg3krgnnpv72blvlllsty

Private multiparty sampling and approximation of vector combinations

Yuval Ishai, Tal Malkin, Martin J. Strauss, Rebecca N. Wright
2009 Theoretical Computer Science  
Moreover, these results have some interesting consequences for the general problem of reducing sublinear-communication secure multiparty computation to two-party private information retrieval (PIR).  ...  Sublinear-communication private protocols have primarily been studied only in the two-party case. In contrast, this work focuses on multiparty settings.  ...  on 1-out-of-2 OT) to compute f from these shares.  ... 
doi:10.1016/j.tcs.2008.12.062 fatcat:cmt6mwibyjen7ogguojyrdkfh4
« Previous Showing results 1 — 15 out of 4,308 results