Fault tolerant anonymous channel

13 years 8 months ago

Download gnunet.org

Previous anonymous channels, called MIX nets, do not work if one center stops. This paper shows new anonymous channels which allow less than a half of faulty centers. A fault tolerant multivalued election scheme is obtained automatically. A very e cient ZKIP for the centers is also presented.

Wakaha Ogata, Kaoru Kurosawa, Kazue Sako, Kazunori

Real-time Traffic

Anonymous Channels | Communications | Faulty Centers | ICICS 1997 | Tolerant Multivalued Election |

claim paper

» FaultTolerant Wormhole Routing in 2D Meshes

» A Distributed Real Time Coordination Protocol

» FaultTolerant Wormhole Routing Algorithms in Meshes in the Presence of Concave Faults

» FaultTolerant Routing Algorithm for Meshes without Using Virtual Channels

» Adaptive FaultTolerant Wormhole Routing Algorithms for Hypercube and Mesh Interconnection

» FaultTolerant DistributedSharedMemory on a BroadcastBased Interconnection Network

» Performance Analysis of Anonymous Communication Channels Provided by Tor

» Fault tolerant machine learning for nanoscale cognitive radio

Post Info
More Details (n/a)

Added	08 Aug 2010
Updated	08 Aug 2010
Type	Conference
Year	1997
Where	ICICS
Authors	Wakaha Ogata, Kaoru Kurosawa, Kazue Sako, Kazunori Takatani

Comments (0)

Sciweavers

Fault tolerant anonymous channel

Anonymous Channels | Communications | Faulty Centers | ICICS 1997 | Tolerant Multivalued Election |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers