Privately Computing Set-Union and Set-Intersection Cardinality via Bloom Filters

2015 ◽  
pp. 413-430 ◽  
Author(s):  
Rolf Egert ◽  
Marc Fischlin ◽  
David Gens ◽  
Sven Jacob ◽  
Matthias Senker ◽  
...  
Keyword(s):  
Bloom Filters ◽  
Set Intersection

scholarly journals Efficiency improvement techniques for private intersection-sum protocol using Bloom filter

2022 ◽  
Vol 4 (2) ◽  
Author(s):  
Hiroyuki Kano ◽  
Keisuke Hakuta
Keyword(s):  
Data Structures ◽  
Bloom Filter ◽  
Rational Integer ◽  
Bloom Filters ◽  
Efficiency Improvement ◽  
Probabilistic Data ◽  
Set Intersection ◽  
Private Set Intersection

AbstractA private set intersection protocol is one of the secure multi-party computation protocols, and allows participants to compute the intersection of their sets without revealing them to each other. Ion et al. proposed the private intersection-sum protocol (PI-Sum). The PI-Sum is one of the two-party private set intersection protocol. In the PI-Sum, two parties (say Alice and Bob) have the private sets A and B. Moreover, Bob additionaly has a rational integer associated with each element of B. The PI-Sum allows Bob to obtain the sum of the rational integers associated with the elements of $$A \cap B$$ A ∩ B . This paper proposes the efficiency improvement techniques for the PI-Sum. The proposed techniques are based on Bloom filters which are probabilistic data structures. More precisely, this paper proposes three protocols which are modifications of the PI-Sum. The proposed protocols are more efficient than the PI-Sum.

THE PROBLEM OF PROVIDING CACHE COHERENCE IN MULTIPROCESSOR SYSTEMS WITH MANY PROCESSORS

2018 ◽  
pp. 47-53
Author(s):  
B. Z. Shmeylin ◽  
E. A. Alekseeva
Keyword(s):  
Cache Coherence ◽  
Bloom Filters ◽  
Multiprocessor Systems ◽  
Cache Line ◽  
Maintenance Systems ◽  
Processor Caches ◽  
Conventional Systems ◽  
Additional Hardware

In this paper the tasks of managing the directory in coherence maintenance systems in multiprocessor systems with a large number of processors are solved. In microprocessor systems with a large number of processors (MSLP) the problem of maintaining the coherence of processor caches is significantly complicated. This is due to increased traffic on the memory buses and increased complexity of interprocessor communications. This problem is solved in various ways. In this paper, we propose the use of Bloom filters used to accelerate the determination of an element’s belonging to a certain array. In this article, such filters are used to establish the fact that the processor belongs to some subset of the processors and determine if the processor has a cache line in the set. In the paper, the processes of writing and reading information in the data shared between processors are discussed in detail, as well as the process of data replacement from private caches. The article also shows how the addresses of cache lines and processor numbers are removed from the Bloom filters. The system proposed in this paper allows significantly speeding up the implementation of operations to maintain cache coherence in the MSLP as compared to conventional systems. In terms of performance and additional hardware and software costs, the proposed system is not inferior to the most efficient of similar systems, but on some applications and significantly exceeds them.

scholarly journals TREASURE: Text Mining Algorithm Based On Affinity Analysis and Set Intersection to Find the Action of Tuberculosis Drugs against Other Pathogens

2021 ◽  
Vol 11 (15) ◽  
pp. 6834
Author(s):  
Pradeepa Sampath ◽  
Nithya Shree Sridhar ◽  
Vimal Shanmuganathan ◽  
Yangsun Lee
Keyword(s):  
Text Mining ◽  
Causes Of Death ◽  
Intersection Property ◽  
Research Papers ◽  
Bacterial Diseases ◽  
Mining Algorithm ◽  
Set Intersection ◽  
The World ◽  
Medical Researchers

Tuberculosis (TB) is one of the top causes of death in the world. Though TB is known as the world’s most infectious killer, it can be treated with a combination of TB drugs. Some of these drugs can be active against other infective agents, in addition to TB. We propose a framework called TREASURE (Text mining algoRithm basEd on Affinity analysis and Set intersection to find the action of tUberculosis dRugs against other pathogEns), which particularly focuses on the extraction of various drug–pathogen relationships in eight different TB drugs, namely pyrazinamide, moxifloxacin, ethambutol, isoniazid, rifampicin, linezolid, streptomycin and amikacin. More than 1500 research papers from PubMed are collected for each drug. The data collected for this purpose are first preprocessed, and various relation records are generated for each drug using affinity analysis. These records are then filtered based on the maximum co-occurrence value and set intersection property to obtain the required inferences. The inferences produced by this framework can help the medical researchers in finding cures for other bacterial diseases. Additionally, the analysis presented in this model can be utilized by the medical experts in their disease and drug experiments.

Profile Matching for IoMT: A Verifiable Private Set Intersection Scheme

2021 ◽  
pp. 1-1
Author(s):  
Yalian Qian ◽  
Jian Shen ◽  
Pandi Vijayakumar ◽  
Pradip Kumar Sharma
Keyword(s):  
Profile Matching ◽  
Set Intersection ◽  
Private Set Intersection

scholarly journals Set Intersection Theorems and Existence of Optimal Solutions

2006 ◽  
Vol 110 (2) ◽  
pp. 287-314 ◽  
Author(s):  
Dimitri P. Bertsekas ◽  
Paul Tseng
Keyword(s):  
Optimal Solutions ◽  
Existence Of Optimal Solutions ◽  
Set Intersection
Sign in / Sign up

Export Citation Format

Share Document