Sciweavers

469 search results - page 46 / 94
» On Adversary Models and Compositional Security
Sort
View
ASIACRYPT
2009
Springer
15 years 6 months ago
Security Notions and Generic Constructions for Client Puzzles
Computational puzzles are mildly difficult computational problems that require resources (processor cycles, memory, or both) to solve. Puzzles have found a variety of uses in secu...
Liqun Chen, Paul Morrissey, Nigel P. Smart, Bogdan...
ESOP
2005
Springer
15 years 5 months ago
Computationally Sound, Automated Proofs for Security Protocols
Since the 1980s, two approaches have been developed for analyzing security protocols. One of the approaches relies on a computational model that considers issues of complexity and ...
Véronique Cortier, Bogdan Warinschi
EUROCRYPT
2003
Springer
15 years 5 months ago
A Forward-Secure Public-Key Encryption Scheme
Cryptographic computations are often carried out on insecure devices for which the threat of key exposure represents a serious concern. Forward security allows one to mitigate the...
Ran Canetti, Shai Halevi, Jonathan Katz
ATAL
2010
Springer
15 years 28 days ago
Robust Bayesian methods for Stackelberg security games
Recent work has applied game-theoretic models to real-world security problems at the Los Angeles International Airport (LAX) and Federal Air Marshals Service (FAMS). The analysis o...
Christopher Kiekintveld, Milind Tambe, Janusz Mare...
ISPEC
2009
Springer
15 years 6 months ago
On the Correctness of an Approach against Side-Channel Attacks
Abstract. Side-channel attacks are a very powerful cryptanalytic technique. Li and Gu [ProvSec’07] proposed an approach against side-channel attacks, which states that a symmetri...
Peng Wang, Dengguo Feng, Wenling Wu, Liting Zhang