Sciweavers

82 search results - page 3 / 17
» Inductive Proofs of Computational Secrecy
Sort
View
CSFW
2005
IEEE
14 years 4 months ago
Temporal Rank Functions for Forward Secrecy
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...
Rob Delicata, Steve A. Schneider
MPC
1995
Springer
125views Mathematics» more  MPC 1995»
14 years 2 months ago
Synthesizing Proofs from Programs in the Calculus of Inductive Constructions
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 ...
Catherine Parent
ASM
2010
ASM
14 years 5 months ago
Secrecy UML Method for Model Transformations
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...
Waël Hassan, Nadera Slimani, Kamel Adi, Luigi...
TPHOL
2007
IEEE
14 years 5 months ago
Extracting Purely Functional Contents from Logical Inductive Types
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...
David Delahaye, Catherine Dubois, Jean-Fréd...