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
A Simple Obfuscation Scheme for Pattern-Matching with Wildcards
We give a simple and efficient method for obfuscating pattern matching with wildcards. In other words, we construct a way to… 
2014
2014
Reliable broadcast with respect to topology knowledge
We study the Reliable Broadcast problem in incomplete networks against a Byzantine adversary. We examine the problem under the… 
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… 
Highly Cited
2009
Highly Cited
2009
Providing Privacy through Plausibly Deniable Search
Query-based web search is an integral part of many people’s daily activities. Most do not realize that their search history can… 
2009
2009
Basic qualitative properties of Petri nets with multi-guarded transitions
In many discrete event dynamic systems, there exist tasks that can start performing before every input data is available. A… 
Highly Cited
2008
Highly Cited
2008
Fast asynchronous byzantine agreement and leader election with full information
We resolve two long-standing open problems in distributed computation by describing polylogarithmic protocols for Byzantine… 
2007
2007
Optimal Quantum Adversary Lower Bounds for Ordered Search
The goal of the ordered search problem is to find a particular item in an ordered list of nitems. Using the adversary method… 
Highly Cited
2007
Highly Cited
2007
Limiting Sybil Attacks in Structured P2P Networks
One practical limitation of structured peer-to-peer (P2P) networks is that they are frequently subject to Sybil attacks… 
Highly Cited
2004
Highly Cited
2004
Nonclairvoyant scheduling to minimize the total flow time on single and parallel machines
Scheduling a sequence of jobs released over time when the processing time of a job is only known at its completion is a classical… 
2001
2001
Equivalences among aggregate queries with negation
Query equivalence is investigated for disjunctive aggregate queries with negated subgoals, constants and comparisons. A full… 
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)