Revisiting the efficiency of perfectly secure asynchronous multi-party computation against general adversaries
From MaRDI portal
Publication:6169465
DOI10.1007/978-3-031-22912-1_10OpenAlexW4313347243MaRDI QIDQ6169465
Ananya Appan, Ashish Choudhury, Anirudh Chandramouli
Publication date: 14 August 2023
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-22912-1_10
privacysecret-sharingByzantine agreementByzantine faultsmulti-party computationnon-threshold adversaryunconditional-security
Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Computer security (68M25)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Player simulation and general adversary structures in perfect multiparty computation
- Efficient asynchronous verifiable secret sharing and multiparty computation
- Perfectly-secure asynchronous MPC for general adversaries (extended abstract)
- Asynchronous Secure Multiparty Computation in Constant Time
- Efficient General-Adversary Multi-Party Computation
- Constant-Round Asynchronous Multi-Party Computation Based on One-Way Functions
- An Efficient Framework for Unconditionally Secure Multiparty Computation
- How to share a secret
- Simple and Efficient Perfectly-Secure Asynchronous MPC
- Impossibility of distributed consensus with one faulty process
- Foundations of Cryptography
- Universally Composable Synchronous Computation
- Universally Composable Security
- Asynchronous secure computation
- Asynchronous secure computations with optimal resilience (extended abstract)
- Revisiting the efficiency of perfectly secure asynchronous multi-party computation against general adversaries
This page was built for publication: Revisiting the efficiency of perfectly secure asynchronous multi-party computation against general adversaries
