An example of proving UC-realization with formal methods - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2006

An example of proving UC-realization with formal methods

Abstract

In the universal composability framework we consider ideal functionalities for secure messaging and signcryption. Using traditional formal methods techniques we show that the secure messaging functionality can be UC-realized by a hybrid protocol that uses the signcryption functionality and a public key infrastructure functionality. We also discuss that the signcryption functionality can be UC-realized by a secure signcryption scheme.
Fichier principal
Vignette du fichier
paper9.pdf (194.71 Ko) Télécharger le fichier
Loading...

Dates and versions

inria-00080685 , version 1 (20-06-2006)

Identifiers

  • HAL Id : inria-00080685 , version 1

Cite

Suzana Andova, Kristian Gjøsteen, Lillian Kråkmo, Stig Frode Mjølsnes, Saša Radomirović. An example of proving UC-realization with formal methods. Workshop on Formal and Computational Cryptography (FCC 2006), Véronique Cortier et Steve Kremer, Jul 2006, Venice/Italy. ⟨inria-00080685⟩

Collections

FCC2006
61 View
96 Download

Share

Gmail Facebook Twitter LinkedIn More