Filters








21,554 Hits in 5.8 sec

The Cost of Fault Tolerance in Multi-Party Communication Complexity

Binbin Chen, Haifeng Yu, Yuda Zhao, Phillip B. Gibbons
2014 Journal of the ACM  
gap between the non-fault-tolerant and fault-tolerant communication complexity of SUM.  ...  Multi-party communication complexity involves distributed computation of a function over inputs held by multiple distributed players.  ...  supported by the research grant MOE2011-T2-2-042 "Fault-tolerant Communication Complexity in Wireless Networks" from Singapore Ministry of Education Academic Research Fund Tier-2, and partly supported  ... 
doi:10.1145/2597633 fatcat:ki34phogbnc57pcl25epdxzp54

The cost of fault tolerance in multi-party communication complexity

Binbin Chen, Haifeng Yu, Yuda Zhao, Phillip B. Gibbons
2012 Proceedings of the 2012 ACM symposium on Principles of distributed computing - PODC '12  
gap between the non-fault-tolerant and fault-tolerant communication complexity of SUM.  ...  Multi-party communication complexity involves distributed computation of a function over inputs held by multiple distributed players.  ...  supported by the research grant MOE2011-T2-2-042 "Fault-tolerant Communication Complexity in Wireless Networks" from Singapore Ministry of Education Academic Research Fund Tier-2, and partly supported  ... 
doi:10.1145/2332432.2332442 dblp:conf/podc/ChenYZG12 fatcat:4y3bi6lpobewhniwjjz3x6bktu

Efficient Secure Multi-party Computation [chapter]

Martin Hirt, Ueli Maurer, Bartosz Przydatek
2000 Lecture Notes in Computer Science  
Since the introduction of secure multi-party computation, all proposed protocols that provide security against cheating players suffer from very high communication complexities.  ...  In this paper, we propose a perfectly secure multi-party protocol which requires communicating O(n 3 ) field elements per multiplication.  ...  When analyzing the communication complexity of a multi-party protocol, one must also include the communication costs for simulating the broadcast channels.  ... 
doi:10.1007/3-540-44448-3_12 fatcat:6cnw5u2bd5fhrg4v6wyicyy3u4

Shuffle to Baffle: Towards Scalable Protocols for Secure Multi-party Shuffling

Mahnush Movahedi, Jared Saia, Mahdi Zamani
2015 2015 IEEE 35th International Conference on Distributed Computing Systems  
For example, for one million parties, when compared to the state of the art, our protocol reduces the communication and computation costs by at least three orders of magnitude and slightly decreases the  ...  In secure multi-party shuffling, multiple parties, each holding an input, want to agree on a random permutation of their inputs while keeping the permutation secret.  ...  Simulations of our protocol suggest that it compares favorably with the current state of the art in terms of communication cost, computation cost, and the number of communication rounds.  ... 
doi:10.1109/icdcs.2015.116 dblp:conf/icdcs/MovahediSZ15 fatcat:v2oseqqy3vdxdgeqd3h4lptcjy

Performance Analysis Of Cluster Based Dual Tired Network Model With Intk Security Scheme In A Wireless Sensor Network

D. Satish Kumar, S. Karthik
2014 Zenodo  
A dual tiered network model is designed to overcome the problem of energy alert and fault tolerance. This model minimizes the delay time and overcome failure of links.  ...  Clustering efficiency, level of protections, the time complexity is some of the parameters of INTK scheme that were analyzed.  ...  A stateless fault tolerance method in wireless sensor network makes certain low message complexity and low energy consumption in terms of communication cost. III.  ... 
doi:10.5281/zenodo.1094527 fatcat:rkkra7qydzc4rk36qlzyzelez4

Improved Extension Protocols for Byzantine Broadcast and Agreement

Kartik Nayak, Ling Ren, Elaine Shi, Nitin H. Vaidya, Zhuolun Xiang, Hagit Attiya
2020 International Symposium on Distributed Computing  
First, they achieve the best-possible communication complexity of Θ(nl) for wider ranges of input sizes compared to prior results.  ...  In this paper, we study extension protocols of BB and BA, i.e., protocols that solve BB/BA with long inputs of l bits using lower costs than l single-bit instances.  ...  In Table 1 , n is the number of parties, t is the maximum number of Byzantine parties, l is the length of the input, A(l) is the communication cost of l-bit BA oracle, and B(l) is the communication cost  ... 
doi:10.4230/lipics.disc.2020.28 dblp:conf/wdag/Nayak0SVX20 fatcat:7y5chntspfbkpfmvygtq2zecqa

Page 5632 of Mathematical Reviews Vol. , Issue 2004g [page]

2004 Mathematical Reviews  
Summary: “We establish worst-case and average-case lower bounds on the trade-off between the time and bit complexity for two- party communication in synchronous networks.  ...  Failures of links and nodes in an interconnection network are inevitable. Hence, in this paper, we consider the hybrid fault- tolerant capability of the crossed cube.  ... 

Swarm SLAM: Challenges and Perspectives

Miquel Kegeleirs, Giorgio Grisetti, Mauro Birattari
2021 Frontiers in Robotics and AI  
These characteristics allow robot swarms to achieve scalability, flexibility and fault tolerance, properties that are especially valuable in the context of simultaneous localization and mapping (SLAM),  ...  Swarm SLAM is a promising approach to SLAM as it could leverage the decentralized nature of a robot swarm and achieve scalable, flexible and fault-tolerant exploration and mapping.  ...  AUTHOR CONTRIBUTIONS The paper was drafted by MK and edited by all the authors. The research was directed by MB.  ... 
doi:10.3389/frobt.2021.618268 pmid:33816567 pmcid:PMC8010569 fatcat:zvwjpd3opncgfhgntl4v5ro664

Robustness for Free in Unconditional Multi-party Computation [chapter]

Martin Hirt, Ueli Maurer
2001 Lecture Notes in Computer Science  
Recently, Hirt, Maurer, and Przydatek [HMP00] proposed a new protocol for perfectly secure multi-party computation with considerably better communication complexity than previous protocols: A set of n  ...  The computation complexity of the new protocol is on the order of the communication complexity and hence not relevant. The achieved communication complexity of O(mn 2 ) appears to be optimal.  ...  to achieve a multi-party protocol which has both low communication complexity and very low round complexity.  ... 
doi:10.1007/3-540-44647-8_6 fatcat:ooog6g3kujb3dopway6abdgx7y

Self-tallying Elections and Perfect Ballot Secrecy [chapter]

Aggelos Kiayias, Moti Yung
2002 Lecture Notes in Computer Science  
fault tolerant" mechanism.  ...  Additionally, the mechanism is secrecy-preserving and "adaptive" in the sense that its cost is proportional to the number of faulty participants.  ...  Tallying is optimal as it takes 3n steps, without the participation of the voters. Corrective fault tolerance costs O(b) group operations for a participant, where b is the number of faults.  ... 
doi:10.1007/3-540-45664-3_10 fatcat:rruhqfrjcbatvmh377ena462cu

EXA2PRO programming environment

Dimitrios Soudris, Raymond Namyst, Dirk Pleiter, Georgi Gaydadjiev, Tobias Becker, Matthieu Haefele, Lazaros Papadopoulos, Christoph W. Kessler, Dionysios D. Kehagias, Athanasios Papadopoulos, Panos Seferlis, Alexander Chatzigeorgiou (+2 others)
2018 Proceedings of the 18th International Conference on Embedded Computer Systems Architectures, Modeling, and Simulation - SAMOS '18  
HAL is a multi-disciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not.  ...  The documents may come from teaching and research institutions in France or abroad, or from public or private research centers.  ...  ACKNOWLEDGEMENT This work has received funding from the European Union's Horizon 2020 research and innovation programme EXA2PRO under grant agreement No 801015 (www.exa2pro.eu).  ... 
doi:10.1145/3229631.3239369 dblp:conf/samos/SoudrisPKKPSCAT18 fatcat:sbqs5qyhgvgtdghb5sf2no6y3q

Improved Extension Protocols for Byzantine Broadcast and Agreement [article]

Kartik Nayak, Ling Ren, Elaine Shi, Nitin H. Vaidya, Zhuolun Xiang
2020 arXiv   pre-print
First, they achieve the best-possible communication complexity of Θ(nl) for wider ranges of input sizes compared to prior results.  ...  In this paper, we study extension protocols of BB and BA, i.e., protocols that solve BB/BA with long inputs of l bits using lower costs than l single-bit instances.  ...  In Table 1 , n is the number of parties, t is the maximum number of Byzantine parties, l is the length of the input, A(l) is the communication cost of l-bit BA oracle, and B(l) is the communication cost  ... 
arXiv:2002.11321v3 fatcat:hln2vpokn5h7bahv5bdsji2ep4

Introduction to the SELMAS 2006

Ricardo Choren, Ho-fung Leung, Alessandro Garcia, Carlos Lucena, Holger Giese, Alexander Romanovsky
2006 Proceedings of the 2006 international workshop on Software engineering for large-scale multi-agent systems - SELMAS '06  
This paper is intended to introduce the Fifth International Workshop on Software Engineering for Large-Scale Multi-Agent Systems (SELMAS 2006) held in Shanghai, China, May 22-23, 2006, as part of the International  ...  The main purpose of this workshop is to set up working groups that will address methodological aspects involved in developing practices for building dependable multiagent systems.  ...  In MAS, every software agent assumes the responsibility to provide some functionality, making the system more complex. The cost and the consequences of a MAS failing can be catastrophic.  ... 
doi:10.1145/1138063.1138064 fatcat:bxzxxngduffh3mcaliwno2tqpi

Methodical Review on Various Fault Tolerant and Monitoring Mechanisms to improve Reliability on Cloud Environment

P. Padmakumari, A. Umamakeswari
2015 Indian Journal of Science and Technology  
Methods/Statistical Analysis: Fault Tolerance (FT) facilitates the process or the component to work smoothly even though in the occurrence of failure.  ...  Reviewing the potential of FT and monitoring services is to make out the technique that serves in certain purpose. Fault tolerance systems are important for both cloud provider and cloud customer.  ...  Execution of scientific workflow is in the form of data flow and dependency, so the user has to multi step the complex computation tasks.  ... 
doi:10.17485/ijst/2015/v8i35/80130 fatcat:m4esh6jsg5fonjzfecd3qaug2e

Fault Tolerance In Wireless Sensor Networks – A Survey

B. R. Tapas Bapu, K. Thanigaivelu, A. Rajkumar
2015 Zenodo  
Therefore, fault tolerance is one of the critical issues in WSNs. We study how fault tolerance is addressed in different applications of WSNs.  ...  Fault tolerant routing is a critical task for sensor networks operating in dynamic environments.  ...  The cost of sensor nodes is similarly variable, ranging from hundreds of dollars to a few pennies, depending on the size of the sensor network and the complexity required for individual sensor nodes.  ... 
doi:10.5281/zenodo.1338228 fatcat:rdchpkuppndpxnqcgqwsq6rwri
« Previous Showing results 1 — 15 out of 21,554 results