GNUC: a new universal composability framework
From MaRDI portal
Publication:2516522
DOI10.1007/s00145-013-9160-yzbMath1356.94062OpenAlexW2123352750MaRDI QIDQ2516522
Publication date: 3 August 2015
Published in: Journal of Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00145-013-9160-y
Related Items (18)
MoSS: modular security specifications framework ⋮ Short variable length domain extenders with beyond birthday bound security ⋮ UC-secure cryptographic reverse firewall-guarding corrupted systems with the minimum trusted module ⋮ Polynomial runtime and composability ⋮ Embedding the UC model into the IITM model ⋮ Universally Composable Firewall Architectures Using Trusted Hardware ⋮ Universal Composition with Responsive Environments ⋮ Universally Composable Cryptographic Role-Based Access Control ⋮ Giving an adversary guarantees (or: how to model designated verifier signatures in a composable framework) ⋮ Categorical composable cryptography: extended version ⋮ Categorical composable cryptography ⋮ The IITM model: a simple and expressive model for universal composability ⋮ Joint state composition theorems for public-key encryption and digital signature functionalities with local computation ⋮ State separation for code-based game-playing proofs ⋮ On the (im-)possibility of extending coin toss ⋮ TARDIS: a foundation of time-lock puzzles in UC ⋮ GNUC ⋮ A Modular Treatment of Cryptographic APIs: The Symmetric-Key Case
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Security and composition of multiparty cryptographic protocols
- The IITM model: a simple and expressive model for universal composability
- Polynomial runtime and composability
- The reactive simulatability (RSIM) framework for asynchronous systems
- Universally composable two-party and multi-party secure computation
- Credential Authenticated Identification and Key Exchange
- Universally Composable Security with Global Setup
- On the Portability of Generalized Schnorr Proofs
- Secure Multiparty Computation Goes Live
- Solving Simultaneous Modular Equations of Low Degree
- On the Composition of Zero-Knowledge Proof Systems
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology - CRYPTO 2003
- Secure Computation Without Authentication
- Universally Composable Security Analysis of TLS
- Theory of Cryptography
This page was built for publication: GNUC: a new universal composability framework