Presentation 2005-12-16
New Efficient Voting Scheme based on Pairing
Ryuichi SAKAI, Masao KASAHARA,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) In general, there are two types of the voting schemes. One of the scheme uses the verifiable secret sharing scheme and the r-th residue homomorphic encryption scheme and another scheme uses the verifaiable mix-net. However, these schemes require many communications and computations. We propose the new efficient electronic voting scheme based on bilinear pairings. The idea of our scheme was firstly presented in SCIS2002[1]. This scheme also uses the verifiable secret sharing scheme, but the scheme does not need the ZKIP. Therefore the new scheme are very efficient in practical use and the validity of votes and the voting results can be verified in public.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) k/n Threshold Scheme / Secret Sharing / Verifiable / Electronic Voting
Paper # ISEC2005-115
Date of Issue

Conference Information
Committee ISEC
Conference Date 2005/12/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 JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) New Efficient Voting Scheme based on Pairing
Sub Title (in English)
Keyword(1) k/n Threshold Scheme
Keyword(2) Secret Sharing
Keyword(3) Verifiable
Keyword(4) Electronic Voting
1st Author's Name Ryuichi SAKAI
1st Author's Affiliation Osaka Electro-Communication University()
2nd Author's Name Masao KASAHARA
2nd Author's Affiliation Osaka Gakuin University
Date 2005-12-16
Paper # ISEC2005-115
Volume (vol) vol.105
Number (no) 484
Page pp.pp.-
#Pages 4
Date of Issue