Presentation 2000/5/18
A Robust Length-invariant Hybrid Mix
Miyako Ohkubo, Masayuki ABE,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) This paper presents the first secure Mix-net that can efficiently handle long messages. All existing schemes limit the length of messages to no more than a single block of the underlying public key encryption scheme, or handle long messages in a heuristic way. Our scheme also enjoys length-invariance, i. e. the length of the input ciphertext does not depend not depend on the number of mix-servers. We adopt hybrid encryption that combines a Diffie-Hellman public key exchange with a common key encryption. The security is proved in the random oracle model by showing a reduction from breaking the anonymity of our scheme to breaking the underlying symmetric encryption scheme or solving the decisional Diffe-Hellman problem. We also show an approach for the robust scheme that outputs correct results in the presence of corrupt servers.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) Hybrid Mix / Anonymous Channel / Hybrid encryption
Paper # ISEC2000-1
Date of Issue

Conference Information
Committee ISEC
Conference Date 2000/5/18(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Vice Chair

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 Robust Length-invariant Hybrid Mix
Sub Title (in English)
Keyword(1) Hybrid Mix
Keyword(2) Anonymous Channel
Keyword(3) Hybrid encryption
1st Author's Name Miyako Ohkubo
1st Author's Affiliation NTT Laboratories()
2nd Author's Name Masayuki ABE
2nd Author's Affiliation NTT Laboratories
Date 2000/5/18
Paper # ISEC2000-1
Volume (vol) vol.100
Number (no) 76
Page pp.pp.-
#Pages 8
Date of Issue