Efficient and secure identity-based onion routing

Junbeom Hur, Dong Kun Noh

Research output: Contribution to journalArticle

Abstract

Onion routing protocols achieve low-latency anonymous communication on public networks. To date, many onion routing protocols have been proposed, such as Tor network, in order to implement the anony mous network connection in the public networks. Although the previous schemes' multi-pass crypto graphic circuit construction appears satisfactory, their circuit construction protocols have some drawbacks with regard to the efficiency and security. This paper presents a novel identity-based onion routing protocol that allows users to establish anonymous channels over a public network. The proposed scheme eliminates iterative and interactive symmetric key agreement procedures between users and onion routers by embedding a circuit construction into the non-interactive message delivery process. It significantly improves the storage and communication costs required from each user and onion router compared to the previous onion routing protocols, while requiring comparable computation cost to them.

Original languageEnglish
Pages (from-to)93-105
Number of pages13
JournalJournal of Research and Practice in Information Technology
Volume46
Issue number2-3
Publication statusPublished - 2014 Aug 1
Externally publishedYes

Fingerprint

Routing protocols
Routers
Networks (circuits)
Communication
Costs
Network protocols
Onion
Routing

Keywords

  • Anonymity
  • Circuit construction
  • Complexity analysis
  • Encryption
  • Onion-routing

ASJC Scopus subject areas

  • Management Information Systems
  • Software
  • Information Systems
  • Hardware and Architecture
  • Computer Networks and Communications

Cite this

Efficient and secure identity-based onion routing. / Hur, Junbeom; Noh, Dong Kun.

In: Journal of Research and Practice in Information Technology, Vol. 46, No. 2-3, 01.08.2014, p. 93-105.

Research output: Contribution to journalArticle

@article{509e11c590d14e59950c8a88ae5af479,
title = "Efficient and secure identity-based onion routing",
abstract = "Onion routing protocols achieve low-latency anonymous communication on public networks. To date, many onion routing protocols have been proposed, such as Tor network, in order to implement the anony mous network connection in the public networks. Although the previous schemes' multi-pass crypto graphic circuit construction appears satisfactory, their circuit construction protocols have some drawbacks with regard to the efficiency and security. This paper presents a novel identity-based onion routing protocol that allows users to establish anonymous channels over a public network. The proposed scheme eliminates iterative and interactive symmetric key agreement procedures between users and onion routers by embedding a circuit construction into the non-interactive message delivery process. It significantly improves the storage and communication costs required from each user and onion router compared to the previous onion routing protocols, while requiring comparable computation cost to them.",
keywords = "Anonymity, Circuit construction, Complexity analysis, Encryption, Onion-routing",
author = "Junbeom Hur and Noh, {Dong Kun}",
year = "2014",
month = "8",
day = "1",
language = "English",
volume = "46",
pages = "93--105",
journal = "Journal of Research and Practice in Information Technology",
issn = "1443-458X",
publisher = "Australian Computer Society",
number = "2-3",

}

TY - JOUR

T1 - Efficient and secure identity-based onion routing

AU - Hur, Junbeom

AU - Noh, Dong Kun

PY - 2014/8/1

Y1 - 2014/8/1

N2 - Onion routing protocols achieve low-latency anonymous communication on public networks. To date, many onion routing protocols have been proposed, such as Tor network, in order to implement the anony mous network connection in the public networks. Although the previous schemes' multi-pass crypto graphic circuit construction appears satisfactory, their circuit construction protocols have some drawbacks with regard to the efficiency and security. This paper presents a novel identity-based onion routing protocol that allows users to establish anonymous channels over a public network. The proposed scheme eliminates iterative and interactive symmetric key agreement procedures between users and onion routers by embedding a circuit construction into the non-interactive message delivery process. It significantly improves the storage and communication costs required from each user and onion router compared to the previous onion routing protocols, while requiring comparable computation cost to them.

AB - Onion routing protocols achieve low-latency anonymous communication on public networks. To date, many onion routing protocols have been proposed, such as Tor network, in order to implement the anony mous network connection in the public networks. Although the previous schemes' multi-pass crypto graphic circuit construction appears satisfactory, their circuit construction protocols have some drawbacks with regard to the efficiency and security. This paper presents a novel identity-based onion routing protocol that allows users to establish anonymous channels over a public network. The proposed scheme eliminates iterative and interactive symmetric key agreement procedures between users and onion routers by embedding a circuit construction into the non-interactive message delivery process. It significantly improves the storage and communication costs required from each user and onion router compared to the previous onion routing protocols, while requiring comparable computation cost to them.

KW - Anonymity

KW - Circuit construction

KW - Complexity analysis

KW - Encryption

KW - Onion-routing

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

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

M3 - Article

AN - SCOPUS:85017013779

VL - 46

SP - 93

EP - 105

JO - Journal of Research and Practice in Information Technology

JF - Journal of Research and Practice in Information Technology

SN - 1443-458X

IS - 2-3

ER -