Abstract
A new private set-operation problem is proposed. Suppose there are n parties with each owning a secret set. Let one of them, say P, be the leader, S be P’s secret set, and t (less than n − 1) be a threshold value. For each element w of S, if w appears more than t times in the rest parties’ sets, then P learns which parties’ sets include w, otherwise P cannot know whether w appears in any party’s set. For this problem, a secure protocol is proposed in the semi-honest model based on semantically secure homomorphic encryption scheme, secure sharing scheme, and the polynomial representation of sets. The protocol only needs constant rounds of communication.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Naor M, Pinkas B. Oblivious transfer and polynomial evaluation. In Proc. 31st Annual ACM Symposium on Theory of Computing, Atlanta, Georgia, USA, ACM Press, 1999, pp.245–254.
Huberman B A, Franklin M, Hogg T. Enhancing privacy and trust in electronic communities. In Proc. First ACM Conference on Electronic Commerce, Denver, Colorado, USA, ACM Press, 1999, pp.78–86.
Agrawal R, Evfimievski A, Srikant R. Information sharing across private databases. In Proc. 2003 ACM SIGMOD International Conference on Management of Data, San Diego, California, USA, ACM Press, 2003, pp.86–97.
Freedman M J, Nissim K, Pinkas B. Efficient private matching and set intersection. In Proc. Advances in Cryptology —EUROCRYPT 2004, LNCS 3027, Berlin: Springer, May 2–6, 2004, pp.1–19.
Kissner L, Song D. Privacy-preserving set operations. In Proc. Advances in Cryptology — CRYPTO 2005, Santa Barbara, California, USA, August 14–18, LNCS 3621, Berlin: Springer, 2005, pp.241–257.
Yao A C. How to generate and exchange secrets. In Proc. 27th Annual Symposium on Foundations of Computer Science, Toronto, Canada, California: IEEE Computer Society Press, 1986, pp.162–167.
Goldreich O, Micali S, Wigderson A. How to play any mental game or a completeness theorem for protocols with honest majority. In Proc. 19th Annual ACM Symposium on Theory of Computing, New York, USA, ACM Press, 1987, pp.218–229.
Kissner L, Song D. Private and threshold set-intersection. Technical Report, CMU–CS–05–113, Carnegie Mellon University, 2005.
Goldreich O. Secure multi-party computation. [EB/OL] 1998, revised 2002. Available at: http://www.wisdom.weizmann.ac.il/∼oded/pp.html
Shamir A. How to share a secret. Communications of the ACM, 1979, 22(11): 612–613.
Ben-Or M, Goldwasser S, Wigderson A. Completeness theorems for non-cryptographic fault-tolerant distributed computation. In Proc. 20th Annual ACM Symposium on Theory of Computing, Chicago, Illinois, USA, May 2–4, ACM Press, 1988, pp.1–10.
Goldwasser S, Micali S. Probabilistic encryption. Journal of Computer and System Sciences, 1984, 28(2): 270–299.
Goldwasser S, Bellare M. Lecture notes on cryptography. [EB/OL] 2001. Available at: http://www.cs.ucsd.edu/use-rs/mihir/papers/gb.pdf.
Author information
Authors and Affiliations
Corresponding author
Additional information
This work is supported by the National Grand Fundamental Research 973 Program of China under Grant No.2004CB318004.
Electronic Supplementary Material
Below is the link to the electronic supplementary material.
Rights and permissions
About this article
Cite this article
Li, RH., Wu, CK. A Protocol for a Private Set-Operation. J. Comput. Sci. Technol. 22, 822–829 (2007). https://doi.org/10.1007/s11390-007-9098-3
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11390-007-9098-3