Presentation 2001/11/1
One-to-Many Matching Protocol
Kunio KOBAYASHI,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) This paper proposes a secure many-to-one matching protocol that keeps their privacy. Each user and submit a sealed information to matching servers. Our protocol matches these information while keeping them secret and indicates whether one of the many information is equal to one information. Also the trading system is introduced as an application of our protocol.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) matching / OPE / information comparing / probabilistic homomorphic encryption
Paper # ISEC2001-73
Date of Issue

Conference Information
Committee ISEC
Conference Date 2001/11/1(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 JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) One-to-Many Matching Protocol
Sub Title (in English)
Keyword(1) matching
Keyword(2) OPE
Keyword(3) information comparing
Keyword(4) probabilistic homomorphic encryption
1st Author's Name Kunio KOBAYASHI
1st Author's Affiliation NTT Information Sharing Platform Laboratories, NTT Corporation()
Date 2001/11/1
Paper # ISEC2001-73
Volume (vol) vol.101
Number (no) 402
Page pp.pp.-
#Pages 5
Date of Issue