7 search results - page 1 / 2 » Random Polynomial-Time Attacks and Dolev-Yao Models |
JALC
2006
13 years 5 months ago
2006
In this paper we present an extension of Dolev-Yao models for security protocols with a notion of random polynomial-time (Las Vegas) computability. First we notice that Dolev-Yao ...
CSFW
2005
IEEE
13 years 10 months ago
2005
IEEE
We present the first cryptographically sound Dolev-Yaostyle security proof of a comprehensive electronic payment system. The payment system is a slightly simplified variant of t...
CSFW
2007
IEEE
13 years 11 months ago
2007
IEEE
Key conjuring is the process by which an attacker obtains an unknown, encrypted key by repeatedly calling a cryptographic API function with random values in place of keys. We prop...
ADHOC
2007
13 years 5 months ago
2007
We investigate the problem of modeling node capture attacks in heterogeneous wireless ad hoc and mesh networks. Classical adversarial models such as the Dolev–Yao model are know...
CRYPTO
2003
Springer
13 years 10 months ago
2003
Springer
Abstract. In this paper, we reconsider the notion of plaintext awareness. We present a new model for plaintext-aware encryption that is both natural and useful. We achieve plaintex...