Marcel Keller
@mkskeller.bsky.social
Cryptographer who likes to implement multi-party computation and works for CSIRO's Data61. Views my own. 🏳️🌈🇨🇭🇦🇺 (he/him)
At least they make it easy to find out why. It seems they confuse you with Moni Naor on this CiC paper: openalex.org/works/W44092...
OpenAlex
openalex.org
November 21, 2025 at 4:00 AM
At least they make it easy to find out why. It seems they confuse you with Moni Naor on this CiC paper: openalex.org/works/W44092...
Reposted by Marcel Keller
Just saw an extended version
November 20, 2025 at 11:26 PM
Just saw an extended version
Reposted by Marcel Keller
Our protocol is simple & modular: it works in the "Arithmetic Black Box" model, and inherits the security properties of the ABB instantiation (passive/active, static/adaptive, etc.).
Using SPDℤ₂𝑘 for ABB, we get about 20,000x and 37x better throughput and latency than SoTA for dishonest majority.
Using SPDℤ₂𝑘 for ABB, we get about 20,000x and 37x better throughput and latency than SoTA for dishonest majority.
October 14, 2025 at 3:40 PM
Our protocol is simple & modular: it works in the "Arithmetic Black Box" model, and inherits the security properties of the ABB instantiation (passive/active, static/adaptive, etc.).
Using SPDℤ₂𝑘 for ABB, we get about 20,000x and 37x better throughput and latency than SoTA for dishonest majority.
Using SPDℤ₂𝑘 for ABB, we get about 20,000x and 37x better throughput and latency than SoTA for dishonest majority.