scientific article; zbMATH DE number 2086716
From MaRDI portal
Publication:4737255
Recommendations
Cited in
(54)- On the relationships between notions of simulation-based security
- Hidden shift quantum cryptanalysis and implications
- Simulatable channels: extended security that is universally composable and easier to prove
- Private set-intersection with common set-up
- Overcoming impossibility results in composable security using interval-wise guarantees
- Resource-restricted cryptography: revisiting MPC bounds in the proof-of-work era
- A unified and composable take on ratcheting
- The IITM model: a simple and expressive model for universal composability
- The TLS handshake protocol: A modular analysis
- A probabilistic polynomial-time process calculus for the analysis of cryptographic protocols
- Universally composable anonymous hash certification model
- Resource-aware protocols for authenticated group key exchange in integrated wired and wireless networks
- The reactive simulatability (RSIM) framework for asynchronous systems
- Unifying simulatability definitions in cryptographic systems under different timing assumptions
- scientific article; zbMATH DE number 1722690 (Why is no real title available?)
- Universally Composable Non-Interactive Key Exchange
- Structure-preserving smooth projective hashing
- Key Establishment Using Signcryption Techniques
- Ideal key derivation and encryption in simulation-based security
- Universally composable private proximity testing
- Analysis of the SSH key exchange protocol
- On Forward Secrecy in One-Round Key Exchange
- A Universally Composable Group Key Exchange Protocol with Minimum Communication Effort
- Equivalence of uniform key agreement and composition insecurity
- A Modular Security Analysis of the TLS Handshake Protocol
- Key Insulation and Intrusion Resilience over a Public Channel
- Security Analysis of Standard Authentication and Key Agreement Protocols Utilising Timestamps
- Secure Channels Based on Authenticated Encryption Schemes: A Simple Characterization
- Secret-key agreement over unauthenticated public channels-part I: definitions and a completeness result
- Automating Computational Proofs for Public-Key-Based Key Exchange
- Initiator-resilient universally composable key exchange
- Universally composable secure positioning in the bounded retrieval model
- A full proof of the BGW protocol for perfectly secure multiparty computation
- A Universally Composable Framework for the Analysis of Browser-Based Security Protocols
- Universally Composable Security Analysis of TLS
- Weakening the perfect encryption assumption in Dolev-Yao adversaries
- Unilaterally-authenticated key exchange
- Limits of the BRSIM/UC soundness of Dolev-Yao models with hashes
- Wireless-channel key exchange
- Sender-binding key encapsulation
- Password-authenticated TLS via OPAQUE and post-handshake authentication
- 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
- Almost optimal oblivious transfer from QA-NIZK
- Short concurrent covert authenticated key exchange (short cAKE)
- Practically efficient private set intersection from trusted hardware with side-channels
- A formal treatment of end-to-end encrypted cloud storage
- Latke: a framework for constructing identity-binding PAKEs
- Composing bridges
- Universally composable succinct vector commitments and applications
- Secure onion encryption and the case of counter Galois onion
- Ciphertext verification security of symmetric encryption schemes
- Using IND-CVA for constructing secure communication
- FORSAKES: a forward-secure authenticated key exchange protocol based on symmetric key-evolving schemes
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4737255)
