On the Bottleneck Complexity of MPC with Correlated Randomness

DOI10.1007/978-3-030-97121-2_8zbMath1492.94156OpenAlexW4214685902MaRDI QIDQ5087257

Peter Scholl, Claudio Orlandi, Divya Ravi

Publication date: 8 July 2022

Published in: Public-Key Cryptography – PKC 2022 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-97121-2_8

zbMATH Keywords

bottleneck complexity of a secure multi-party computation protocol

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

Cites Work

• Unnamed Item
• Best possible information-theoretic MPC
• On the message complexity of secure multiparty computation
• Security and composition of multiparty cryptographic protocols
• Secure massively parallel computation for dishonest majority
• Non-interactive secure multiparty computation for symmetric functions, revisited: more efficient constructions and extensions
• From FE combiners to secure MPC and back
• A note on the communication complexity of multiparty computation in the correlated randomness model
• Secure Multiparty Computation with General Interaction Patterns
• On the Communication Required for Unconditionally Secure Multiplication
• Hiding the Input-Size in Secure Two-Party Computation
• Non-Interactive Secure Multiparty Computation
• Secure Two-Party Computation with Low Communication
• Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE
• Evaluating Branching Programs on Encrypted Data
• Scalable Multiparty Computation with Nearly Optimal Work and Resilience
• Communication Locality in Secure Multi-party Computation
• On the Power of Correlated Randomness in Secure Computation
• Multi-party Computation of Polynomials and Branching Programs without Simultaneous Interaction
• Communication preserving protocols for secure function evaluation
• Secure Computation on the Web: Computing without Simultaneous Interaction
• Obfuscation of Probabilistic Circuits and Applications
• Efficient Fully Homomorphic Encryption from (Standard) LWE
• Scalable Secure Multiparty Computation
• On lattices, learning with errors, random linear codes, and cryptography

This page was built for publication: On the Bottleneck Complexity of MPC with Correlated Randomness