Privacy-Preserving Boolean Operations and Their Applications
Abstract
In practice, many decision problems can be reduced to boolean operation, and many computation problems can be converted into boolean operation problems by appropriate transformation. Therefore, secure boolean operation protocols are building blocks for constructing other secure protocols. For the basic boolean operations: AND, OR operation, the existing protocols are mostly implemented by large-scale circuits, which cannot be easily used to construct customized protocols. Some works have been done to design protocols that are directly implemented based on homomorphic encryption algorithms, but their efficiency is not ideal. In order to solve boolean operations better, we propose a solution to privately compute the basic boolean functions AND, OR based on a probabilistic encryption algorithm. Furthermore, we compare our protocols with related works, theoretical analysis and the simulation results show that our protocols are efficient. Finally, we use boolean operations to solve some SMC problems.
Keywords
Privacy-Preserving, Boolean Operations, Set Intersection, Mutually Prime
DOI
10.12783/dtcse/cisnr2020/35159
10.12783/dtcse/cisnr2020/35159
Refbacks
- There are currently no refbacks.