In information theory, the computationally bounded adversary problem is a different way of looking at the problem of sending data over a noisy channel...

defined to be those in which the advantage of any computationally bounded adversary is negligible. While such a theoretical guarantee is important, in...

unbounded computational power. Some protocols require a setup phase, which may only be secure against a computationally bounded adversary. A number of...

respectively computationally bounded adversary if the output of the simulator is statistically close to, respectively computationally indistinguishable...

several types of adversaries depending on what capabilities or intentions they are presumed to have. Adversaries may be computationally bounded or unbounded...

cryptosystem to be semantically secure, it must be infeasible for a computationally bounded adversary to derive significant information about a message (plaintext)...

resource. In classical cryptography, the bounded-storage model introduced by Ueli Maurer assumes that the adversary can only store a certain number of classical...

_{j=0}^{t}a_{j}i^{j}}=g^{P(i)}} . This scheme is, at best, secure against computationally bounded adversaries, namely the intractability of computing discrete logarithms...

most ε. In typical applications, the class F describes a model of computation with bounded resources and one is interested in designing distributions D with...

functions, it is computationally infeasible to find such a w ~ {\displaystyle {\tilde {w}}} . Seeing P {\displaystyle P} would provide an adversary with no useful...

are typically data dependent. In competitive analysis, one imagines an "adversary" which deliberately chooses difficult data, to maximize the ratio of the...

force attacks by the likelihood of success of an adversary utilizing computational resources bounded by very large physical constraints. An example of...

can be efficiently solved by a quantum computer with bounded error is called BQP, for "bounded error, quantum, polynomial time". More formally, BQP is...

bits), and publishes PK to the adversary. The challenger retains SK. The adversary may perform a polynomially bounded number of encryptions or other operations...

Randomized algorithms are particularly useful when faced with a malicious "adversary" or attacker who deliberately tries to feed a bad input to the algorithm...

exist a polynomially bounded propositional proof system? Cook and Reckhow (1979) observed that there exists a polynomially bounded proof system if and...

diabetes or not. For example: Now suppose a malicious user (often termed an adversary) wants to find whether Chandler has diabetes or not. Suppose he also knows...

'against' P/poly adversaries. Besides including most practical models of computation like BPP, this also admits the possibility that adversaries can do heavy...

classical logic. Computability logic is more expressive, constructive and computationally meaningful than classical logic. Besides classical logic, independence-friendly...

protocols is to use the bounded quantum storage model (BQSM). In this model, it is assumed that the amount of quantum data that an adversary can store is limited...

"random quote of the day", or determining which way a computer-controlled adversary might move in a computer game. Weaker forms of randomness are used in...

not efficiently SQ-learnable. In the malicious classification model an adversary generates errors to foil the learning algorithm. This setting describes...

number of collisions in expectation, even if the data is chosen by an adversary. Many universal families are known (for hashing integers, vectors, strings)...

algorithms depend on the construction of request sequences by adversaries under various adversary models An online algorithm for this problem has to reorder...

the adversary chooses a t-bit tag at random, it is expected to be correct for given data with probability measure 2−t. With GCM, however, an adversary can...

1007/s004530010033. S2CID 33176053. Kimmel, S. (2013). "Quantum Adversary (Upper) Bound". Chicago Journal of Theoretical Computer Science. 19: 1–14. arXiv:1101...

cryptographic adversary might send a carefully chosen pseudoprime in order to defeat the primality test. In such contexts, only the worst‐case error bound of 4−k...

performance of an online algorithm and an optimal offline algorithm is bounded, the online algorithm is called competitive. Not every offline algorithm...

original algorithm. The use of ORAMs is motivated by the fact that an adversary can obtain nontrivial information about the execution of a program and...

\{{\mathcal {iO}}(C_{1})\}} are computationally indistinguishable. In other words, for any probabilistic polynomial-time adversary A, there is a negligible function...