Topology hiding routing based on learning with errors. (25th March 2020)

• Record Type: Journal Article
• Authors: Wan, Shaohua
• Other Names: Wu Chase guestEditor.; Yildirim Tulay guestEditor.; Ivanovic Mirjana guestEditor.; Bellatreche Ladjel guestEditor.; Wyrzykowski Roman guestEditor.; Ciorba Florina M. guestEditor.
• Is Part Of: Concurrency and computation. Volume 34:Number 14(2022)
• Page Start: n/a
• Page End: n/a
• Publication Date: 2020-03-25
• Subjects: learning with errors -- the onion routing -- topology hiding onion routing; Parallel processing (Electronic computers) -- Periodicals; Parallel computers -- Periodicals; 004.35
• DOI: 10.1002/cpe.5740
• Languages: English
• ISSNs: 1532-0626

Abstract

Abstract: The protocol of onion routing constitutes the underpinning of Onion Routing network for anonymous communication. However, since the main idea behind such protocol is to hierarchically peel the IP head and decode each crypted routing address, the topology with regards to path length or long‐term direction cannot be preserved. Owing to topology exposure, lots of attacks such as denial of service and differential flow analysis can be effectively conducted to violate the security of it. Moreover, considering that the path should be constructed by a sender in advance, onion routing is infeasible to be transplanted to ad hoc networks, let alone other defects such as heavy burden about computational complexity and package length. In this paper, a topology‐hiding routing protocol is proposed to address most of the aforementioned problems recurring to homomorphic learning with errors. Security analysis illustrated that nothing but only the IPs of adjacent hops will be revealed to any router. Also the computational complexity on sender side as well as the package length outperforms those of traditional onion routing algorithm in view of comparative simulation.