Round-optimal black-box MPC in the plain model

DOI10.1007/978-3-031-38557-5_13MaRDI QIDQ6186598zbMATH OpenFDO

Authors Yuval Ishai, Dakshita Khurana, Amit Sahai, Akshayaram Srinivasan

Publication date 2 February 2024

Published in Advances in Cryptology – CRYPTO 2023 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-031-38557-5_13

zbMATH Keywords

fully black-box protocolspublic-key cryptography

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• On the round complexity of black-box secure MPC
• Round optimal secure multiparty computation from minimal assumptions
• Three-round secure multiparty computation from black-box two-round oblivious transfer
• Round-optimal secure multi-party computation
• Round-optimal black-box two-party computation

Cites work

• A black-box construction of fully-simulatable, round-optimal oblivious transfer from strongly uniform key agreement
• A new approach to round-optimal secure multiparty computation
• Advances in Cryptology – CRYPTO 2004
• Black-box constructions of protocols for secure computation
• Candidate indistinguishability obfuscation and functional encryption for all circuits
• Constant round non-malleable protocols using one way functions
• Efficient oblivious transfer protocols
• Founding Cryptography on Oblivious Transfer – Efficiently
• Four round secure computation without setup
• How to construct constant-round zero-knowledge proof systems for NP
• scientific article; zbMATH DE number 1722674 (Why is no real title available?)
• Multi-source non-malleable extractors and applications
• Non-malleable extractors and codes, with their many tampered extensions
• Oblivious transfer from trapdoor permutations in minimal rounds
• On the Composition of Zero-Knowledge Proof Systems
• On the round complexity of black-box secure MPC
• Optimal computational split-state non-malleable codes
• Promise zero knowledge and its applications to round optimal MPC
• Round optimal secure multiparty computation from minimal assumptions
• Round-optimal black-box commit-and-prove with succinct communication
• Round-optimal black-box two-party computation
• Round-optimal fully black-box zero-knowledge arguments from one-way permutations
• Secure computation with minimal interaction, revisited
• Secure multiparty computation with minimal interaction
• Smooth projective hashing and two-message oblivious transfer
• Smooth Projective Hashing and Two-Message Oblivious Transfer
• Statistically sender-private OT from LPN and derandomization
• Textbook non-malleable commitments
• The Exact Round Complexity of Secure Computation
• Theory of Cryptography
• Three-round secure multiparty computation from black-box two-round oblivious transfer
• Trapdoor hash functions and their applications
• Two-message statistically sender-private OT from LWE
• Two-message witness indistinguishability and secure computation in the plain model from new assumptions
• Two-round multiparty secure computation from minimal assumptions
• Two-round oblivious transfer from CDH or LPN
• Which languages have 4-round fully black-box zero-knowledge arguments from one-way functions?

Cited in

(3)

• Black-box constant-round secure 2PC with succinct communication
• Round-optimal black-box multiparty computation from polynomial-time assumptions
• Broadcast-optimal secure computation from black-box oblivious transfer

This page was built for publication: Round-optimal black-box MPC in the plain model

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