Presentation 2008-05-16
On the Construction of the Set-Intersection Protocol from Blind Signatures
Ryo NOJIMA, Youki KADOBAYASHI,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) In this paper, we propose a simple and efficient two-party set-intersection protocol. Contrary to the previous protocols which are based on the oblivious pseudorandom function, or the oblivious polynomial evaluation, we construct the protocol from a certain family of the blind signatures. Though the security evaluation relying on the random oracles, the protocol is secure against malicious adversaries, and is efficient in terms of the time-complexity and the round-complexity.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) Secure two-party set-intersection / Blind signature / Asymptotically fast
Paper # ISEC2008-9
Date of Issue

Conference Information
Committee ISEC
Conference Date 2008/5/9(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Information Security (ISEC)
Language ENG
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) On the Construction of the Set-Intersection Protocol from Blind Signatures
Sub Title (in English)
Keyword(1) Secure two-party set-intersection
Keyword(2) Blind signature
Keyword(3) Asymptotically fast
1st Author's Name Ryo NOJIMA
1st Author's Affiliation NICT()
2nd Author's Name Youki KADOBAYASHI
2nd Author's Affiliation NAIST
Date 2008-05-16
Paper # ISEC2008-9
Volume (vol) vol.108
Number (no) 38
Page pp.pp.-
#Pages 4
Date of Issue