Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

10

PROVSEC
2009
Springer

favoriteEmaildiscussreport

109views Security Privacy» more PROVSEC 2009»

GUC-Secure Set-Intersection Computation

13 years 11 months ago

GUC-Secure Set-Intersection Computation

Download eprint.iacr.org

Secure set-intersection computation is one of important problems in secure multiparty computation with various applications. We propose a general construction for secure 2-party set-intersection computation based-on anonymous IBE (identity-based encryption) scheme and its user private-keys blind generation techniques. Compared with related works, this construction is provably GUC(generalized universally composable) secure in standard model with acceptable efficiency. In addition, an efficient instantiation based-on the anonymous Boyen-Waters IBE scheme is presented which user private-key’s blind generation protocol may be of independent values.

Yuan Tian, Hao Zhang

Real-time Traffic

Based-on Anonymous Ibe | PROVSEC 2009 | Secure Multiparty Computation | Secure Set-intersection Computation | Security Privacy |

claim paper

Related Content

» Fast SLCA and ELCA Computation for XML Keyword Queries Based on Set Intersection

» Private Intersection of Certified Sets

» Privacy Preserving Set Intersection Protocol Secure against Malicious Behaviors

» Privacy preserving set intersection based on bilinear groups

» Fast Set Intersection in Memory

» LinearComplexity Private Set Intersection Protocols Secure in Malicious Model

» Efficient Robust Private Set Intersection

» PrivacyPreserving Distributed Set Intersection

» Efficient Private Matching and Set Intersection

Post Info
More Details (n/a)

Added	27 May 2010
Updated	27 May 2010
Type	Conference
Year	2009
Where	PROVSEC
Authors	Yuan Tian, Hao Zhang

Comments (0)