Abstract: We revisit the problem of universally composable (UC) secure multiparty computation in the stateless hardware token model. We construct a three ...
Nov 22, 2019 · We revisit the problem of universally composable (UC) secure multiparty computation in the stateless hardware token model.
We construct a three round multi-party computation protocol for general functions based on one-way functions where each party sends two tokens to every other ...
UC-Secure Multiparty Computation from One-Way Functions Using Stateless Tokens ... security using a single stateful tamper-proof hardware token. In: TCC ...
UC-Secure Multiparty Computation from One-Way Functions Using Stateless Tokens. S. Badrinarayanan, A. Jain, R. Ostrovsky, and I. Visconti.
UC-Secure Multiparty Computation from One-Way Functions using Stateless Tokens Saikrishna Badrinarayanan, Abhishek Jain, Rafail Ostrovsky and Ivan Visconti
(Efficient) Universally Composable Oblivious Transfer Using a Minimal ...
link.springer.com › chapter
As our main result, we show an efficient oblivious-transfer (OT) protocol in which two parties each create and exchange a single, stateless token and can then ...
We present and explore a model of stateless and self-stabilizing distributed computation, inspired by real-world applications such as routing on today's ...
People also ask
How does secure multiparty computation work?
What is an example of a multi-party computation?
Nov 10, 2017 · We capture the malicious behavior of token manufacturers by allowing the adversary to corrupt the tokens of honest players at the time of their ...
This work proposes the first formalization of tamper-proof hardware as an untrusted global setup assumption, and constructs protocols for both UC-secure ...