scholarly journals Circuit-PSI With Linear Complexity via Relaxed Batch OPPRF

2021 ◽  
Vol 2022 (1) ◽  
pp. 353-372
Author(s):  
Nishanth Chandran ◽  
Divya Gupta ◽  
Akash Shah
Keyword(s):  
Communication Complexity ◽  
Linear Complexity ◽  
State Of The Art ◽  
The State ◽  
Communication Cost ◽  
Independent Interest ◽  
Pseudorandom Functions ◽  
Long Line ◽  
Set Intersection ◽  
Private Set Intersection

Abstract In 2-party Circuit-based Private Set Intersection (Circuit-PSI), P 0 and P 1 hold sets S0 and S1 respectively and wish to securely compute a function f over the set S0 ∩ S1 (e.g., cardinality, sum over associated attributes, or threshold intersection). Following a long line of work, Pinkas et al. (PSTY, Eurocrypt 2019) showed how to construct a concretely efficient Circuit-PSI protocol with linear communication complexity. However, their protocol requires super-linear computation. In this work, we construct concretely efficient Circuit-PSI protocols with linear computational and communication cost. Further, our protocols are more performant than the state-of-the-art, PSTY – we are ≈ 2.3× more communication efficient and are up to 2.8× faster. We obtain our improvements through a new primitive called Relaxed Batch Oblivious Programmable Pseudorandom Functions (RB-OPPRF) that can be seen as a strict generalization of Batch OPPRFs that were used in PSTY. This primitive could be of independent interest.

scholarly journals Quantum private set intersection cardinality based on bloom filter

2021 ◽  
Vol 11 (1) ◽  
Author(s):  
Bai Liu ◽  
Ou Ruan ◽  
Runhua Shi ◽  
Mingwu Zhang
Keyword(s):  
Privacy Protection ◽  
Data Privacy ◽  
Communication Complexity ◽  
Single Photon ◽  
Bloom Filter ◽  
Distributed Database ◽  
Single Photons ◽  
Practical Applications ◽  
Set Intersection ◽  
Private Set Intersection

AbstractPrivate Set Intersection Cardinality that enable Multi-party to privately compute the cardinality of the set intersection without disclosing their own information. It is equivalent to a secure, distributed database query and has many practical applications in privacy preserving and data sharing. In this paper, we propose a novel quantum private set intersection cardinality based on Bloom filter, which can resist the quantum attack. It is a completely novel constructive protocol for computing the intersection cardinality by using Bloom filter. The protocol uses single photons, so it only need to do some simple single-photon operations and tests. Thus it is more likely to realize through the present technologies. The validity of the protocol is verified by comparing with other protocols. The protocol implements privacy protection without increasing the computational complexity and communication complexity, which are independent with data scale. Therefore, the protocol has a good prospects in dealing with big data, privacy-protection and information-sharing, such as the patient contact for COVID-19.

Unbalanced private set intersection cardinality protocol with low communication cost

2020 ◽  
Vol 102 ◽  
pp. 1054-1061 ◽  
Author(s):  
Siyi Lv ◽  
Jinhui Ye ◽  
Sijie Yin ◽  
Xiaochun Cheng ◽  
Chen Feng ◽  
...  
Keyword(s):  
Communication Cost ◽  
Set Intersection ◽  
Private Set Intersection

ROTed: Random Oblivious Transfer for embedded devices

2021 ◽  
pp. 215-238
Author(s):  
P. Branco ◽  
L. Fiolhais ◽  
M. Goulão ◽  
P. Martins ◽  
P. Mateus ◽  
...  
Keyword(s):  
State Of The Art ◽  
Random Oracle Model ◽  
Random Oracle ◽  
Oblivious Transfer ◽  
The State ◽  
Contact Tracing ◽  
Embedded Devices ◽  
Set Intersection ◽  
Wide Range ◽  
Order Of Magnitude

Oblivious Transfer (OT) is a fundamental primitive in cryptography, supporting protocols such as Multi-Party Computation and Private Set Intersection (PSI), that are used in applications like contact discovery, remote diagnosis and contact tracing. Due to its fundamental nature, it is utterly important that its execution is secure even if arbitrarily composed with other instances of the same, or other protocols. This property can be guaranteed by proving its security under the Universal Composability model. Herein, a 3-round Random Oblivious Transfer (ROT) protocol is proposed, which achieves high computational efficiency, in the Random Oracle Model. The security of the protocol is based on the Ring Learning With Errors assumption (for which no quantum solver is known). ROT is the basis for OT extensions and, thus, achieves wide applicability, without the overhead of compiling ROTs from OTs. Finally, the protocol is implemented in a server-class Intel processor and four application-class ARM processors, all with different architectures. The usage of vector instructions provides on average a 40% speedup. The implementation shows that our proposal is at least one order of magnitude faster than the state-of-the-art, and is suitable for a wide range of applications in embedded systems, IoT, desktop, and servers. From a memory footprint perspective, there is a small increase (16%) when compared to the state-of-the-art. This increase is marginal and should not prevent the usage of the proposed protocol in a multitude of devices. In sum, the proposal achieves up to 37k ROTs/s in an Intel server-class processor and up to 5k ROTs/s in an ARM application-class processor. A PSI application, using the proposed ROT, is up to 6.6 times faster than related art.

scholarly journals PIR-PSI: Scaling Private Contact Discovery

2018 ◽  
Vol 2018 (4) ◽  
pp. 159-178 ◽  
Author(s):  
Daniel Demmler ◽  
Peter Rindal ◽  
Mike Rosulek ◽  
Ni Trieu
Keyword(s):  
Social Networking ◽  
Private Information ◽  
Provable Security ◽  
State Of The Art ◽  
Private Information Retrieval ◽  
Social Contacts ◽  
Set Intersection ◽  
New Ideas ◽  
Private Set Intersection ◽  
Security Guarantees

Abstract An important initialization step in many social-networking applications is contact discovery, which allows a user of the service to identify which of its existing social contacts also use the service. Naïve approaches to contact discovery reveal a user’s entire set of social/professional contacts to the service, presenting a significant tension between functionality and privacy. 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) size of the client’s list. The protocol is specifically tailored to the case of a small client set and large user database. Our protocol has provable security guarantees and combines new ideas with state-of-the-art techniques from private information retrieval and private set intersection. We report on a highly optimized prototype implementation of our system, which is practical on real-world set sizes. For example, contact discovery between a client with 1024 contacts and a server with 67 million user entries takes 1.36 sec (when using server multi-threading) and uses only 4.28 MiB of communication.

Sign in / Sign up

Export Citation Format

Share Document