Promise zero knowledge and its applications to round optimal MPC

DOI10.1007/978-3-319-96881-0_16zbMath1436.94035OpenAlexW2794618582MaRDI QIDQ1784103

Abhishek Jain, Dakshita Khurana, Saikrishna Badrinarayanan, Amit Sahai, Vipul Goyal, Yael Tauman Kalai

Publication date: 26 September 2018

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

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (29)

On the round complexity of secure quantum computation ⋮ On the round complexity of black-box secure MPC ⋮ Two-message statistically sender-private OT from LWE ⋮ 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 ⋮ 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 ⋮ Knowledge encryption and its applications to simulatable protocols with low round-complexity ⋮ On non-uniform security for black-box non-interactive CCA commitments ⋮ Public-coin 3-round zero-knowledge from learning with errors and keyless multi-collision-resistant hash ⋮ Statistically sender-private OT from LPN and derandomization ⋮ A new approach to efficient non-malleable zero-knowledge ⋮ A new framework for quantum oblivious transfer ⋮ 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 ⋮ On the exact round complexity of best-of-both-worlds multi-party computation ⋮ Simpler statistically sender private oblivious transfer from ideals of cyclotomic integers ⋮ Two-round maliciously secure computation with super-polynomial simulation ⋮ Blockchains enable non-interactive MPC ⋮ An Algebraic Approach to Nonmalleability ⋮ What security can we achieve within 4 rounds? ⋮ On the exact round complexity of secure three-party computation ⋮ Round-optimal secure multi-party computation ⋮ Towards accountability in CRS generation

This page was built for publication: Promise zero knowledge and its applications to round optimal MPC