Efficient perfectly secure computation with optimal resilience
From MaRDI portal
Publication:5918515
DOI10.1007/s00145-022-09434-2zbMath1499.94033OpenAlexW3203188395MaRDI QIDQ5918515
Gilad Asharov, Avishay Yanai, Ittai Abraham
Publication date: 4 October 2022
Published in: Journal of Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00145-022-09434-2
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A full proof of the BGW protocol for perfectly secure multiparty computation
- Fast large-scale honest-majority MPC for malicious adversaries
- On expected constant-round protocols for Byzantine agreement
- Modular construction of a Byzantine agreement protocol with optimal message bit complexity
- Adaptive versus non-adaptive security of multi-party protocols
- Security and composition of multiparty cryptographic protocols
- Efficient asynchronous verifiable secret sharing and multiparty computation
- Communication-efficient unconditional MPC with guaranteed output delivery
- Probabilistic termination and composability of cryptographic protocols
- Simplified VSS and fast-track multiparty computations with applications to threshold cryptography
- On the Communication Required for Unconditionally Secure Multiplication
- Adaptive versus Static Security in the UC Model
- An Efficient Framework for Unconditionally Secure Multiparty Computation
- How to share a secret
- Information-Theoretically Secure Protocols and Security under Composition
- Simple and Efficient Perfectly-Secure Asynchronous MPC
- Scalable and Unconditionally Secure Multiparty Computation
- An Optimal Probabilistic Protocol for Synchronous Byzantine Agreement
- Foundations of Cryptography
- Perfectly-Secure Multiplication for Any t < n/3
- Perfectly-Secure MPC with Linear Communication Complexity
- Robust Multiparty Computation with Linear Communication Complexity
This page was built for publication: Efficient perfectly secure computation with optimal resilience
