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
Regev Factoring Beyond Fibonacci: Optimizing Prefactors
2 days, 14 hours ago |
www.iacr.org
NTRU-based FHE for Larger Key and Message Space
2 days, 14 hours ago |
www.iacr.org
Vision Mark-32: ZK-Friendly Hash Function Over Binary Tower Fields
2 days, 14 hours ago |
www.iacr.org
Jobs in InfoSec / Cybersecurity
SOC 2 Manager, Audit and Certification
@ Deloitte | US and CA Multiple Locations
Lead Technical Product Manager - Threat Protection
@ Mastercard | Remote - United Kingdom
Data Privacy Officer
@ Banco Popular | San Juan, PR
GRC Security Program Manager
@ Meta | Bellevue, WA | Menlo Park, CA | Washington, DC | New York City
Cyber Security Engineer
@ ASSYSTEM | Warrington, United Kingdom
Privacy Engineer, Technical Audit
@ Meta | Menlo Park, CA