GUC-Secure Set-Intersection Computation

TIAN Yuan; WANG Ying

eprint.iacr.org will be offline for approximately an hour for routine maintenance at 11pm UTC on Tuesday, April 16. We lost some data between April 12 and April 14, and some authors have been notified that they need to resubmit their papers.

Paper 2008/392

GUC-Secure Set-Intersection Computation

TIAN Yuan and WANG Ying

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.

Metadata

Available format(s): PDF
Publication info: Published elsewhere. Extended Abstract submitted to TCC 09.
Keywords: set-intersection GUC security identity-based encryption anonymity
Contact author(s): tianyuan_ca @ sina com
History: 2009-02-04: revised; 2008-09-16: received; See all versions
Short URL: https://ia.cr/2008/392
License: CC BY

BibTeX

@misc{cryptoeprint:2008/392,
      author = {TIAN Yuan and WANG Ying},
      title = {GUC-Secure Set-Intersection Computation},
      howpublished = {Cryptology ePrint Archive, Paper 2008/392},
      year = {2008},
      note = {\url{https://eprint.iacr.org/2008/392}},
      url = {https://eprint.iacr.org/2008/392}
}