Computation of ratios of secure summations in multi-party privacy-preserving latent dirichlet allocation

Authors:
Bin Yang;Hiroshi Nakagawa
Affiliations:
Graduate School of Information Science and Technology, The University of Tokyo, Japan;Information Technology Center, The University of Tokyo, Japan
Venue:
PAKDD'10 Proceedings of the 14th Pacific-Asia conference on Advances in Knowledge Discovery and Data Mining - Volume Part I
Year:
2010

Citing 11
Cited 0

Secret sharing homomorphisms: keeping shares of a secret secret

Proceedings on Advances in cryptology---CRYPTO '86
On privacy and partition arguments

Information and Computation
Foundations of Cryptography: Basic Tools

Foundations of Cryptography: Basic Tools
A Generalisation, a Simplification and Some Applications of Paillier's Probabilistic Public-Key System

PKC '01 Proceedings of the 4th International Workshop on Practice and Theory in Public Key Cryptography: Public Key Cryptography
Latent dirichlet allocation

The Journal of Machine Learning Research
Foundations of Cryptography: Volume 2, Basic Applications

Foundations of Cryptography: Volume 2, Basic Applications
Pattern Recognition and Machine Learning (Information Science and Statistics)

Pattern Recognition and Machine Learning (Information Science and Statistics)
Privacy-preserving Naïve Bayes classification

The VLDB Journal — The International Journal on Very Large Data Bases
Privacy-Preserving Data Mining: Models and Algorithms

Privacy-Preserving Data Mining: Models and Algorithms
Public-key cryptosystems based on composite degree residuosity classes

EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Privacy preserving clustering

ESORICS'05 Proceedings of the 10th European conference on Research in Computer Security

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we focus our attention on the problem of Gibbs sampling for privacy-preserving Latent Dirichlet Allocation, which is equals to a problem of computing the ratio of two numbers, both of which are the summations of the private numbers distributed in different parties. Such a problem has been studied in the case that each party is semi-honest. Here we propose a new solution based on a weaken assumption that some of the parties may collaborate together to extract information of other parties.