Universally Verifiable Mix-Net with Verification Work Independent of the Number of Mix-Servers

スポンサーリンク

概要

• 論文の詳細を見る

• This paper presents a universally verifiable Mix-net where the amount of work done by a verifier is independent of the number of mix-servers. Furthermore, the computational task of each mix-server is constant with regard to the number of mix-servers except for some negligible tasks like computing hash function when no disruption occurs. The scheme also provides robustness.

• 社団法人電子情報通信学会の論文
• 2000-07-25

著者

• Abe Masayuki

  Ntt Information Sharing Platform Laboratories

関連論文

• Chosen Ciphertext Security with Optimal Ciphertext Overhead
• Flaws in Robust Optimistic Mix-Nets and Stronger Security Notions(Protocol, Cryptography and Information Security)
• Tag-KEM from Set Partial Domain One-Way Permutations
• Flexible-Routing Anonymous Networks Using Optimal Length of Ciphertext(Application)(Cryptography and Information Security)
• 1-out-of-n Signatures from a Variety of Keys (Asymmetric Cipher) (Cryptography and Information Security)
• M+1-st Price Auction Using Homomorphic Encryption(Special Section on Cryptography and Information Security)
• Lenient/Strict Batch Verification in Several Groups(Special Section on Cryptography and Information Security)
• Delegation Chains Secure up to Constant Length(Special Section on Cryptography and Information Security)
• Universally Verifiable Mix-Net with Verification Work Independent of the Number of Mix-Servers

スポンサーリンク