Presentation 2009-09-25
Bit-Decomposition Protocol Using the Baby-Step-Giant-Step Algorithm
Koji CHIDA, Dai IKARASHI, Katsumi TAKAHASHI,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) Bit-decomposition protocol is a cryptographic protocol that converts an encrypted or secretly shared integer into each encrypted or secretly shared bit of the integer without leaking the integer. In this paper, we propose a bit-decomposition protocol for the Elgamal encryption with additive homomorphism. Due to the baby-step-giant-step algorithm, the proposed protocol improves the efficiency of our early work on SCIS2009. In particular, the proposed protocol requires less computational complexity than previous ones including our early work as long as an objective integer is between 18 and 32 bits.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) bit-decomposition protocol / multiparty protocol / baby-step-giant-step algorithm / Elgamal encryption / Paillier encryption
Paper # ISEC2009-41
Date of Issue

Conference Information
Committee ISEC
Conference Date 2009/9/18(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) Bit-Decomposition Protocol Using the Baby-Step-Giant-Step Algorithm
Sub Title (in English)
Keyword(1) bit-decomposition protocol
Keyword(2) multiparty protocol
Keyword(3) baby-step-giant-step algorithm
Keyword(4) Elgamal encryption
Keyword(5) Paillier encryption
1st Author's Name Koji CHIDA
1st Author's Affiliation NTT Information Sharing Platform Laboratories()
2nd Author's Name Dai IKARASHI
2nd Author's Affiliation NTT Information Sharing Platform Laboratories
3rd Author's Name Katsumi TAKAHASHI
3rd Author's Affiliation NTT Information Sharing Platform Laboratories
Date 2009-09-25
Paper # ISEC2009-41
Volume (vol) vol.109
Number (no) 207
Page pp.pp.-
#Pages 6
Date of Issue