Theoretical Analysis of the Performance of Anonymous Communication System 3-Mode Net
Summary :
This paper aims at analyzing the performance of an anonymous communication system 3-Mode Net with respect to the number of relay nodes required for communication and sender anonymity. As for the number of relay nodes, we give explicit formulas of the probability distribution, the expectation, and the variance. Considering sender anonymity, we quantify the degree of sender anonymity under a situation where some relay nodes collude with each other. The above analyses use random walk theory, a probability generating function, and their properties. From obtained formulas, we show several conditions for avoiding a situation where the number of relay nodes becomes large, and for providing high sender anonymity. Furthermore, we investigate the relationship between the number of relay nodes and sender anonymity, and give a condition for providing a better performance of 3 MN.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E93-A No.7 pp.1338-1345
- Publication Date
- 2010/07/01
- Publicized
- Online ISSN
- 1745-1337
- DOI
- 10.1587/transfun.E93.A.1338
- Type of Manuscript
- PAPER
- Category
- Cryptography and Information Security
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Kazuhiro KONO, Shinnosuke NAKANO, Yoshimichi ITO, Noboru BABAGUCHI, "Theoretical Analysis of the Performance of Anonymous Communication System 3-Mode Net" in IEICE TRANSACTIONS on Fundamentals,
vol. E93-A, no. 7, pp. 1338-1345, July 2010, doi: 10.1587/transfun.E93.A.1338.
Abstract: This paper aims at analyzing the performance of an anonymous communication system 3-Mode Net with respect to the number of relay nodes required for communication and sender anonymity. As for the number of relay nodes, we give explicit formulas of the probability distribution, the expectation, and the variance. Considering sender anonymity, we quantify the degree of sender anonymity under a situation where some relay nodes collude with each other. The above analyses use random walk theory, a probability generating function, and their properties. From obtained formulas, we show several conditions for avoiding a situation where the number of relay nodes becomes large, and for providing high sender anonymity. Furthermore, we investigate the relationship between the number of relay nodes and sender anonymity, and give a condition for providing a better performance of 3 MN.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E93.A.1338/_p
Copy
@ARTICLE{e93-a_7_1338,
author={Kazuhiro KONO, Shinnosuke NAKANO, Yoshimichi ITO, Noboru BABAGUCHI, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Theoretical Analysis of the Performance of Anonymous Communication System 3-Mode Net},
year={2010},
volume={E93-A},
number={7},
pages={1338-1345},
abstract={This paper aims at analyzing the performance of an anonymous communication system 3-Mode Net with respect to the number of relay nodes required for communication and sender anonymity. As for the number of relay nodes, we give explicit formulas of the probability distribution, the expectation, and the variance. Considering sender anonymity, we quantify the degree of sender anonymity under a situation where some relay nodes collude with each other. The above analyses use random walk theory, a probability generating function, and their properties. From obtained formulas, we show several conditions for avoiding a situation where the number of relay nodes becomes large, and for providing high sender anonymity. Furthermore, we investigate the relationship between the number of relay nodes and sender anonymity, and give a condition for providing a better performance of 3 MN.},
keywords={},
doi={10.1587/transfun.E93.A.1338},
ISSN={1745-1337},
month={July},}
Copy
TY - JOUR
TI - Theoretical Analysis of the Performance of Anonymous Communication System 3-Mode Net
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1338
EP - 1345
AU - Kazuhiro KONO
AU - Shinnosuke NAKANO
AU - Yoshimichi ITO
AU - Noboru BABAGUCHI
PY - 2010
DO - 10.1587/transfun.E93.A.1338
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E93-A
IS - 7
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - July 2010
AB - This paper aims at analyzing the performance of an anonymous communication system 3-Mode Net with respect to the number of relay nodes required for communication and sender anonymity. As for the number of relay nodes, we give explicit formulas of the probability distribution, the expectation, and the variance. Considering sender anonymity, we quantify the degree of sender anonymity under a situation where some relay nodes collude with each other. The above analyses use random walk theory, a probability generating function, and their properties. From obtained formulas, we show several conditions for avoiding a situation where the number of relay nodes becomes large, and for providing high sender anonymity. Furthermore, we investigate the relationship between the number of relay nodes and sender anonymity, and give a condition for providing a better performance of 3 MN.
ER -
English
