Recently, the problem of privately mining association rules in vertically partitioned data has been reduced to the problem of privately computing boolean scalar products. In this paper, we propose two cryptographic multi-party protocols for privately computing boolean scalar products. The proposed protocols are shown to be secure and much faster than other protocols for the same problem. © Springer-Verlag Berlin Heidelberg 2007.
CITATION STYLE
Trincǎ, D., & Rajasekaran, S. (2007). Fast cryptographic multi-party protocols for computing boolean scalar products with applications to privacy-preserving association rule mining in vertically partitioned data. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4654 LNCS, pp. 418–427). https://doi.org/10.1007/978-3-540-74553-2_39
Mendeley helps you to discover research relevant for your work.