Skip to main navigation
Skip to search
Skip to main content
Tel Aviv University Home
Update Request & User Guide (TAU staff only)
Home
Experts
Research units
Research output
Datasets
Prizes
Activities
Press/Media
Search by expertise, name or affiliation
Universally composable symbolic security analysis
Ran Canetti
*
, Jonathan Herzog
*
Corresponding author for this work
School of Computer Science
Massachusetts Institute of Technology
Research output
:
Contribution to journal
›
Article
›
peer-review
18
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Universally composable symbolic security analysis'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
A-priori Bounds
50%
Automated Analysis
50%
Composable
50%
Composable Security
50%
Concrete Security
100%
Cryptographic Applications
50%
Cryptographic Protocols
50%
Direct Analysis
50%
Full Automation
50%
Fully Automated
50%
Key Exchange
50%
Key Exchange Protocol
50%
Number of Components
50%
Overall System
50%
Security Analysis
100%
Security Assurance
50%
Security Framework
50%
Security Properties
50%
Symbolic Analysis
100%
Symbolic Security
100%
Time Complexity
50%
Universally Composable
100%
Universally Composable Security
50%
Computer Science
Analyzed System
25%
Authentication
25%
Automated Analysis
25%
Cryptographic Application
25%
Cryptographic Protocol
25%
Growing Complexity
25%
Individual Component
25%
Key Exchange Protocol
25%
Security Analysis
100%
Security Framework
25%
Security Properties
25%
Space Complexity
25%
Time Complexity
25%