A new approach to round-optimal secure multiparty computation

DOI10.1007/978-3-319-63688-7_16MaRDI QIDQ1675737zbMATH OpenOpenAlexFDO

Authors Arka Rai Choudhuri, Abhishek Jain, Prabhanjan Ananth

Publication date 3 November 2017

Full work available at URL https://doi.org/10.1007/978-3-319-63688-7_16

zbMATH Keywords

secure multiparty computation

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Round-optimal secure multi-party computation
• Round-optimal secure multi-party computation
• Round-optimal secure multiparty computation with honest majority
• Round-optimal and communication-efficient multiparty computation
• Two-round multiparty secure computation from minimal assumptions

Cited in

(35)

• Four round secure computation without setup
• Towards round-optimal secure multiparty computations: multikey FHE without a CRS
• What security can we achieve within 4 rounds?
• A note on secure multiparty computation via higher residue symbols
• Towards accountability in CRS generation
• Reverse firewalls for actively secure MPCs
• Round optimal secure multiparty computation from minimal assumptions
• On the round complexity of secure quantum computation
• Three-round secure multiparty computation from black-box two-round oblivious transfer
• 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
• From FE combiners to secure MPC and back
• On the exact round complexity of best-of-both-worlds multi-party computation
• Two-round maliciously secure computation with super-polynomial simulation
• scientific article; zbMATH DE number 1754645 (Why is no real title available?)
• Round-Efficient Concurrently Composable Secure Computation via a Robust Extraction Lemma
• Round Efficient Unconditionally Secure Multiparty Computation Protocol
• Group-Based Secure Computation: Optimizing Rounds, Communication, and Computation
• Round-optimal secure multi-party computation
• On the exact round complexity of secure three-party computation
• Round-optimal secure multi-party computation
• Maliciously-secure MrNISC in the plain model
• Statistical security in two-party computation revisited
• Round-optimal black-box secure computation from two-round malicious OT
• On non-uniform security for black-box non-interactive CCA commitments
• 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
• The round complexity of statistical MPC with optimal resiliency
• Broadcast-optimal four-round MPC in the plain model
• Two-round concurrent 2PC from sub-exponential LWE
• Round-optimal black-box multiparty computation from polynomial-time assumptions
• Towards accountability in CRS generation

This page was built for publication: A new approach to round-optimal secure multiparty computation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1675737)