Skip to search formSkip to main contentSkip to account menu

Computationally bounded adversary

In information theory, the computationally bounded adversary problem is a different way of looking at the problem of sending data over a noisy… 
Wikipedia (opens in a new tab)

Related topics

Related topics

11 relations
Adversary (cryptography)Concrete securityInformation theoryList decoding

Broader (2)

Coding theoryComputational complexity theory

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
NudgeEntrance: Domestic intervention to change hand washing behaviour
Hands are primary vectors of many communicable diseases because they come in contact with a variety of surfaces and fluids. Acute… 
2017
2017
A Low-Cost UAV-Based Secure Location Verification Method
The capability to verify positions reported by devices is called secure location verification. The majority of the proposed… 
2015
2015
Special issue with selected papers from PODC 2012
2014
2014
Voting with Coarse Beliefs
The classic Gibbard-Satterthwaite theorem says that every strategy-proof voting rule with at least three possible candidates must… 
2013
2013
Constant Query Locally Decodable Codes against Computationally Bounded Adversary
Designing efficient Locally Decodable Codes with constant query complexity has been a central open problem in theoretical… 
2011
2011
Knowledge State Algorithms
We introduce the novel concept of knowledge states. The knowledge state approach can be used to construct competitive randomized… 
2011
2011
Secure message transmission in asynchronous networks
2011
2011
Two-player interaction in quantum computing : cryptographic primitives & query complexity. (Interaction à deux joueurs en informatique quantique : primitives cryptographiques et complexité en requ…
Cette these etudie deux aspects d'interaction entre deux joueurs dans le modele du calcul et de la communication quantique… 
2010
2010
Minimum generation error training with weighted Euclidean distance on LSP for HMM-based speech synthesis
This paper presents a minimum generation error (MGE) training method using weighted Euclidean distance measure on line spectral… 
1998
1998
Searching on m Bounded Rays Optimally
We consider the problem of searching on $m$ current rays for a target of unknown location. It is well-known that the optimal… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)