Brief announcement: Asynchronous secure distributed computing with transferrable non-equivocation revisited

DOI10.1145/3212734.3212777MaRDI QIDQ5197692zbMATH OpenOpenAlexWikidataFDO

Authors Rishabh Bhadauria, Ashish Choudhury

Publication date 19 September 2019

Published in Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/3212734.3212777

zbMATH Keywords

fault-tolerancenon-equivocationsecure distributed computing

Mathematics Subject Classification ID

Network protocols (68M12) Distributed systems (68M14) Computer security (68M25) Distributed algorithms (68W15) Cryptography (94A60)

Recommendations

• Asynchronous MPC with a strict honest majority using non-equivocation
• On the (limited) power of non-equivocation
• Brief announcement: communication efficient asynchronous Byzantine agreement
• Simple and efficient asynchronous Byzantine agreement with optimal resilience
• Asynchronous Byzantine agreement with optimal resilience

Cited in

(2)

• On the (limited) power of non-equivocation
• Asynchronous MPC with a strict honest majority using non-equivocation

This page was built for publication: Brief announcement: Asynchronous secure distributed computing with transferrable non-equivocation revisited

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5197692)