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.Category / Keywords: cryptographic protocols / oblivious transfer, access structure, secret sharing, private set-intersection, garbled Bloom filter, oblivious polynomial evaluation, privacy Date: received 23 Sep 2015 Contact author: zy113 at ie cuhk edu hk Available format(s): PDF | BibTeX Citation Version: 20150927:092236 (All versions of this report) Short URL: ia.cr/2015/929 Discussion forum: Show discussion | Start new discussion