Sciweavers

1059 search results - page 56 / 212
» Modeling Security Protocols as Games
Sort
View
IACR
2011
255views more  IACR 2011»
12 years 9 months ago
A Standard-Model Security Analysis of TLS-DHE
TLS is the most important cryptographic protocol in use today. However, up to now there is no complete cryptographic security proof in the standard model, nor in any other model. ...
Tibor Jager, Florian Kohlar, Sven Schäge, J&o...
CORR
2011
Springer
175views Education» more  CORR 2011»
13 years 1 months ago
Extracting and Verifying Cryptographic Models from C Protocol Code by Symbolic Execution
Consider the problem of verifying security properties of a cryptographic protocol coded in C. We propose an automatic solution that needs neither a pre-existing protocol descripti...
Mihhail Aizatulin, Andrew D. Gordon, Jan Jürj...
IFIP
2009
Springer
13 years 7 months ago
Finite Models in FOL-Based Crypto-Protocol Verification
Cryptographic protocols can only be secure under certain inequality assumptions. Axiomatizing these inequalities explicitly is problematic: stating too many inequalities may impair...
Jan Jürjens, Tjark Weber
ATC
2007
Springer
14 years 4 months ago
Malicious Participants in Group Key Exchange: Key Control and Contributiveness in the Shadow of Trust
Group key exchange protocols allow their participants to compute a secret key which can be used to ensure security and privacy for various multi-party applications. The resulting g...
Emmanuel Bresson, Mark Manulis
JOC
2008
86views more  JOC 2008»
13 years 10 months ago
Lower Bounds and Impossibility Results for Concurrent Self Composition
In the setting of concurrent self composition, a single protocol is executed many times concurrently by a single set of parties. In this paper, we prove lower bounds and impossibi...
Yehuda Lindell