Score:0

Static vs Adaptive security of a distributed cryptographic protocol

lb flag

Let $n$ be the number parties in a distributed cryptographic protocol where an adversary can corrupt up to $n/3$ nodes in the network.

Static Adversary: The set of corrupt nodes is fixed a priori.
Adaptive Adversary: Adversary selects the set of corrupt nodes during execution of the protocol.

Let’s say we do not know how to prove a distributed cryptographic primitive X secure against an adaptive adversary. Then, if we use X inside another cryptographic primitive Y, is it possible to prove security of Y against an adaptive adversary?

My answer is yes as long as we use X in a way such that we can always produce a consistent view of X to an adaptive adversary.

Maarten Bodewes avatar
in flag
A protocol is generally thought of as public and descriptive, so having a "distributed protocol" doesn't make too much sense to me, but I suppose it is clear what is meant.
mangohost

Post an answer

Most people don’t grasp that asking a lot of questions unlocks learning and improves interpersonal bonding. In Alison’s studies, for example, though people could accurately recall how many questions had been asked in their conversations, they didn’t intuit the link between questions and liking. Across four studies, in which participants were engaged in conversations themselves or read transcripts of others’ conversations, people tended not to realize that question asking would influence—or had influenced—the level of amity between the conversationalists.