Testing Disjointness of Private Datasets

@inproceedings{Kiayias2005TestingDO,
  title={Testing Disjointness of Private Datasets},
  author={Aggelos Kiayias and Antonina Mitrofanova},
  booktitle={Financial Cryptography},
  year={2005}
}
Two parties, say Alice and Bob, possess two sets of elements that belong to a universe of possible values and wish to test whether these sets are disjoint or not. In this paper we consider the above problem in the setting where Alice and Bob wish to disclose no information to each other about their sets beyond the single bit: “whether the intersection is empty or not.” This problem has many applications in commercial settings where two mutually distrustful parties wish to decide with minimum… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-10 OF 28 CITATIONS

Privacy-preserving multi-set operations

  • 2012 IEEE 14th International Conference on Communication Technology
  • 2012
VIEW 5 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

Privacy-Preserving Distributed Set Intersection

  • 2008 Third International Conference on Availability, Reliability and Security
  • 2007
VIEW 4 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Privacy Preserving Optimization of Participatory Sensing in Mobile Cloud Computing

  • 2017 IEEE 37th International Conference on Distributed Computing Systems (ICDCS)
  • 2017
VIEW 1 EXCERPT
CITES BACKGROUND

Avatar: Mobile Distributed Computing in the Cloud

  • 2015 3rd IEEE International Conference on Mobile Cloud Computing, Services, and Engineering
  • 2015
VIEW 1 EXCERPT
CITES METHODS

Privacy-Aware Genome Mining: Server-Assisted Protocols for Private Set Intersection and Pattern Matching

  • 2015 IEEE 28th International Symposium on Computer-Based Medical Systems
  • 2015
VIEW 1 EXCERPT
CITES BACKGROUND

References

Publications referenced by this paper.
SHOWING 1-10 OF 21 REFERENCES

Mielikinen, On Secure Scalar Product Computation for Privacy-Preserving Data Mining

Bart Goethals, Sven Laur, Helger Lipmaa, Taneli
  • The 7th Annual International Conference in Information Security and Cryptology (ICISC
  • 2004
VIEW 1 EXCERPT

Razborov , On the Distributional Complexity of Disjointness

A Alexander
  • Theor . Comput . Sci .
  • 1999

Damgard Zero-Knowledge Proofs for Finite Field Arithmetic; or: Can Zero-Knowledge be for Free

Ronald Cramer, Ivan
  • 1998