Assertion: adversary | /r/HasProperty | probabilistic
Facets:
value: simply
type: DEGREE
value: formally
type: MANNER
Source sentences:
text: In Katz' book is explained that this is natural because the honest parties are required to be probabilistic (in order to generate random keys and so on), actually this isn't very natural for me (the fact that the honest parties are probabilistic shouldn't imply we must consider adversaries to be probabilistic too).
text: Formally, an adversary is simply a (probabilistic) algorithm, which we usually assume to run in polynomial time in $n$, the security parameter.