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
EASYCRYPT proof assistant
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
biblio
Mechanizing the Proof of Adaptive, Information-Theoretic Security of Cryptographic Protocols in the Random Oracle Model
Submitted by grigby1 on Wed, 01/10/2018 - 12:20pm
pubcrawl
information-theoretic security
Metrics
multiparty cryptographic protocols
nonprogrammable random choices
oracle knowledge
party private count retrieval protocol
Policy
Protocols
information theoretic security
random oracle model
real-ideal paradigm
Resiliency
Scalability
security of data
Servers
Upper bound
adaptive adversaries
human factor
Human behavior
honest-but-curious security
games approach sequence
Games
game theory
game parameters
EASYCRYPT proof assistant
Databases
Cryptography
Cryptographic Protocols
concrete upper bounds
composability
Complexity theory
collaboration
