The loosely-synchronous transfer mode
Abstract
References
Index Terms
- The loosely-synchronous transfer mode
Recommendations
Computationally Secure Oblivious Transfer
We describe new computationally secure protocols of 1-out-of-N oblivious transfer, k-out-of-N oblivious transfer, and oblivious transfer with adaptive queries. The protocols are very efficient compared with solutions based on generic two-party ...
Perfectly-Secure Synchronous MPC With Asynchronous Fallback Guarantees
Secure <italic>multi-party computation</italic> (MPC) is a fundamental problem in secure distributed computing. An MPC protocol allows a set of <inline-formula> <tex-math notation="LaTeX">$n$ </tex-math></inline-formula> mutually distrusting parties to ...
On the theoretical gap between synchronous and asynchronous MPC protocols
PODC '10: Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computingMultiparty computation (MPC) protocols among n parties secure against t active faults are known to exist if and only if
- t < n/2, when the channels are synchronous, and
- t < n/3, when the channels are asynchronous, respectively.
In this work we analyze ...
Comments
Information & Contributors
Information
Published In
Sponsors
- Industry Canada
- Natural Sciences and Engineering Research Council
- IBM Canada: IBM Canada
- NRC: National Research Council - Canada
Publisher
IBM Press
Publication History
Qualifiers
- Article
Acceptance Rates
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 196Total Downloads
- Downloads (Last 12 months)35
- Downloads (Last 6 weeks)12
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in