370 search results - page 60 / 74 » Limits of Constructive Security Proofs |
CRYPTO
2009
Springer
14 years 2 months ago
2009
Springer
Collusion-free protocols prevent subliminal communication (i.e., covert channels) between parties running the protocol. In the standard communication model, if one-way functions ex...
CRYPTO
2003
Springer
14 years 1 months ago
2003
Springer
We revisit the definitions of zero-knowledge in the Common Reference String (CRS) model and the Random Oracle (RO) model. We argue that even though these definitions syntacticall...
ACNS
2006
Springer
13 years 11 months ago
2006
Springer
CPU bound client puzzles have been suggested as a defense mechanism against connection depletion attacks. However, the wide disparity in CPU speeds prevents such puzzles from being...
CTRSA
2007
Springer
13 years 9 months ago
2007
Springer
Abstract. Known compact e-cash schemes are constructed from signature schemes with efficient protocols and verifiable random functions. In this paper, we introduce a different ap...
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...