21 search results - page 4 / 5 » Modelling of Pseudonymity under Probabilistic Linkability At... |
CRYPTO
2006
Springer
13 years 9 months ago
2006
Springer
This paper presents the first automatic technique for proving not only protocols but also primitives in the exact security computational model. Automatic proofs of cryptographic pr...
ESORICS
2008
Springer
13 years 7 months ago
2008
Springer
Abstract. The goal of Steganographic File Systems (SFSs) is to protect users from coercion attacks by providing plausible deniability on the existence of hidden files. We consider ...
ENTCS
2006
13 years 6 months ago
2006
We present the first cryptographically sound security proof of the well-known Otway-Rees protocol. More precisely, we show that the protocol is secure against arbitrary active att...
ICS
2010
Tsinghua U.
14 years 3 months ago
2010
Tsinghua U.
We introduce the notion of "non-malleable codes" which relaxes the notion of error-correction and errordetection. Informally, a code is non-malleable if the message cont...
CSFW
2005
IEEE
13 years 11 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...