Abstract
We investigate the problem of multiparty computations in a fully connected, asynchronous network of n players, in which up to t Byzantine faults may occur. It was shown in [BCG93] that secure error-less multiparty computation is possible in this setting if and only if t
Cite
CITATION STYLE
APA
Ben-Or, M., Kelmer, B., & Rabin, T. (1994). Asynchronous secure computations with optimal resilience. In Proceedings of the Annual ACM Symposium on Principles of Distributed Computing (Vol. Part F129432, pp. 183–192). Association for Computing Machinery. https://doi.org/10.1145/197917.198088
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free