Paper 2011/138

Constant-Round Privacy Preserving Multiset Union

Jeongdae Hong, Jung Woo Kim, Jihye Kim, Kunsoo Park, and Jung Hee Cheon

Abstract

Privacy preserving multiset union (PPMU) protocol allows a set of parties, each with a multiset, to collaboratively compute a multiset union 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.

Metadata
Available format(s)
PDF PS
Category
Cryptographic protocols
Publication info
Published elsewhere. Unknown where it was published
Keywords
PrivacyMultiset UnionElGamal EncryptionHomomorphic Encryption
Contact author(s)
jkim @ theory snu ac kr
History
2011-03-21: received
Short URL
https://ia.cr/2011/138
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2011/138,
      author = {Jeongdae Hong and Jung Woo Kim and Jihye Kim and Kunsoo Park and Jung Hee Cheon},
      title = {Constant-Round Privacy Preserving Multiset Union},
      howpublished = {Cryptology ePrint Archive, Paper 2011/138},
      year = {2011},
      note = {\url{https://eprint.iacr.org/2011/138}},
      url = {https://eprint.iacr.org/2011/138}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.