C-Mix: A lightweight anonymous routing approach

Vinayak Kandiah; Dijiang Huang; Harsh Kapoor

doi:10.1007/978-3-540-88961-8_21

C-Mix: A lightweight anonymous routing approach

Vinayak Kandiah
, Dijiang Huang
, Harsh Kapoor

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

1 Scopus citations

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 language	English (US)
Title of host publication	Information Hiding - 10th International Workshop, IH 2008, Revised Selected Papers
Publisher	Springer Verlag
Pages	294-308
Number of pages	15
ISBN (Print)	3540889604, 9783540889601
DOIs	https://doi.org/10.1007/978-3-540-88961-8_21
State	Published - 2008
Event	10th International Workshop on Information Hiding, IH 2008 - Santa Barbara, CA, United States Duration: May 19 2008 → May 21 2008

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	5284 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Other

Other	10th International Workshop on Information Hiding, IH 2008
Country/Territory	United States
City	Santa Barbara, CA
Period	5/19/08 → 5/21/08

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/978-3-540-88961-8_21

Cite this

Kandiah, V., Huang, D., & Kapoor, H. (2008). C-Mix: A lightweight anonymous routing approach. In Information Hiding - 10th International Workshop, IH 2008, Revised Selected Papers (pp. 294-308). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5284 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-540-88961-8_21

C-Mix: A lightweight anonymous routing approach. / Kandiah, Vinayak; Huang, Dijiang; Kapoor, Harsh.
Information Hiding - 10th International Workshop, IH 2008, Revised Selected Papers. Springer Verlag, 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 proceeding › Conference contribution

Kandiah, V, Huang, D & Kapoor, H 2008, C-Mix: A lightweight anonymous routing approach. in Information Hiding - 10th International Workshop, IH 2008, Revised Selected Papers. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 5284 LNCS, Springer Verlag, 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 Information Hiding - 10th International Workshop, IH 2008, Revised Selected Papers. Springer Verlag. 2008. p. 294-308. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-540-88961-8_21

@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",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "294--308",

booktitle = "Information Hiding - 10th International Workshop, IH 2008, Revised Selected Papers",

note = "10th International Workshop on Information Hiding, IH 2008 ; Conference date: 19-05-2008 Through 21-05-2008",

}

TY - GEN

T1 - C-Mix

T2 - 10th International Workshop on Information Hiding, IH 2008

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 - https://www.scopus.com/pages/publications/56749173463

UR - https://www.scopus.com/pages/publications/56749173463#tab=citedBy

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

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

SP - 294

EP - 308

BT - Information Hiding - 10th International Workshop, IH 2008, Revised Selected Papers

PB - Springer Verlag

Y2 - 19 May 2008 through 21 May 2008

ER -

C-Mix: A lightweight anonymous routing approach

Abstract

Publication series

Other

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this