Sciweavers

2276 search results - page 4 / 456
» Failure of A Mix Network
Sort
View
ASIACRYPT
2009
Springer
14 years 1 months ago
A Modular Design for Hash Functions: Towards Making the Mix-Compress-Mix Approach Practical
The design of cryptographic hash functions is a very complex and failure-prone process. For this reason, this paper puts forward a completely modular and fault-tolerant approach to...
Anja Lehmann, Stefano Tessaro
NETWORKS
2010
13 years 5 months ago
Mixed search number and linear-width of interval and split graphs
We show that the mixed search number and the linear-width of interval graphs and of split graphs can be computed in linear time and in polynomial time, respectively.
Fedor V. Fomin, Pinar Heggernes, Rodica Mihai
CCS
2009
ACM
13 years 11 months ago
The bayesian traffic analysis of mix networks
This work casts the traffic analysis of anonymity systems, and in particular mix networks, in the context of Bayesian inference. A generative probabilistic model of mix network ar...
Carmela Troncoso, George Danezis
P2P
2006
IEEE
120views Communications» more  P2P 2006»
14 years 1 months ago
Risk Driven Semantic P2P Service Retrieval
In this paper, we present a novel approach, named RS2D, to risk driven semantic service query routing in unstructured, so called pure P2P networks. Following the RS2D protocol, ea...
Matthias Klusch, Ulrich Basters
FORTE
1998
13 years 8 months ago
Fault-oriented Test Generation for Multicast Routing Protocol Design
Abstract: We present a new algorithm for automatic test generation for multicast routing. Our algorithm processes a nite state machine (FSM) model of the protocol and uses a mix of...
Ahmed Helmy, Deborah Estrin, Sandeep K. S. Gupta