Constant-round privacy preserving multiset union
Bull. Korean Math. Soc. 2013 Vol. 50, No. 6, 1799-1816
https://doi.org/10.4134/BKMS.2013.50.6.1799
Published online November 1, 2013
Jeongdae Hong, Jung Woo Kim, Jihye Kim, Kunsoo Park, and Jung Hee Cheon
Defense Security Command, Seoul National University, Kookmin University, Seoul National University, Seoul National University
Abstract : Privacy preserving multiset union (PPMU) protocol allows a set of parties, each with a multiset, to collaboratively compute a multiset union {\em secretly}, meaning that any information other than union is not revealed. We propose efficient PPMU protocols, using multiplicative homomorphic cryptosystem. The novelty of our protocol is to directly encrypt a polynomial by representing it by an element of an extension field. The resulting protocols consist of constant rounds and improve communication cost. We also prove the security of our protocol against malicious adversaries, in the random oracle model.
Keywords : privacy preserving multiset union, ElGamal on polynomials, homomorphic encryption
MSC numbers : Primary 11T71, 68P25, 94A60
Downloads: Full-text PDF  


Copyright © Korean Mathematical Society. All Rights Reserved.
The Korea Science Technology Center (Rm. 411), 22, Teheran-ro 7-gil, Gangnam-gu, Seoul 06130, Korea
Tel: 82-2-565-0361  | Fax: 82-2-565-0364  | E-mail: paper@kms.or.kr   | Powered by INFOrang Co., Ltd