Flexible-Routing Anonymous Networks Using Optimal Length of Ciphertext(Application)(<Special Section>Cryptography and Information Security)
スポンサーリンク
概要
- 論文の詳細を見る
We present an efficient Hybrid Mix scheme that provides both routing flexibility and the optimal length of ciphertext. Although it is rather easy to embed routing information in the ciphertext, and a scheme that provides the optimal length of ciphertext is already known, it is not a trivial task to achieve both properties all at the same time. A critical obstacle for providing the optimal length of ciphertext is the session-key encapsulation header in a ciphertext that carries the encrypted session-key to each router, which linearly increases according to the number of intermediate routers. We solve this problem by improving the previously reported Hybrid Mix scheme such that the resulting scheme benefits from routing flexibility with a constant length of such headers. Our basic scheme is only secure against honest, but curious intermediate routers. Therefore, we further address the robustness issue to prevent malicious behavior by incorporating and improving an existing efficient approach based on the Message Authentication Code.
- 社団法人電子情報通信学会の論文
- 2005-01-01
著者
-
CHIDA Koji
NTT Information Sharing Platform Laboratories, NTT Corporation
-
ABE Masayuki
NTT Information Sharing Platform Laboratories, NTT Corporation
-
Abe Masayuki
Ntt Information Sharing Platform Laboratories Ntt Corporation
-
Chida Koji
Ntt Information Sharing Platform Laboratories Ntt Corporation
-
Abe Masayuki
Ntt Information Sharing Platform Laboratories
関連論文
- Non-optimistic Secure Circuit Evaluation Based on ElGamal Encryption and Its Applications(Protocols,Cryptography and Information Security)
- Batch Processing for Proofs of Partial Knowledge and Its Applications
- Chosen Ciphertext Security with Optimal Ciphertext Overhead
- Flaws in Robust Optimistic Mix-Nets and Stronger Security Notions(Protocol, Cryptography and Information Security)
- An Auction Protocol Preserving Privacy of Losing Bids with a Secure Value Comparison Scheme (Applications) (Cryptography and Information Security)
- Tag-KEM from Set Partial Domain One-Way Permutations
- Multiparty Computation from El Gamal/Paillier Conversion
- Secure Multiparty Computation for Comparator Networks
- Flexible-Routing Anonymous Networks Using Optimal Length of Ciphertext(Application)(Cryptography and Information Security)
- Conversion Schemes for Unlinkable Signatures That Include Revocable Unlinkability(Digital Signature, 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