Loading...
| Friend's email | |
| Your name | |
| Your email | |
| enter code | |
This page was sent successfuly
- Type of Document: M.Sc. Thesis
- Language: Farsi
- Document No: 39724 (19)
- University: Sharif University of Technology
- Department: Computer Engineering
- Advisor(s): Jalili, Rasoul
- Abstract:
- Providing anonymity in communications is one of the major requirements for the preserving the privacy of users using communication networks. There are several protocols for transmitting anonymous message in public communication networks. DC-Nets can be considered as an important solution to anonymous communications because they provide perfect anonymity; however, their high message and bit complexity is a major obstacle in their practical usage. All DC-Net based protocols provide anonymity of sender and receiver by establishing some anonymous channels for transmission of messages. Each execution of the DC-Net protocol acts as an anonymous channel, which only one participant can send his message anonymously through it. We propose a new anonymous message transmission protocol which permits n simultaneous anonymous channels using the same message and bit complexity as the DC-Net protocol. Thus, we reduced the bit complexity of DC-Nets by O(n). Randomly choosing anonymous channels for sending anonymous messages can cause collisions; thus we proposed some methods for copping with the problem of collisions in these channels. Also we proved anonymity of our protocol and showed that it provide perfect anonymity thus it is fully secure against attacks to its anonymity; but its availability is vulnerable to some attacks similar to possible attacks against usual DC-Net protocols. Finally the protocol has been analyzed against possible availability attacks and some existing methods of protecting DC-Nets from these attacks also have been extended to protect our protocol
- Keywords:
- Privacy ; Dining Cryptographers
Digital Object List
-
محتواي پايان نامه
- view
Bookmark