NDLI: Provable Unlinkability Against Traffic Analysis with Low Message Overhead

Content Provider	Springer Nature Link
Author	Berman, Ron Fiat, Amos Gomułkiewicz, Marcin Klowski, Marek Kutyłowski, Mirosław Levinboim, Tomer Ta Shma, Amn
Copyright Year	2013
Abstract	Rackoff and Simon proved that a variant of Chaum’s protocol for anonymous communication, later developed as the Onion Routing Protocol, is unlinkable against a passive adversary that controls all communication links and most of the nodes in a communication system. A major drawback of their analysis is that the protocol is secure only if (almost) all nodes participate at all times. That is, even if only n≪N nodes wish to send messages, all N nodes have to participate in the protocol at all times. This suggests necessity of sending dummy messages and a high message overhead.Our first contribution is showing that this is unnecessary. We relax the adversary model and assume that the adversary only controls a certain fraction of the communication links in the communication network. We think this is a realistic adversary model. For this adversary model we show that a low message overhead variant of Chaum’s protocol is provably secure.Furthermore, all previous security proofs assumed the a priori distribution on the messages is uniform. We feel this assumption is unrealistic. The analysis we give holds for any a priori information on the communication distribution. We achieve that by combining Markov chain techniques together with information theory tools in a simple and elegant way.
Starting Page	623
Ending Page	640
Page Count	18
File Format	PDF
ISSN	09332790
Journal	Journal of Cryptology
Volume Number	28
Issue Number	3
e-ISSN	14321378
Language	English
Publisher	Springer US
Publisher Date	2013-12-14
Publisher Place	New York
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Mix protocol Traffic analysis Mixing time Markov Chain Unlinkability Coding and Information Theory Computational Mathematics and Numerical Analysis Combinatorics Probability Theory and Stochastic Processes Communications Engineering, Networks
Content Type	Text
Resource Type	Article
Subject	Applied Mathematics Computer Science Applications Software

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

The TLS Handshake Protocol: A Modular Analysis

Another Look at "Provable Security"

Provable Unlinkability Against Traffic Analysis Already After O(log(n)) steps! (2004)

Provable unlinkability against traffic analysis (2004).

Provable Unlinkability against Traffic Analysis (2004)

Partial Key Recovery Attack Against RMAC

Bucket Hashing and Its Application to Fast Message Authentication

Securing Threshold Cryptosystems against Chosen Ciphertext Attack

Elliptic Curves with Low Embedding Degree

Provable Unlinkability Against Traffic Analysis with Low Message Overhead

Similar Documents

The TLS Handshake Protocol: A Modular Analysis

Another Look at "Provable Security"

Provable Unlinkability Against Traffic Analysis Already After O(log(n)) steps! (2004)

Provable unlinkability against traffic analysis (2004).

Provable Unlinkability against Traffic Analysis (2004)

Partial Key Recovery Attack Against RMAC

Bucket Hashing and Its Application to Fast Message Authentication

Securing Threshold Cryptosystems against Chosen Ciphertext Attack

Elliptic Curves with Low Embedding Degree

Provable Unlinkability Against Traffic Analysis with Low Message Overhead