Round-optimal and communication-efficient multiparty computation

DOI10.1007/978-3-031-06944-4_3zbMath1497.68210OpenAlexW3109897829MaRDI QIDQ2169992

Yanyan Li

Publication date: 30 August 2022

Full work available at URL: https://doi.org/10.1007/978-3-031-06944-4_3

zbMATH Keywords

round complexitymultiparty computationround-preserving black-box compiler

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Cryptography (94A60) Theory of compilers and interpreters (68N20) Communication complexity, information complexity (68Q11)

Related Items (1)

List oblivious transfer and applications to round-optimal black-box multiparty coin tossing

Cites Work

• Unnamed Item
• A proof of security of Yao's protocol for two-party computation
• Two-round multiparty secure computation from minimal assumptions
• \(k\)-round multiparty computation from \(k\)-round oblivious transfer via garbled interactive circuits
• Round-optimal secure two-party computation from trapdoor permutations
• Promise zero knowledge and its applications to round optimal MPC
• Multi-key fully-homomorphic encryption in the plain model
• Succinct non-interactive secure computation
• Round optimal secure multiparty computation from minimal assumptions
• A black-box construction of fully-simulatable, round-optimal oblivious transfer from strongly uniform key agreement
• From FE combiners to secure MPC and back
• Oblivious transfer from trapdoor permutations in minimal rounds
• (Leveled) fully homomorphic encryption without bootstrapping
• Spooky Encryption and Its Applications
• Adaptively Secure Multi-Party Computation with Dishonest Majority
• Functional Encryption: Definitions and Challenges
• Secure Computation with Minimal Interaction, Revisited
• Constant-Round Non-malleable Commitments from Sub-exponential One-Way Functions
• Bounded-concurrent secure multi-party computation with a dishonest majority
• Secure Multiparty Computation with Minimal Interaction
• Founding Cryptography on Oblivious Transfer – Efficiently
• Foundations of Cryptography
• Advances in Cryptology – CRYPTO 2004
• Fuzzy Identity-Based Encryption
• On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption
• Constant round non-malleable protocols using one way functions
• Group-Based Secure Computation: Optimizing Rounds, Communication, and Computation
• The Exact Round Complexity of Secure Computation
• Two Round Multiparty Computation via Multi-key FHE
• Round-optimal secure multi-party computation
• Adaptively secure MPC with sublinear communication complexity

This page was built for publication: Round-optimal and communication-efficient multiparty computation