Sciweavers

148 search results - page 22 / 30
» Self-stabilization of Byzantine Protocols
Sort
View
ASIACRYPT
1999
Springer
14 years 2 months ago
Approximation Hardness and Secure Communication in Broadcast Channels
Problems of secure communication and computation have been studied extensively in network models. Goldreich, Goldwasser, and Linial, Franklin and Yung, and Franklin and Wright have...
Yvo Desmedt, Yongge Wang
SP
2002
IEEE
121views Security Privacy» more  SP 2002»
13 years 9 months ago
Intrusion-Tolerant Enclaves
Despite our best efforts, any sufficiently complex computer system has vulnerabilities. It is safe to assume that such vulnerabilities can be exploited by attackers who will be ab...
Bruno Dutertre, Valentin Crettaz, Victoria Stavrid...
FOCS
2006
IEEE
14 years 3 months ago
Towards Secure and Scalable Computation in Peer-to-Peer Networks
We consider the problems of Byzantine Agreement and Leader Election, where a constant fraction b < 1/3 of processors are controlled by a malicious adversary. The first problem...
Valerie King, Jared Saia, Vishal Sanwalani, Erik V...
ICALP
2005
Springer
14 years 3 months ago
Optimistic Asynchronous Atomic Broadcast
This paper presents a new protocol for atomic broadcast in an asynchronous network with a maximal number of Byzantine failures. It guarantees both safety and liveness without maki...
Klaus Kursawe, Victor Shoup
JOC
2007
93views more  JOC 2007»
13 years 9 months ago
Robust Information-Theoretic Private Information Retrieval
A Private Information Retrieval (PIR) protocol allows a user to retrieve a data item of its choice from a database, such that the servers storing the database do not gain informat...
Amos Beimel, Yoav Stahl