Processing math: 100%
We use cookies to improve your experience with our site.

Indexed in:

SCIE, EI, Scopus, INSPEC, DBLP, CSCD, etc.

Submission System
(Author / Reviewer / Editor)
Advanced Search
Volume 22 Issue 6
November  2007
Turn off MathJax
Article Contents
Abstract
References
Rong-Hua Li, Chuan-Kun Wu. A Protocol for a Private Set-Operation[J]. Journal of Computer Science and Technology, 2007, 22(6): 822-829.
Citation: Rong-Hua Li, Chuan-Kun Wu. A Protocol for a Private Set-Operation[J]. Journal of Computer Science and Technology, 2007, 22(6): 822-829.
shu

A Protocol for a Private Set-Operation

  • 1State Key Laboratory of Information Security, Institute of Software, Chinese Academy of Sciences, Beijing 100080, China2Graduate University of Chinese Academy of Sciences, Beijing 100049, China

More Information
  • Received Date: February 07, 2007
  • Revised Date: August 05, 2007
  • Published Date: November 14, 2007
    Abstract
  • A new private set-operation problem is proposed. Suppose there are nparties with each owning a secret set. Let one of them, say P, be theleader, S be P's secret set, and t (less than n−1) be athreshold value. For each element w of S, if w appears morethan t times in the rest parties' sets, then P learns whichparties' sets include w, otherwise P cannot know whether wappears in any party's set. For this problem, a secure protocol isproposed in the semi-honest model based on semantically securehomomorphic encryption scheme, secure sharing scheme, and thepolynomial representation of sets. The protocol only needsconstant rounds of communication.
    • FullText(HTML)
    • References (13)
  • [1]
    Naor M, Pinkas B. \rm Oblivious transfer and polynomial evaluation. In -\it Proc. 31st Annual ACM Symposium on Theory of Computing}, Atlanta, Georgia, USA, ACM Press, 1999, pp.245∼254.
    [2]
    Huberman B A, Franklin M, Hogg T. \rm Enhancing privacy and trust in electronic communities. In -\it Proc. First ACM Conference on Electronic Commerce}, Denver, Colorado, USA, ACM Press, 1999, pp.78∼86.
    [3]
    Agrawal R, Evfimievski A, Srikant R. \rm Information sharing across private databases. In -\it Proc. 2003 ACM SIGMOD International Conference on Management of Data}, San Diego, California, USA, ACM Press, 2003, pp.86∼97.
    [4]
    Freedman M J, Nissim K, Pinkas B. \rm Efficient private matching and set intersection. In -\it Proc. Advances in Cryptology --- EUROCRYPT 2004}, -\it LNCS 3027}, Berlin: Springer, May 2∼6, 2004, pp.1∼19.
    [5]
    Kissner L, Song D. \rm Privacy-preserving set operations. In -\it Proc. Advances in Cryptology --CRYPTO 2005}, Santa Barbara, California, USA, August 14∼18, -\it LNCS 3621}, Berlin: Springer, 2005, pp.241∼257.
    [6]
    Yao A C. How to generate and exchange secrets. In -\it Proc. 27th Annual Symposium on Foundations of Computer Science}, Toronto, Canada, California: IEEE Computer Society Press, 1986, pp.162∼167.
    [7]
    Goldreich O, Micali S, Wigderson A. How to play any mental game or a completeness theorem for protocols with honest majority. In -\it Proc. 19th Annual ACM Symposium on Theory of Computing}, New York, USA, ACM Press, 1987, pp.218∼229.
    [8]
    Kissner L, Song D. Private and threshold set-intersection. Technical Report, CMU-CS-05-113, Carnegie Mellon University, 2005.
    [9]
    Goldreich O. Secure multi-party computation.
    [EB/OL] 1998, revised 2002. Available at: http://www.wisdom. weizmann.ac.il/∼oded/pp.html
    [10]
    Shamir A. How to share a secret. -\it Communications of the ACM}, 1979, 22(11): 612∼613.
    [11]
    Ben-Or M, Goldwasser S, Wigderson A. Completeness theorems for non-cryptographic fault-tolerant distributed computation. In -\it Proc. 20th Annual ACM Symposium on Theory of Computing}, Chicago, Illinois, USA, May 2∼4, ACM Press, 1988, pp.1∼10.
    [12]
    Goldwasser S, Micali S. Probabilistic encryption. -\it Journal of Computer and System Sciences}, 1984, 28(2): 270∼299.
    [13]
    Goldwasser S, Bellare M. Lecture notes on cryptography.
    [EB/OL] 2001. Available at: http://www.cs.ucsd.edu/use\-rs/mihir/papers/gb.pdf.
    • Relative Articles
  • Supplements (0)

Catalog

    Get Citation
    XML
    Article views (15) PDF downloads (6896) Cited by()
    Related

    Copyright ©2025 JCST, All Rights Reserved     京ICP备05002829号-1

    Institute of Computing Technology, Chinese Academy of Sciences
    P.O. Box 2704, Beijing 100190, P.R. China

    Tel.: 86-10-62610746 E-mail: jcst@ict.ac.cn

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return