Anonymous permutation routing

P Bunn, E Kushilevitz, R Ostrovsky - Theory of Cryptography Conference, 2023 - Springer
routing network, but then to administer PIR at each node to keep each routing decision
hidden, thereby allowing for the anonymity … central router simulates a virtual permutation-routing

An energy-efficient permutation routing protocol for single-hop radio networks

A Datta, AY Zomaya - IEEE Transactions on Parallel and …, 2004 - ieeexplore.ieee.org
… An instance of the permutation routing problem involves p … is to route all the items to their
destinations while consuming as little energy as possible. We show that the permutation routing

Energy-efficient permutation routing in radio networks

K Nakano, S Olariu, AY Zomaya - IEEE Transactions on …, 2001 - ieeexplore.ieee.org
… An instance of the permutation routing problem involves p stations of an RN, each storing n/…
station to which the item must be routed. The goal is to route all the items to their destinations …

Non-interactive anonymous router

E Shi, K Wu - Annual International Conference on the Theory and …, 2021 - Springer
… At a very high level, we want that the untrusted router learns no information about the routing
permutation \(\pi \) as well as the messages exchanged. Moreover, the scheme should offer …

A fault-tolerant protocol for energy-efficient permutation routing in wireless networks

A Datta - IEEE Transactions on Computers, 2005 - ieeexplore.ieee.org
… The task is to route the packets to their correct destinations. We consider the permutation
routing … We design a protocol for permutation routing on a WN which is both energy efficient and …

Fast self-routing permutation switching on an asymptotically minimum cost network

CY Jan, AY Oruç - IEEE Transactions on Computers, 1993 - ieeexplore.ieee.org
… ) routing algorithm that gives O(k lg/sup 3/ n) routing … of permutation switching with O(n lg
n) cost and O(lg n) routing time are the AKS sorting network and E. Upfal's (1989) packet routing

Permutation routing in double-loop networks: design and empirical evaluation

T Dobravec, B Robič, J Žerovnik - Journal of Systems Architecture, 2003 - Elsevier
… known permutation routing algorithm takes, on average, 1.98ℓ routing steps (and 2ℓ routing
… , we design four new static permutation routing algorithms with gradually improved average-…

Routing permutations with link-disjoint and node-disjoint paths in a class of self-routable interconnects

Y Yang, J Wang - IEEE Transactions on Parallel and …, 2003 - ieeexplore.ieee.org
… [1] for general permutation routing. As can be seen, our implementation of permutation routing
is … The authors also thank the anonymous referees of this article for their comments and …

[图书][B] Anonymous communication networks: Protecting privacy on the web

K Peng - 2014 - books.google.com
… The output of every routing node is shuffled by the next routing node. In this way, the … all
the routing nodes in the mix network. If at least one routing node conceals this permutation, the …

[PDF][PDF] An efficient permutation routing protocol in multi-hop wireless sensor networks

H Lakhlef, AB Bomgni, JF Myoupo - International Journal of …, 2011 - academia.edu
… In this paper we are interested in the permutation routing problem on multi-hop WSN(p, n).
We derive a … Thanks to the anonymous referee for his valuable comments and suggestions. …