Presentation 2002/3/12
Secret Function Sharing Systems for Multi-Groups and their Application to Oblivious Transfers
Yohei KAWAMOTO, Hirosuke YAMAMOTO,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) Distributed oblivious transfer is proposed by Naor-Pinkas, but this system is weak against chooser-server collusion attacks. We propose a new scheme of the 1-out-of-l oblivious transfer which is robust for the collusion attacks. The new scheme is constructed by combining two methods, secret function sharing systems for multi-groups and ramp threshold schemes. The former is an extension of Koyama's cryptographic key sharing methods for multi-groups, it strengthens the robustness for the collusion attacks. The latter contributes to efficiency of coding rate.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) secret sharing system / secret sharing system for functions / oblivious transfer
Paper # ISEC2001-122
Date of Issue

Conference Information
Committee ISEC
Conference Date 2002/3/12(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) Secret Function Sharing Systems for Multi-Groups and their Application to Oblivious Transfers
Sub Title (in English)
Keyword(1) secret sharing system
Keyword(2) secret sharing system for functions
Keyword(3) oblivious transfer
1st Author's Name Yohei KAWAMOTO
1st Author's Affiliation Department of Mathematical Engineering and Information Physics, University of Tokyo()
2nd Author's Name Hirosuke YAMAMOTO
2nd Author's Affiliation Department of Mathematical Engineering and Information Physics, University of Tokyo
Date 2002/3/12
Paper # ISEC2001-122
Volume (vol) vol.101
Number (no) 728
Page pp.pp.-
#Pages 6
Date of Issue