82 search results - page 3 / 17 » Inductive Proofs of Computational Secrecy |
158
Voted
CSFW
2005
IEEE
15 years 9 months ago
2005
IEEE
A number of key establishment protocols claim the property of forward secrecy, where the compromise of a longterm key does not result in the compromise of previously computed sess...
140
Voted
CTRS
1994
15 years 7 months ago
1994
133
Voted
MPC
1995
Springer
15 years 7 months ago
1995
Springer
We want to prove \automatically" that a program is correct with respect to a set of given properties that is a speci cation. Proofs of speci cations contain logical parts and ...
133
Voted
ASM
2010
ASM
15 years 10 months ago
2010
ASM
Abstract. This paper introduces the subject of secrecy models development by transformation, with formal validation. In an enterprise, constructing a secrecy model is a participato...
135
Voted
TPHOL
2007
IEEE
15 years 10 months ago
2007
IEEE
We propose a method to extract purely functional contents from logical inductive types in the context of the Calculus of Inductive Constructions. This method is based on a mode con...