Paper 2015/929

Are you The One to Share? Secret Transfer with Access Structure

Yongjun Zhao and Sherman S. M. Chow


Sharing information to others is common nowadays, but the question is with whom to share. To address this problem, we propose the notion of secret transfer with access structure (STAS). STAS is a two-party computation protocol that enables the server to transfer a secret to a client who satisfies the prescribed access structure. In this paper, we focus on the case of STAS for threshold access structure, i.e. threshold secret transfer (TST). We also discuss how to replace it with linear secret sharing to make the access structure more expressive. Our proposed TST scheme enables a number of applications including a simple construction of oblivious transfer with threshold access control, and (a variant of) threshold private set intersection (t-PSI), which are the first of their kinds in the literature to the best of our knowledge. Moreover, we show that TST is useful a number of applications such as privacy-preserving matchmaking with interesting features. The underlying primitive of STAS is a variant of oblivious transfer (OT) which we call OT for sparse array. We provide two constructions which are inspired from state-of-the-art PSI techniques including oblivious polynomial evaluation and garbled Bloom filter (GBF). We implemented the more efficient construction and provide its performance evaluation.

Available format(s)
Cryptographic protocols
Publication info
Preprint. MINOR revision.
oblivious transferaccess structuresecret sharingprivate set-intersectiongarbled Bloom filteroblivious polynomial evaluationprivacy
Contact author(s)
zy113 @ ie cuhk edu hk
2015-09-27: received
Short URL
Creative Commons Attribution


      author = {Yongjun Zhao and Sherman S. M.  Chow},
      title = {Are you The One to Share? Secret Transfer with Access Structure},
      howpublished = {Cryptology ePrint Archive, Paper 2015/929},
      year = {2015},
      note = {\url{}},
      url = {}
Note: In order to protect the privacy of readers, does not use cookies or embedded third party content.