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 party. Relaxing to the two-party case, we also construct a two round protocol based on one-way functions where each party sends a single token to the other party, and at the end of the protocol, both parties learn the output.One of the key components in the above constructions is a new two-round oblivious transfer protocol based on one-way functions using only one token, which can be reused an unbounded polynomial number of times. All prior constructions required either stronger complexity assumptions, or larger number of rounds, or a larger number of tokens.
UC-Secure Multiparty Computation from One-Way Functions Using Stateless Tokens / Badrinarayanan, S.; Jain, A.; Ostrovsky, R.; Visconti, I.. - 11922:(2019), pp. 577-605. (Intervento presentato al convegno 25th Annual International Conference on the Theory and Applications of Cryptology and Information Security, ASIACRYPT 2019 tenutosi a jpn) [10.1007/978-3-030-34621-8_21].
UC-Secure Multiparty Computation from One-Way Functions Using Stateless Tokens
Visconti I.
2019
Abstract
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 party. Relaxing to the two-party case, we also construct a two round protocol based on one-way functions where each party sends a single token to the other party, and at the end of the protocol, both parties learn the output.One of the key components in the above constructions is a new two-round oblivious transfer protocol based on one-way functions using only one token, which can be reused an unbounded polynomial number of times. All prior constructions required either stronger complexity assumptions, or larger number of rounds, or a larger number of tokens.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
