Nov. 14, 2023, 2:18 p.m. |


ePrint Report: Adaptively Secure Consensus with Linear Complexity (and Constant Round) under Honest Majority in the Bare PKI Model, and Separation Bounds from the Idealized Message-Authentication Model

Matthieu Rambaud

We consider the mainstream model in secure computation known as the bare PKI setup, also as the {bulletin-board PKI}. It assumes that players can broadcast once and non-interactively before they receive their inputs and start the execution. We consider both the problems of consensus with strong unanimity, also known as ``Byzantine …

authentication complexity eprint report linear message pki report under

Paid internship - Cybersecurity [BGSW]

@ Bosch Group | Warszawa, Poland

Cybersecurity Officer

@ People In Need | Prague 2, Prague, Czechia

University -Cybersecurity Consultant

@ Booz Allen Hamilton | USA, CA, San Diego (1615 Murray Canyon Rd)

Senior Security Engineer, Detection Engineering

@ Lyft | Seattle, WA

Architecte de la sécurité des applications / Application Security Architect

@ Genetec | Montreal, Quebec, Canada

Telecommunications Sector| SIEM Engineer

@ Devoteam | Lisbon, Portugal