Round optimal secure multiparty computation from minimal assumptions

DOI10.1007/978-3-030-64378-2_11OpenAlexW3116603271MaRDI QIDQ2119049

Rafail Ostrovsky, Vipul Goyal, Michele Ciampi, Arka Rai Choudhuri, Abhishek Jain

Publication date: 23 March 2022

Full work available at URL: https://eprint.iacr.org/2019/216

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Computer system organization (68Mxx)

Related Items (23)

On the round complexity of secure quantum computation ⋮ On the round complexity of black-box secure MPC ⋮ Round-optimal and communication-efficient multiparty computation ⋮ Round-optimal multi-party computation with identifiable abort ⋮ A black-box construction of fully-simulatable, round-optimal oblivious transfer from strongly uniform key agreement ⋮ Maliciously-secure MrNISC in the plain model ⋮ Round-optimal oblivious transfer and MPC from computational CSIDH ⋮ Statistical security in two-party computation revisited ⋮ Four-round black-box non-malleable schemes from one-way permutations ⋮ Round-optimal black-box secure computation from two-round malicious OT ⋮ DAG-\( \Sigma \): a DAG-based sigma protocol for relations in CNF ⋮ Knowledge encryption and its applications to simulatable protocols with low round-complexity ⋮ On non-uniform security for black-box non-interactive CCA commitments ⋮ A new approach to efficient non-malleable zero-knowledge ⋮ Round-optimal black-box MPC in the plain model ⋮ Reusable secure computation in the plain model ⋮ List oblivious transfer and applications to round-optimal black-box multiparty coin tossing ⋮ Two-round maliciously secure computation with super-polynomial simulation ⋮ Blockchains enable non-interactive MPC ⋮ Oblivious transfer from trapdoor permutations in minimal rounds ⋮ On the exact round complexity of secure three-party computation ⋮ Minicrypt primitives with algebraic structure and applications ⋮ Towards accountability in CRS generation

This page was built for publication: Round optimal secure multiparty computation from minimal assumptions