154 search results - page 30 / 31 » Cryptographically Sound Theorem Proving |
FAC
2010
13 years 3 months ago
2010
Data refinement is a common approach to reasoning about programs, based on establishing that te program indeed satisfies all the required properties imposed by an intended abstract...
KI
2010
Springer
13 years 16 days ago
2010
Springer
Hybrid systems are models for complex physical systems and are defined as dynamical systems with interacting discrete transitions and continuous evolutions along differential equa...
IMA
2009
Springer
14 years 9 days ago
2009
Springer
Abstract. We provide the first proof of security for Abreast-DM, one of the oldest and most wellknown constructions for turning a block cipher with n-bit block length and 2n-bit k...
ESORICS
2009
Springer
14 years 6 months ago
2009
Springer
Abstract. Several generic constructions for transforming one-way functions to asymmetric encryption schemes have been proposed. One-way functions only guarantee the weak secrecy of...
ESOP
2010
Springer
14 years 3 months ago
2010
Springer
Formal reasoning about concurrent programs is usually done with the assumption that the underlying memory model is sequentially consistent, i.e. the execution outcome is equivalen...