114 search results - page 14 / 23 » Interactive Proof Systems with Polynomially Bounded Strategi... |
CONCUR
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. For many cryptographic protocols, security relies on the assumption that adversarial entities have limited computational power. This type of security degrades progressive...
ATAL
2009
Springer
2009
Springer
Effective solutions for real-world Stackelberg games: when agents must deal with human uncertainties
14 years 2 months ago
How do we build multiagent algorithms for agent interactions with human adversaries? Stackelberg games are natural models for many important applications that involve human intera...
IJFCS
2008
13 years 8 months ago
2008
Abstract. Recently, it has been shown that for any higher order pushdown system H and for any regular set C of configurations, the set pre H(C), is regular. In this paper, we give ...
IPPS
2008
IEEE
14 years 2 months ago
2008
IEEE
In this paper, we introduce the new technique of HighConfidence Software Monitoring (HCSM), which allows one to perform software monitoring with bounded overhead and concomitantl...
TCC
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. Parallel repetition is well known to reduce the error probability at an exponential rate for single- and multi-prover interactive proofs. Bellare, Impagliazzo and Naor (1...