Sciweavers

154 search results - page 8 / 31
» Cryptographically Sound Theorem Proving
Sort
View
TGC
2005
Springer
14 years 1 months ago
Programming Cryptographic Protocols
Cryptographic protocols are useful for trust engineering in distributed transactions. Transactions require specific degrees of confidentiality and agreement between the principal...
Joshua D. Guttman, Jonathan C. Herzog, John D. Ram...
CSFW
2005
IEEE
14 years 1 months ago
Reconstruction of Attacks against Cryptographic Protocols
We study an automatic technique for the verification of cryptographic protocols based on a Horn clause model of the protocol. This technique yields proofs valid for an unbounded ...
Xavier Allamigeon, Bruno Blanchet
JLP
2000
140views more  JLP 2000»
13 years 7 months ago
An abductive event calculus planner
In 1969 Cordell Green presented his seminal description of planning as theorem proving with the situation calculus. The most pleasing feature of Green's account was the negli...
Murray Shanahan
FSTTCS
2010
Springer
13 years 5 months ago
Computationally Sound Abstraction and Verification of Secure Multi-Party Computations
ionally Sound Abstraction and Verification of Secure Multi-Party Computations Michael Backes Saarland University MPI-SWS Matteo Maffei Saarland University Esfandiar Mohammadi Saarl...
Michael Backes, Matteo Maffei, Esfandiar Mohammadi
OOPSLA
2001
Springer
14 years 3 days ago
Contract Soundness for Object-Oriented Languages
Checking pre- and post-conditions of procedures and methods at runtime helps improve software reliability. In the procedural world, pre- and post-conditions have a straightforward...
Robert Bruce Findler, Matthias Felleisen