scientific article; zbMATH DE number 2086716

zbMath1056.94511MaRDI QIDQ4737255

Ran Canetti, Hugo Krawczyk

Publication date: 11 August 2004

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2332/23320337.htm

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

cryptographic protocolskey exchangeproofs of securitycomposition of protocols

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (41)

A probabilistic polynomial-time process calculus for the analysis of cryptographic protocols ⋮ Universally composable secure positioning in the bounded retrieval model ⋮ Hidden shift quantum cryptanalysis and implications ⋮ Ciphertext verification security of symmetric encryption schemes ⋮ Using IND-CVA for constructing secure communication ⋮ Universally composable anonymous hash certification model ⋮ A unified and composable take on ratcheting ⋮ Wireless-channel key exchange ⋮ Sender-binding key encapsulation ⋮ Structure-Preserving Smooth Projective Hashing ⋮ Password-authenticated TLS via OPAQUE and post-handshake authentication ⋮ FORSAKES: a forward-secure authenticated key exchange protocol based on symmetric key-evolving schemes ⋮ Key-schedule security for the TLS 1.3 standard ⋮ Key encapsulation mechanism with tight enhanced security in the multi-user setting: impossibility result and optimal tightness ⋮ The IITM model: a simple and expressive model for universal composability ⋮ Simulatable channels: extended security that is universally composable and easier to prove ⋮ A Universally Composable Group Key Exchange Protocol with Minimum Communication Effort ⋮ Resource-aware protocols for authenticated group key exchange in integrated wired and wireless networks ⋮ Key Establishment Using Signcryption Techniques ⋮ The reactive simulatability (RSIM) framework for asynchronous systems ⋮ A full proof of the BGW protocol for perfectly secure multiparty computation ⋮ Unifying simulatability definitions in cryptographic systems under different timing assumptions ⋮ The TLS handshake protocol: A modular analysis ⋮ Weakening the perfect encryption assumption in Dolev-Yao adversaries ⋮ Automating Computational Proofs for Public-Key-Based Key Exchange ⋮ A Modular Security Analysis of the TLS Handshake Protocol ⋮ Private set-intersection with common set-up ⋮ Ideal Key Derivation and Encryption in Simulation-Based Security ⋮ Key Insulation and Intrusion Resilience over a Public Channel ⋮ On the relationships between notions of simulation-based security ⋮ Security Analysis of Standard Authentication and Key Agreement Protocols Utilising Timestamps ⋮ Universally Composable Private Proximity Testing ⋮ Analysis of the SSH Key Exchange Protocol ⋮ On Forward Secrecy in One-Round Key Exchange ⋮ A Universally Composable Framework for the Analysis of Browser-Based Security Protocols ⋮ Universally Composable Security Analysis of TLS ⋮ Unilaterally-Authenticated Key Exchange ⋮ Overcoming impossibility results in composable security using interval-wise guarantees ⋮ Limits of the BRSIM/UC Soundness of Dolev-Yao Models with Hashes ⋮ Initiator-Resilient Universally Composable Key Exchange ⋮ Resource-restricted cryptography: revisiting MPC bounds in the proof-of-work era

This page was built for publication: