There is a need for new architectures and designs of resilient networked systems that are
capable of supporting critical services and infrastructures. The arguments have previously …

Federated learning has been spotlighted as a way to train neural networks using distributed
data with no need for individual nodes to share data. Unfortunately, it has also been shown …

We present the first general protocol for secure multiparty computation in which the total
amount of work required by n players to compute a function f grows only polylogarithmically …

Threshold cryptography is typically based on the idea of secret-sharing a private-key s∈ F
“in the exponent” of some cryptographic group G, or more generally, encoding s in some …

End-to-end authenticity in public networks plays a significant role. Namely, without
authenticity, the adversary might be able to retrieve even confidential information straight …

We introduce the problem of Verifiable Relation Sharing (VRS) where a client (prover)
wishes to share a vector of secret data items among k servers (the verifiers) while proving in …

Secure multi-party computation (MPC) is a central problem in cryptography. Unfortunately, it
is well known that MPC is possible if and only if the underlying communication network has …

As is common practice in research, many new cryptographic techniques have been
developed to tackle either a theoretical question or foreseeing a soon to become reality …

In the wiretap model of secure communication, Alice is connected to Bob over a noisy
channel that is eavesdropped by Eve. The goal is to provide (asymptotic) reliability and …

Abstract Service level agreements occasionally come as qualitative claims rather than
quantitative statements. Motivated by the well-known fact that different (security) service …