82 search results - page 7 / 17 » Inductive Proofs of Computational Secrecy |
AAAI
1990
13 years 11 months ago
1990
Automating proofs by induction is important in many computer science and artificial intelligence applications, in particular in program verification and specification systems. We ...
WPES
2004
ACM
14 years 3 months ago
2004
ACM
Quite often on the Internet, cryptography is used to protect private, personal communications. However, most commonly, systems such as PGP are used, which use long-lived encryptio...
IPL
2006
13 years 9 months ago
2006
We present a Coq-formalised proof that all non-cooperative, sequential games have a Nash equilibrium point. Our proof methodology follows the style advocated by LCFstyle theorem p...
CIE
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. We study a realisability interpretation for inductive and coinductive definitions and discuss its application to program extraction from proofs. A speciality of this inte...
ESORICS
2009
Springer
14 years 10 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...