GUC-Secure Set-Intersection Computation

Authors:
Yuan Tian;Hao Zhang
Affiliations:
School of Software, Dalian University of Technology, Dalian, China 116620;School of Software, Dalian University of Technology, Dalian, China 116620
Venue:
ProvSec '09 Proceedings of the 3rd International Conference on Provable Security
Year:
2009

Citing 11
Cited 0

Universally Composable Security: A New Paradigm for Cryptographic Protocols

FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Foundations of Cryptography: Volume 2, Basic Applications

Foundations of Cryptography: Volume 2, Basic Applications
Strengthening Zero-Knowledge Protocols Using Signatures

Journal of Cryptology
Efficient Constructions of Composable Commitments and Zero-Knowledge Proofs

CRYPTO 2008 Proceedings of the 28th Annual conference on Cryptology: Advances in Cryptology
Universally composable security with global setup

TCC'07 Proceedings of the 4th conference on Theory of cryptography
Security against covert adversaries: efficient protocols for realistic adversaries

TCC'07 Proceedings of the 4th conference on Theory of cryptography
Efficient protocols for set intersection and pattern matching with security against malicious and covert adversaries

TCC'08 Proceedings of the 5th conference on Theory of cryptography
Keyword search and oblivious pseudorandom functions

TCC'05 Proceedings of the Second international conference on Theory of Cryptography
Searchable encryption revisited: consistency properties, relation to anonymous IBE, and extensions

CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
Privacy-preserving set operations

CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
Anonymous hierarchical identity-based encryption (without random oracles)

CRYPTO'06 Proceedings of the 26th annual international conference on Advances in Cryptology

Quantified Score

Hi-index	0.00

Visualization

Abstract

Secure set-intersection computation is one of the important problems in secure multiparty computation. We propose a general protocol construction for secure 2-party set-intersection computation based-on the anonymous IBE 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 Boyen-Waters IBE scheme is also presented.