A Length-invariant Hybrid Mix(Special Section on Fundamentals of Information and Communications)

スポンサーリンク

概要

• 論文の詳細を見る

• This paper presents a Mix-net that has the following properties ; - it efficiently handles long plaintexts that exceed the modulus size of the underlying public-key encryption scheme as well as very short ones (length-flexibility). - input ciphertext length is not impacted by the number of mix-servers (length-invariance), and - its security in terms of anonymity can be proven in a formal way (probable security). If desired, one can add robustness so that it outputs correct results in the presence of corrupt users and servers. The security is proven in such a sense that breaking the anonymity of our Mix-net is equivalent to breaking the indistinguishability assumption of the underlying symmetric encryption scheme or the Decision Diffie-Hellman assumption.

• 社団法人電子情報通信学会の論文
• 2001-04-01

著者

• Ohkubo M

  Ntt Corp. Yokosuka‐shi Jpn

• Ohkubo Miyako

  Ntt Laboratories

• ABE Masayuki

  NTT Laboratories

関連論文

• A Length-invariant Hybrid Mix(Special Section on Fundamentals of Information and Communications)
• Efficient Threshold Signer-Ambiguous Signatures from Variety of Keys(Information Security)

スポンサーリンク