Two-Party Computation Model for Privacy-Preserving Queries over Distributed Databases

Many existing privacy-preserving techniques for querying distributed databases of sensitive information do not scale for large databases due to the use of heavyweight cryptographic techniques. In addition, many of these protocols require several rounds of interactions between the participants which may be impractical in wide-area settings. At the other extreme, a trusted party based approach does provide scalability but it forces the individual databases to reveal private information to the central party. This paper shows how to perform various privacypreserving operations in a scalable manner under the honest-but-curious model. Our system provides the same level of scalability as a trusted central party based solution while providing privacy guarantees without the need for heavyweight cryptography. The key idea is to develop an alternative system model using a Two-Party Query Computation Model comprising of a randomizer and a computing engine which do not reveal any information betwe...

• Type: Conference
• Year: 2009
• Where: NDSS
• Authors: Sherman S. M. Chow, Jie-Han Lee, Lakshminarayanan Subramanian
• Keywords: Central Party, Computer Networks, Heavyweight Cryptographic Techniques, NDSS 2009, Scalability