CryptoDB
GUC-Secure Set-Intersection Computation
Authors: | |
---|---|
Download: | |
Abstract: | Secure set-intersection computation is one of important problems in the field of secure multiparty computation with valuable applications. We propose a very gerneral construction for 2-party set-intersection computation based-on anonymous IBE scheme and its user private-keys blind generation techniques. Compared with recently-proposed protocols, e.g., those of Freedman-Nissim-Pinkas, Kissner-Song and Hazay-Lindell, this construction is provabley GUC-secure in standard model with acceptable efficiency. For this goal a new notion of non-malleable zero-knowledge proofs of knowledge and its efficient general construction is presented. In addition, we present an efficient instantiation of this general construction via anonymous Boyen-Waters IBE scheme. |
BibTeX
@misc{eprint-2008-18160, title={GUC-Secure Set-Intersection Computation}, booktitle={IACR Eprint archive}, keywords={set-intersection, GUC security, identity-based encryption, anonymity}, url={http://eprint.iacr.org/2008/392}, note={Extended Abstract submitted to TCC 09. tianyuan_ca@sina.com 14279 received 16 Sep 2008, last revised 3 Feb 2009}, author={TIAN Yuan and WANG Ying}, year=2008 }