Promise zero knowledge and its applications to round optimal MPC

DOI10.1007/978-3-319-96881-0_16MaRDI QIDQ1784103zbMATH OpenOpenAlexFDO

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

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)

Recommendations

• Round-optimal perfect zero-knowledge proofs
• Private polynomial commitments and applications to MPC
• Round-optimal zero-knowledge proofs of knowledge for NP
• scientific article; zbMATH DE number 1107670
• Round efficient unconditionally secure MPC and multiparty set intersection with optimal resilience
• On Efficient Zero-Knowledge PCPs
• On round optimal statistical zero knowledge arguments
• Constant-round perfect zero-knowledge computationally convincing protocols
• Zero-knowledge protocols for the subset sum problem from MPC-in-the-head with rejection
• Round optimal secure multiparty computation from minimal assumptions

Cited in

(34)

• Round-optimal black-box secure computation from two-round malicious OT
• Simpler statistically sender private oblivious transfer from ideals of cyclotomic integers
• A black-box construction of fully-simulatable, round-optimal oblivious transfer from strongly uniform key agreement
• List oblivious transfer and applications to round-optimal black-box multiparty coin tossing
• Reusable secure computation in the plain model
• Round-optimal black-box MPC in the plain model
• On the round complexity of black-box secure MPC
• On the round complexity of secure quantum computation
• Statistical security in two-party computation revisited
• Two-message statistically sender-private OT from LWE
• Four-round black-box non-malleable schemes from one-way permutations
• The round complexity of statistical MPC with optimal resiliency
• A new approach to efficient non-malleable zero-knowledge
• Towards accountability in CRS generation
• Broadcast-optimal four-round MPC in the plain model
• From FE combiners to secure MPC and back
• On the exact round complexity of secure three-party computation
• A new framework for quantum oblivious transfer
• Zero-knowledge protocols for the subset sum problem from MPC-in-the-head with rejection
• Two-round concurrent 2PC from sub-exponential LWE
• Round-optimal and communication-efficient multiparty computation
• Public-coin 3-round zero-knowledge from learning with errors and keyless multi-collision-resistant hash
• Blockchains enable non-interactive MPC
• Knowledge encryption and its applications to simulatable protocols with low round-complexity
• On non-uniform security for black-box non-interactive CCA commitments
• An Algebraic Approach to Nonmalleability
• Statistically sender-private OT from LPN and derandomization
• Round-optimal oblivious transfer and MPC from computational CSIDH
• What security can we achieve within 4 rounds?
• On the exact round complexity of best-of-both-worlds multi-party computation
• Two-round maliciously secure computation with super-polynomial simulation
• Low cost constant round MPC combining BMR and oblivious transfer
• Round-optimal secure multi-party computation
• Round-optimal multi-party computation with identifiable abort

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

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