3504 search results - page 17 / 701 » Secure protocol composition |
ESORICS
2012
Springer
13 years 4 hour ago
2012
Springer
We show that it is possible to achieve perfect forward secrecy in two-message key exchange (KE) protocols that satisfy even stronger security properties than provided by the extend...
106
click to vote
CRYPTO
2007
Springer
15 years 3 months ago
2007
Springer
Round complexity is a central measure of efficiency, and characterizing the round complexity of various cryptographic tasks is of both theoretical and practical importance. We show...
ENTCS
2006
14 years 9 months ago
2006
We formally define a notion of credit and responsibility within the Generalized Non Deducibility on Compositions framework. We investigate the validity of our definitions through ...
STOC
2010
ACM
15 years 2 months ago
2010
ACM
In STOC’05, von Ahn, Hopper and Langford introduced the notion of covert computation. In covert computation, a party runs a secure computation protocol over a covert (or stegano...
IJNSEC
2008
14 years 9 months ago
2008
This paper presents the Trust Level Routing (TLR) protocol, an extension of the optimized energy-delay routing (OEDR) protocol, focusing on the integrity, reliability and survivab...