Name
Abstract | ||
|---|---|---|
This paper addresses the security and efficiency issues of the Mix-net based on permutation networks introduced in [1]. We first show that the original construction results in a Mix-net that yields biased permutation, so it gives some advantage to adversaries. A simple repair is provided. We then observe that one of the original schemes can be improved so that the servers and verifier enjoy more efficient computation and communication. |
Year | DOI | Venue |
|---|---|---|
2001 | 10.1007/3-540-44586-2_23 | Public Key Cryptography |
Keywords | Field | DocType |
original construction result,permutation networks,simple repair,original scheme,efficiency issue,permutation network,efficient computation | Telecommunications network,Cryptography,Computer science,Permutation,Server,Cryptanalysis,Theoretical computer science,Random permutation,Mix network,Pseudorandom permutation | Conference |
Volume | ISSN | ISBN |
1992 | 0302-9743 | 3-540-41658-7 |
Citations | PageRank | References |
45 | 2.40 | 15 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Masayuki Abe | 1 | 1335 | 68.58 |
| Fumitaka Hoshino | 2 | 106 | 10.10 |