An example of proving UC-realization with formal methods

S. Andova, K. Gjøsteen, L. Kråkmo, S. F. Mjølsnes, S. Radomirović

Research output: Contribution to conferencePaper

20 Downloads (Pure)

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.
Original languageEnglish
Pages46-54
Number of pages9
Publication statusPublished - 9 Jul 2006
Event2nd Workshop on Formal and Computational Cryptography - Venice, Italy
Duration: 9 Jul 20069 Jul 2006

Workshop

Workshop2nd Workshop on Formal and Computational Cryptography
Abbreviated titleFCC 2006
CountryItaly
CityVenice
Period9/07/069/07/06
OtherCo-located with ICALP'06 and CSFW'06

Fingerprint Dive into the research topics of 'An example of proving UC-realization with formal methods'. Together they form a unique fingerprint.

Cite this