adaptive offline adversary. For randomized online algorithms competitiveness can depend upon the adversary model used. The three common adversaries are the oblivious...

cryptosystem from achieving their goal Adversary model, in online algorithms, used to show competitiveness of randomized algorithms Adversarial alignment, when an...

matrix representation adversary algorithm algorithm BSTW algorithm FGK algorithmic efficiency algorithmically solvable algorithm V all pairs shortest path...

prevent forgery by adversaries without knowledge of the secret key, this is insufficient in certain scenarios. When an adversary is able to control the...

oracle. Say that an adversary algorithm has access to an oracle that will apply a function to inputs that are sent to it. The algorithm sends the oracle...

A randomized algorithm is an algorithm that employs a degree of randomness as part of its logic or procedure. The algorithm typically uses uniformly random...

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

Some online algorithms: Insertion sort Perceptron Reservoir sampling Greedy algorithm Adversary model Metrical task systems Odds algorithm Page replacement...

encryption scheme usually uses a pseudo-random encryption key generated by an algorithm. It is possible to decrypt the message without possessing the key but...

In computer science, a selection algorithm is an algorithm for finding the k {\displaystyle k} th smallest value in a collection of ordered values, such...

for on-line and randomized algorithms, which are typically data dependent. In competitive analysis, one imagines an "adversary" which deliberately chooses...

recover a cipher's key. It is defined as the probability that the adversary algorithm can guess a cipher's randomly selected key, given a fixed amount...

transformed algorithm is independent of the memory access pattern of the original algorithm. The use of ORAMs is motivated by the fact that an adversary can obtain...

A cryptographic hash function (CHF) is a hash algorithm (a map of an arbitrary binary string to a binary string with a fixed size of n {\displaystyle...

outperforms other algorithms which can guarantee O(n log n) behavior. Let us suppose an adversary wishes to force the Quicksort algorithm to make O(n2) comparisons...

parties (called adversaries). More generally, it is about constructing and analyzing protocols that overcome the influence of adversaries and that are related...

of that type of algorithm. Note that in this context, the "adversary" is itself an algorithm and not a person. A cryptographic algorithm is considered secure...

it to a receiver securely, in spite of eavesdropping and intercepting adversaries. Modern standards for public-key encryption of arbitrary messages are...

MR 1471991, S2CID 13403194. Algorithms: Dasgupta, Papadimitriou, Vazirani Vazirani, Umesh Virkumar (1986-01-01). Randomness, Adversaries and Computation. University...

determined by an algorithm defined in advance, and known by both Bob and Alice. The correct response might be as simple as "63x83z", with the algorithm changing...

security. Quantum algorithms then emerged for solving oracle problems, such as Deutsch's algorithm in 1985, the Bernstein–Vazirani algorithm in 1993, and Simon's...

compromise a cryptosystem by analyzing the time taken to execute cryptographic algorithms. Every logical operation in a computer takes time to execute, and the...

In cryptography, a block cipher is a deterministic algorithm that operates on fixed-length groups of bits, called blocks. Block ciphers are the elementary...

to be solvable by showing an algorithm that solves it; a computational problem is shown to be in P by showing an algorithm that solves it in time that...

By treating opponents as a unified adversary whose payoff is the opposite of the focal player’s payoff, the algorithm can apply branch and bound techniques...

cryptographic algorithms are designed around computational hardness assumptions, making such algorithms hard to break in actual practice by any adversary. While...

computer science, a distribution is pseudorandom against a class of adversaries if no adversary from the class can distinguish it from the uniform distribution...

Alpha–beta pruning is a search algorithm that seeks to decrease the number of nodes that are evaluated by the minimax algorithm in its search tree. It is an...

impossible for a k-server algorithm to perform well relative to its adversary. However, for the 2-server problem, there exists an algorithm that always has a...

sorting algorithm. Quicksort was developed by British computer scientist Tony Hoare in 1959 and published in 1961. It is still a commonly used algorithm for...