Provable Unlinkability Against Traffic Analysis Already After $\mathcal{O}(\log(n))~$ Steps!

Gomułkiewicz, Marcin; Klonowski, Marek; Kutyłowski, Mirosław

doi:10.1007/978-3-540-30144-8_30

Cited by 11 publications

(13 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…That was the first time when onions were explicitly used however, not under this name. This scheme was examined in details [13,11] in different adversary models.…”

Section: Anonymous Communicationmentioning

confidence: 99%

See 1 more Smart Citation

Onions Based on Universal Re-encryption – Anonymous Communication Immune Against Repetitive Attack

Gomułkiewicz

Klonowski

Kutyłowski

2005

Information Security Applications

Self Cite

View full text Add to dashboard Cite

Abstract. Encapsulating messages in onions is one of the major techniques providing anonymous communication in computer networks. To some extent, it provides security against traffic analysis by a passive adversary. However, it can be highly vulnerable to attacks by an active adversary. For instance, the adversary may perform a simple so-called repetitive attack: a malicious server sends the same massage twice, then the adversary traces places where the same message appears twice -revealing the route of the original message. A repetitive attack was examined for mix-networks. However, none of the countermeasures designed is suitable for onion-routing. In this paper we propose an "onion-like" encoding design based on universal reencryption. The onions constructed in this way can be used in a protocol that achieves the same goals as the classical onions, however, at the same time we achieve immunity against a repetitive attack. Even if an adversary disturbs communication and prevents processing a message somewhere on the onion path, it is easy to identify the malicious server performing the attack and provide an evidence of its illegal behavior.

show abstract

“…That was the first time when onions were explicitly used however, not under this name. This scheme was examined in details [13,11] in different adversary models.…”

Section: Anonymous Communicationmentioning

confidence: 99%

“…Determining the number of rounds necessary for the protocol to ensure anonymity in this way is a challenging problem. Some discussion on the topic can be found in [14,1,11].…”

Section: Onion Encodingmentioning

confidence: 99%

Onions Based on Universal Re-encryption – Anonymous Communication Immune Against Repetitive Attack

Gomułkiewicz

Klonowski

Kutyłowski

2005

Information Security Applications

Self Cite

View full text Add to dashboard Cite

show abstract

“…It is often believed that using dummy messages to increase the traffic to the maximal amount and keeping lengths of the onion paths fixed is a proper answer to network dynamics. However, proving resilience to traffic analysis when a fraction of servers and lines is malicious depends on how often the onions are processed through honest servers and links [11]. So dummies do not help that much, as one may hope at the first look.…”

Section: Protocol Featuresmentioning

confidence: 99%

“…Many adversary models have been considered -some of the models allow an adversary to perform only passive traffic analysis based on information obtained from nodes and links under his control [1,11]. Other models [12,13] allow active attacks based on adding or delaying messages by an adversary.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Anonymous Communication with On-line and Off-line Onion Encoding

Klonowski¹,

Kutyłowski²,

Zagórski³

2005

SOFSEM 2005: Theory and Practice of Computer Science

Self Cite

View full text Add to dashboard Cite

Abstract. Anonymous communication with onions requires that a user application determines the whole routing path of an onion. This scenario has certain disadvantages, it might be dangerous in some situations, and it does not fit well to the current layered architecture of dynamic communication networks. We show that applying encoding based on universal re-encryption can solve many of these problems by providing much flexibility -the onions can be created onthe-fly or in advance by different parties.

show abstract

Duo-Onions and Hydra-Onions — Failure and Adversary Resistant Onion Protocols

Iwanik

Klonowski

Kutyłowski

IFIP — The International Federation for Information Processing

Self Cite

View full text Add to dashboard Cite

A serious weakness of the onion protocol, one of the major tools for anonymous communication, is its vulnerability to network failures and/or an adversary trying to break the communication. This is facilitated by the fact that each message is sent through a path of a certain length and a failure in a single point of this path prohibits message delivery. Since the path cannot be too short in order to offer anonymity protection (at least logarithmic in the number of nodes), the failure probability might be quite substantial.The simplest solution to this problem would be to send many onions with the same message. We show that this approach can be optimized with respect to communication overhead and resilience to failures and/or adversary attacks. We propose two protocols: the first one mimics K independent onions with a single onion. The second protocol is designed for the case where an adaptive adversary may destroy communication going out of servers chosen according to the traffic observed by him. In this case a single message flows in a stream of K onions -the main point is that even when the adversary kills some of these onions, the stream quickly recovers to the original bandwidth -again K onions with this message would flow through the network.

show abstract

Provable Unlinkability Against Traffic Analysis Already After $\mathcal{O}(\log(n))~$ Steps!

Cited by 11 publications

References 9 publications

Onions Based on Universal Re-encryption – Anonymous Communication Immune Against Repetitive Attack

Onions Based on Universal Re-encryption – Anonymous Communication Immune Against Repetitive Attack

Anonymous Communication with On-line and Off-line Onion Encoding

Duo-Onions and Hydra-Onions — Failure and Adversary Resistant Onion Protocols

Contact Info

Product

Resources

About