Skip to Main Content Area
CPS-VO
Contact Support
Browse
Calendar
Announcements
Repositories
Groups
Search
Search for Content
Search for a Group
Search for People
Search for a Project
Tagcloud
› Go to login screen
Not a member?
Click here to register!
Forgot username or password?
Cyber-Physical Systems Virtual Organization
Read-only archive of site from September 29, 2023.
CPS-VO
ideally authenticated communication
biblio
EasyUC: Using EasyCrypt to Mechanize Proofs of Universally Composable Security
Submitted by grigby1 on Wed, 12/11/2019 - 12:22pm
Games
universally composable security framework
universal composition operation
universal composability
Task Analysis
secure message communication
pubcrawl
proving simulation-based security
one-time-pad encryption
mechanized UC security analyses
Mechanization
ideally authenticated communication
ideal secure-communication functionality
ideal key-exchange functionality
hard computational problems
protocol verification
game-based security
formal verification
EASYCRYPT proof assistant
EasyCrypt
Diffie-Hellman protocol UC
Diffie-Hellman key-exchange
desired ideal functionality
Decisional Diffie-Hellman problem
Cryptography
Cryptographic Protocols
computer aided cryptography
composability
Complexity theory
complex protocols
