1190 search results - page 130 / 238 » Secure off-the-record messaging |
109
Voted
CSFW
2007
IEEE
15 years 7 months ago
2007
IEEE
We present a new mechanized prover for showing correspondence assertions for cryptographic protocols in the computational model. Correspondence assertions are useful in particular...
123
Voted
ACNS
2007
Springer
15 years 7 months ago
2007
Springer
In 1990, Boyar, Chaum, Damg˚ard and Pedersen introduced convertible undeniable signatures which limit the self-authenticating property of digital signatures but can be converted b...
95
Voted
SPW
2005
Springer
15 years 6 months ago
2005
Springer
We examine several ad-hoc pairing protocols that strengthen their radio exchanges with additional transmissions over another channel, for example a screen showing graphically encod...
75
Voted
FSE
2003
Springer
15 years 6 months ago
2003
Springer
In this paper, we present One-key CBC MAC (OMAC) and prove its security for arbitrary length messages. OMAC takes only one key, K (k bits) of a block cipher E. Previously, XCBC req...
111
Voted
ASIAN
2006
Springer
15 years 4 months ago
2006
Springer
Given an arbitrary intruder deduction capability, modeled as an inference system S and a protocol, we show how to compute an inference system bS such that the security problem for ...