Detailed Information

Cited 0 time in webofscience Cited 0 time in scopus
Metadata Downloads

Efficient and secure identity-based onion routing

Full metadata record
DC Field Value Language
dc.contributor.authorHur, J.-
dc.contributor.authorNoh, D.K.-
dc.date.accessioned2023-03-08T20:30:34Z-
dc.date.available2023-03-08T20:30:34Z-
dc.date.issued2014-08-
dc.identifier.issn1443-458X-
dc.identifier.urihttps://scholarworks.bwise.kr/cau/handle/2019.sw.cau/64802-
dc.description.abstractOnion 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. Copyright © 2014, Australian Computer Society Inc.-
dc.format.extent13-
dc.language영어-
dc.language.isoENG-
dc.publisherAustralian Computer Society-
dc.titleEfficient and secure identity-based onion routing-
dc.typeArticle-
dc.identifier.bibliographicCitationJournal of Research and Practice in Information Technology, v.46, no.2-3, pp 93 - 105-
dc.description.isOpenAccessN-
dc.identifier.scopusid2-s2.0-85017013779-
dc.citation.endPage105-
dc.citation.number2-3-
dc.citation.startPage93-
dc.citation.titleJournal of Research and Practice in Information Technology-
dc.citation.volume46-
dc.type.docTypeArticle-
dc.publisher.location호주-
dc.subject.keywordAuthorAnonymity-
dc.subject.keywordAuthorCircuit construction-
dc.subject.keywordAuthorComplexity analysis-
dc.subject.keywordAuthorEncryption-
dc.subject.keywordAuthorOnion-routing-
dc.subject.keywordPlusCryptography-
dc.subject.keywordPlusElectric network analysis-
dc.subject.keywordPlusInternet protocols-
dc.subject.keywordPlusNetwork security-
dc.subject.keywordPlusRouters-
dc.subject.keywordPlusRouting protocols-
dc.subject.keywordPlusAnonymity-
dc.subject.keywordPlusAnonymous communication-
dc.subject.keywordPlusCircuit construction-
dc.subject.keywordPlusCommunication cost-
dc.subject.keywordPlusComplexity analysis-
dc.subject.keywordPlusInteractive message-
dc.subject.keywordPlusNetwork connection-
dc.subject.keywordPlusOnion routing-
dc.subject.keywordPlusNetwork routing-
dc.description.journalRegisteredClassscie-
dc.description.journalRegisteredClassscopus-
Files in This Item
There are no files associated with this item.
Appears in
Collections
College of Software > School of Computer Science and Engineering > 1. Journal Articles

qrcode

Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.

Altmetrics

Total Views & Downloads

BROWSE