Detect, pack and batch: perfectly-secure MPC with linear communication and constant expected time
From MaRDI portal
Publication:6061361
DOI10.1007/978-3-031-30617-4_9OpenAlexW4365807480MaRDI QIDQ6061361
Arpita Patra, Ittai Abraham, Shravani Patil, Gilad Asharov
Publication date: 8 December 2023
Published in: Advances in Cryptology – EUROCRYPT 2023 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-30617-4_9
Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Distributed systems (68M14) Authentication, digital signatures and secret sharing (94A62)
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
- A lower bound for the time to assure interactive consistency
- Adaptive versus non-adaptive security of multi-party protocols
- Guaranteed output delivery comes free in honest majority MPC
- Communication-efficient unconditional MPC with guaranteed output delivery
- Simplified VSS and fast-track multiparty computations with applications to threshold cryptography
- Near-Linear Unconditionally-Secure Multiparty Computation with a Dishonest Minority
- Information-theoretically secure protocols and security under composition
- An almost-surely terminating polynomial protocol for asynchronous byzantine agreement with optimal resilience
- An Efficient Framework for Unconditionally Secure Multiparty Computation
- The Power of Shunning
- Almost-Surely Terminating Asynchronous Byzantine Agreement Revisited
- Perfectly-Secure Multiplication for Any t < n/3
- Perfectly-Secure MPC with Linear Communication Complexity
- On Expected Constant-Round Protocols for Byzantine Agreement
- Theory of Cryptography
- Efficient perfectly secure computation with optimal resilience
- Asymptotically free broadcast in constant expected time via packed VSS
