Result 1 to 20 of 175 total
Verifiable secret sharing in a total of three rounds. (English)
Inf. Process. Lett. 112, No. 22, 856-859 (2012).
1
Self-stabilizing Byzantine asynchronous unison. (English)
J. Parallel Distrib. Comput. 72, No. 7, 917-923 (2012).
2
An agreement protocol to handle Byzantine failures in authenticated hierarchical configuration. (English)
Thilagam, P. Santhi (ed.) et al., Advanced computing, networking and security. International conference, ADCONS 2011, Surathkal, India, December 16‒18, 2011. Revised selected papers. Berlin: Springer (ISBN 978-3-642-29279-8/pbk). Lecture Notes in Computer Science 7135, 612-620 (2012).
3
Formal development of Byzantine immune total order broadcast system using Event-B. (English)
Kannan, Rajkumar (ed.) et al., Data engineering and management. Second international conference, ICDEM 2010, Tiruchirappalli, India, July 29‒31, 2010. Revised selected papers. Berlin: Springer (ISBN 978-3-642-27871-6/pbk). Lecture Notes in Computer Science 6411, 317-324 (2012).
4
Consensus in the presence of mortal Byzantine faulty processes. (English)
Distrib. Comput. 24, No. 6, 299-321 (2012).
5
Adaptive and doubly-expedited one-step consensus in Byzantine asynchronous systems. (English)
Parallel Process. Lett. 21, No. 4, 461-478 (2011).
6
Accurate Byzantine agreement with feedback. (English)
Fernández Anta, Antonio (ed.) et al., Principles of distributed systems. 15th international conference, OPODIS 2011, Toulouse, France, December 13‒16, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-25872-5/pbk). Lecture Notes in Computer Science 7109, 465-480 (2011).
7
Fork-consistent constructions from registers. (English)
Fernández Anta, Antonio (ed.) et al., Principles of distributed systems. 15th international conference, OPODIS 2011, Toulouse, France, December 13‒16, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-25872-5/pbk). Lecture Notes in Computer Science 7109, 283-298 (2011).
8
Error-free multi-valued broadcast and Byzantine agreement with optimal communication complexity. (English)
Fernández Anta, Antonio (ed.) et al., Principles of distributed systems. 15th international conference, OPODIS 2011, Toulouse, France, December 13‒16, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-25872-5/pbk). Lecture Notes in Computer Science 7109, 34-49 (2011).
9
Secure message transmission in asynchronous directed graphs. (English)
Bernstein, Daniel J. (ed.) et al., Progress in cryptology ‒ INDOCRYPT 2011. 12th international conference on cryptology in India, Chennai, India, December 11‒14, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-25577-9/pbk). Lecture Notes in Computer Science 7107, 359-378 (2011).
10
Fault-tolerant algorithms for tick-generation in asynchronous logic: robust pulse generation (extended abstract). (English)
Défago, Xavier (ed.) et al., Stabilization, safety, and security of distributed systems. 13th international symposium, SSS 2011, Grenoble, France, October 10‒12, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-24549-7/pbk). Lecture Notes in Computer Science 6976, 163-177 (2011).
11
An algorithm for implementing BFT registers in distributed systems with bounded churn. (English)
Défago, Xavier (ed.) et al., Stabilization, safety, and security of distributed systems. 13th international symposium, SSS 2011, Grenoble, France, October 10‒12, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-24549-7/pbk). Lecture Notes in Computer Science 6976, 32-46 (2011).
12
A new solution for the Byzantine agreement problem. (English)
J. Parallel Distrib. Comput. 71, No. 10, 1261-1277 (2011).
13
Sleeping on the job: energy-efficient and robust broadcast for radio networks. (English)
Algorithmica 61, No. 3, 518-554 (2011).
14
Byzantine agreement using partial authentication. (English)
Peleg, David (ed.), Distributed computing. 25th international symposium, DISC 2011, Rome, Italy, September 20‒22, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-24099-7/pbk). Lecture Notes in Computer Science 6950, 389-403 (2011).
15
Maximum metric spanning tree made Byzantine tolerant. (English)
Peleg, David (ed.), Distributed computing. 25th international symposium, DISC 2011, Rome, Italy, September 20‒22, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-24099-7/pbk). Lecture Notes in Computer Science 6950, 150-164 (2011).
16
Dependability evaluation of cluster-based distributed systems. (English)
Int. J. Found. Comput. Sci. 22, No. 5, 1123-1142 (2011).
17
Synchronous consensus under hybrid process and link failures. (English)
Theor. Comput. Sci. 412, No. 40, 5602-5630 (2011).
18
Consensus when all processes may be Byzantine for some time. (English)
Theor. Comput. Sci. 412, No. 33, 4260-4272 (2011).
19
Simple and efficient single round almost perfectly secure message transmission tolerating generalized adversary. (English)
Lopez, Javier (ed.) et al., Applied cryptography and network security. 9th international conference, ACNS 2011, Nerja, Spain, June 7‒10, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-21553-7/pbk). Lecture Notes in Computer Science 6715, 292-308 (2011).
20
Result 1 to 20 of 175 total
Start
Contact
Print
General Help
