Presentation 1999/5/20
A Mix-network on Permutation Networks
Masayuki ABE,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) This paper presents two universally verifiable mix-net schemes that eliminate cumbersome cut-and-choose method. Our construction bases on a permutation network composed by a network of 'switches' that transposes two imputs. For N inputs and t possible adversarial servers, our schemes achieve Ο (tNlog N) efficiency in computation and communication while previous schemes stay in Ο (mkN) where m is the number of servers and k is a security parameter (k◆80). Hence, our schemes suit small to middle-scale secret-ballot electronic elections. Moreover, one of our schemes provides 'one-pass' property where servers do not need to talk to other servers except their neighbors unless disruption occurs.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) Mix-net / Electronic Voting / Anonymity / Permutation Network
Paper # ISEC99-10
Date of Issue

Conference Information
Committee ISEC
Conference Date 1999/5/20(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) A Mix-network on Permutation Networks
Sub Title (in English)
Keyword(1) Mix-net
Keyword(2) Electronic Voting
Keyword(3) Anonymity
Keyword(4) Permutation Network
1st Author's Name Masayuki ABE
1st Author's Affiliation NTT Laboratories()
Date 1999/5/20
Paper # ISEC99-10
Volume (vol) vol.99
Number (no) 57
Page pp.pp.-
#Pages 8
Date of Issue