C-Mix: A lightweight anonymous routing approach

Vinayak Kandiah, Dijiang Huang, Harsh Kapoor

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

Low latency mix networks such as onion routing (Tor), heavily utilize cryptographic operations for transmitting a message to the receiver resulting in substantial computational and communication overhead. To address the performance and security issues of low latency mix networks, we propose a novel anonymous routing scheme called C-Mix. Its design principles are inspired by network coding techniques and the properties of polynomial interpolation. Based on our security analysis and performance evaluations, C-Mix achieves same level of anonymity with comparable computation overhead in comparison to traditional low latency mix networks.

Original languageEnglish (US)
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages294-308
Number of pages15
Volume5284 LNCS
DOIs
StatePublished - 2008
Event10th International Workshop on Information Hiding, IH 2008 - Santa Barbara, CA, United States
Duration: May 19 2008May 21 2008

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume5284 LNCS
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other10th International Workshop on Information Hiding, IH 2008
CountryUnited States
CitySanta Barbara, CA
Period5/19/085/21/08

Fingerprint

Network coding
Latency
Interpolation
Routing
Polynomials
Communication
Onion
Security Analysis
Polynomial Interpolation
Network Coding
Anonymity
Performance Evaluation
Receiver

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Kandiah, V., Huang, D., & Kapoor, H. (2008). C-Mix: A lightweight anonymous routing approach. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5284 LNCS, pp. 294-308). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5284 LNCS). https://doi.org/10.1007/978-3-540-88961-8-21

C-Mix : A lightweight anonymous routing approach. / Kandiah, Vinayak; Huang, Dijiang; Kapoor, Harsh.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 5284 LNCS 2008. p. 294-308 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5284 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Kandiah, V, Huang, D & Kapoor, H 2008, C-Mix: A lightweight anonymous routing approach. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 5284 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 5284 LNCS, pp. 294-308, 10th International Workshop on Information Hiding, IH 2008, Santa Barbara, CA, United States, 5/19/08. https://doi.org/10.1007/978-3-540-88961-8-21
Kandiah V, Huang D, Kapoor H. C-Mix: A lightweight anonymous routing approach. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 5284 LNCS. 2008. p. 294-308. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-540-88961-8-21
Kandiah, Vinayak ; Huang, Dijiang ; Kapoor, Harsh. / C-Mix : A lightweight anonymous routing approach. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 5284 LNCS 2008. pp. 294-308 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{bb56385081d3424b89217e7820bd0a41,
title = "C-Mix: A lightweight anonymous routing approach",
abstract = "Low latency mix networks such as onion routing (Tor), heavily utilize cryptographic operations for transmitting a message to the receiver resulting in substantial computational and communication overhead. To address the performance and security issues of low latency mix networks, we propose a novel anonymous routing scheme called C-Mix. Its design principles are inspired by network coding techniques and the properties of polynomial interpolation. Based on our security analysis and performance evaluations, C-Mix achieves same level of anonymity with comparable computation overhead in comparison to traditional low latency mix networks.",
author = "Vinayak Kandiah and Dijiang Huang and Harsh Kapoor",
year = "2008",
doi = "10.1007/978-3-540-88961-8-21",
language = "English (US)",
isbn = "3540889604",
volume = "5284 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "294--308",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - GEN

T1 - C-Mix

T2 - A lightweight anonymous routing approach

AU - Kandiah, Vinayak

AU - Huang, Dijiang

AU - Kapoor, Harsh

PY - 2008

Y1 - 2008

N2 - Low latency mix networks such as onion routing (Tor), heavily utilize cryptographic operations for transmitting a message to the receiver resulting in substantial computational and communication overhead. To address the performance and security issues of low latency mix networks, we propose a novel anonymous routing scheme called C-Mix. Its design principles are inspired by network coding techniques and the properties of polynomial interpolation. Based on our security analysis and performance evaluations, C-Mix achieves same level of anonymity with comparable computation overhead in comparison to traditional low latency mix networks.

AB - Low latency mix networks such as onion routing (Tor), heavily utilize cryptographic operations for transmitting a message to the receiver resulting in substantial computational and communication overhead. To address the performance and security issues of low latency mix networks, we propose a novel anonymous routing scheme called C-Mix. Its design principles are inspired by network coding techniques and the properties of polynomial interpolation. Based on our security analysis and performance evaluations, C-Mix achieves same level of anonymity with comparable computation overhead in comparison to traditional low latency mix networks.

UR - http://www.scopus.com/inward/record.url?scp=56749173463&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=56749173463&partnerID=8YFLogxK

U2 - 10.1007/978-3-540-88961-8-21

DO - 10.1007/978-3-540-88961-8-21

M3 - Conference contribution

AN - SCOPUS:56749173463

SN - 3540889604

SN - 9783540889601

VL - 5284 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 294

EP - 308

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

ER -