all InfoSec news
Delphi: Efficient Asynchronous Approximate Agreement for Distributed Oracles
May 7, 2024, 4:11 a.m. | Akhil Bandarupalli, Adithya Bhat, Saurabh Bagchi, Aniket Kate, Chen-Da Liu-Zhang, Michael K. Reiter
cs.CR updates on arXiv.org arxiv.org
Abstract: Agreement protocols are crucial in various emerging applications, spanning from distributed (blockchains) oracles to fault-tolerant cyber-physical systems. In scenarios where sensor/oracle nodes measure a common source, maintaining output within the convex range of correct inputs, known as convex validity, is imperative. Present asynchronous convex agreement protocols employ either randomization, incurring substantial computation overhead, or approximate agreement techniques, leading to high $\mathcal{\tilde{O}}(n^3)$ communication for an $n$-node system.
This paper introduces Delphi, a deterministic protocol with $\mathcal{\tilde{O}}(n^2)$ …
agreement applications arxiv asynchronous blockchains cs.cr cs.dc cyber distributed emerging inputs measure nodes oracle physical physical systems protocols sensor spanning systems
More from arxiv.org / cs.CR updates on arXiv.org
Jobs in InfoSec / Cybersecurity
Information Security Engineers
@ D. E. Shaw Research | New York City
Technology Security Analyst
@ Halton Region | Oakville, Ontario, Canada
Senior Cyber Security Analyst
@ Valley Water | San Jose, CA
Information Technology Security Engineer
@ Plexus Worldwide | Scottsdale, Arizona, United States
Principal Email Security Researcher (Cortex XDR)
@ Palo Alto Networks | Tel Aviv-Yafo, Israel
Lead Security Engineer - Cloud Security, AWS
@ JPMorgan Chase & Co. | Bengaluru, Karnataka, India