Sciweavers

107 search results - page 9 / 22
» On The Shuffle-Exchange Permutation Network
Sort
View
MSWIM
2005
ACM
14 years 1 months ago
Application of synchronous dynamic encryption system in mobile wireless domains
Motivated by the tradeoff between security and efficiency performance parameters that has been imposed on all modern wireless security protocols, we designed a novel security syst...
Hamdy S. Soliman, Mohammed Omari
IPPS
2007
IEEE
14 years 1 months ago
Message Routing and Scheduling in Optical Multistage Networks using Bayesian Inference method on AI algorithms
Optical Multistage Interconnection Networks (MINs) suffer from optical-loss during switching and crosstalk problem in the switches. The crosstalk problem is solved by routing mess...
Ajay K. Katangur, Somasheker Akkaladevi
SP
2006
IEEE
14 years 1 months ago
Deterring Voluntary Trace Disclosure in Re-encryption Mix Networks
An all too real threat to the privacy offered by a mix network is that individual mix administrators may volunteer partial tracing information to a coercer. While this threat can ...
Philippe Golle, XiaoFeng Wang, Markus Jakobsson, A...
FOCS
2009
IEEE
14 years 2 months ago
2-Source Extractors under Computational Assumptions and Cryptography with Defective Randomness
Abstract— We show how to efficiently extract truly random bits from two independent sources of linear min-entropy, under a computational assumption. The assumption we rely on is...
Yael Tauman Kalai, Xin Li, Anup Rao
ESA
1998
Springer
95views Algorithms» more  ESA 1998»
13 years 11 months ago
New Bounds for Oblivious Mesh Routing
We give two, new upper bounds for oblivious permutation routing on the mesh networks: Let N be the total number of processors in each mesh. One is an O(N0.75 ) algorithm on the tw...
Kazuo Iwama, Yahiko Kambayashi, Eiji Miyano