all InfoSec news
On the Round Complexity of Asynchronous Crusader Agreement
Oct. 13, 2023, 12:54 p.m. |
IACR News www.iacr.org
ePrint Report: On the Round Complexity of Asynchronous Crusader Agreement
Ittai Abraham, Naama Ben-David, Gilad Stern, Sravya Yandamuri
We present new lower and upper bounds on the number of communication rounds required for asynchronous Crusader Agreement (CA) and Binding Crusader Agreement (BCA), two primitives that are used for solving binary consensus. We show results for the information theoretic and authenticated settings. In doing so, we present a generic model for proving round complexity lower bounds in the asynchronous setting.
In …
asynchronous ben binary communication complexity eprint report report stern
More from www.iacr.org / IACR News
Compact Key Storage: A Modern Approach to Key Backup and Delegation
1 day, 20 hours ago |
www.iacr.org
Quantum Evolving Secret Sharing for General Access Structures
1 day, 20 hours ago |
www.iacr.org
Preliminary Analysis of Ascon-Xof and Ascon-Hash
1 day, 20 hours ago |
www.iacr.org
Jobs in InfoSec / Cybersecurity
CyberSOC Technical Lead
@ Integrity360 | Sandyford, Dublin, Ireland
Cyber Security Strategy Consultant
@ Capco | New York City
Cyber Security Senior Consultant
@ Capco | Chicago, IL
Senior Security Researcher - Linux MacOS EDR (Cortex)
@ Palo Alto Networks | Tel Aviv-Yafo, Israel
Sr. Manager, NetSec GTM Programs
@ Palo Alto Networks | Santa Clara, CA, United States
SOC Analyst I
@ Fortress Security Risk Management | Cleveland, OH, United States