A full proof of the BGW protocol for perfectly secure multiparty computation

DOI10.1007/s00145-015-9214-4zbMath1370.94480OpenAlexW1245637661MaRDI QIDQ514468

Yehuda Lindell, Gilad Asharov

Publication date: 2 March 2017

Published in: Journal of Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00145-015-9214-4

zbMATH Keywords

cryptographic protocolsperfect securitymultiparty computationBGW

Mathematics Subject Classification ID

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

Related Items (23)

Secure Multi-party Shuffling ⋮ A discrepancy lower bound for information complexity ⋮ Secure multi-party computation in large networks ⋮ Lower and upper bounds on the randomness complexity of private computations of AND ⋮ A theoretical and empirical evaluation of an algorithm for self-healing computation ⋮ Detect, pack and batch: perfectly-secure MPC with linear communication and constant expected time ⋮ Private Visual Share-Homomorphic Computation and Randomness Reduction in Visual Cryptography ⋮ Asymptotically free broadcast in constant expected time via packed VSS ⋮ Round-optimal honest-majority MPC in Minicrypt and with everlasting security (extended abstract) ⋮ Random sources in private computation ⋮ Cryptography with weights: MPC, encryption and signatures ⋮ On the communication efficiency of statistically secure asynchronous MPC with optimal resilience ⋮ On the universal steganography of optimal rate ⋮ Secure Multi-party Computation: Information Flow of Outputs and Game Theory ⋮ A full proof of the BGW protocol for perfectly secure multiparty computation ⋮ Unnamed Item ⋮ Efficient perfectly secure computation with optimal resilience ⋮ Efficient perfectly secure computation with optimal resilience ⋮ Distributed key generation for SM9-based systems ⋮ Probabilistic Termination and Composability of Cryptographic Protocols ⋮ Probabilistic termination and composability of cryptographic protocols ⋮ Lower and Upper Bounds on the Randomness Complexity of Private Computations of AND ⋮ Round-optimal black-box commit-and-prove with succinct communication

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A full proof of the BGW protocol for perfectly secure multiparty computation
• Probabilistic encryption
• Adaptive versus non-adaptive security of multi-party protocols
• Security and composition of multiparty cryptographic protocols
• Simplified VSS and fast-track multiparty computations with applications to threshold cryptography
• How to share a secret
• Information-Theoretically Secure Protocols and Security under Composition
• Universally composable two-party and multi-party secure computation
• Reaching Agreement in the Presence of Faults
• The Byzantine Generals Problem
• An Optimal Probabilistic Protocol for Synchronous Byzantine Agreement
• Foundations of Cryptography
• Resilient-optimal interactive consistency in constant time
• Sequential composition of protocols without simultaneous termination
• Perfectly-Secure Multiplication for Any t < n/3
• Perfectly-Secure MPC with Linear Communication Complexity

This page was built for publication: A full proof of the BGW protocol for perfectly secure multiparty computation