Concurrent composition of secure protocols in the timing model
From MaRDI portal
Publication:2463448
Recommendations
Cited in
(16)- General composition and universal composability in secure multiparty computation
- Dynamic ad hoc clock synchronization
- On black-box complexity of universally composable security in the CRS model
- Turn-based communication channels
- Secure composition of cryptographic protocols. (Abstract)
- Composable Security in the Tamper-Proof Hardware Model Under Minimal Complexity
- Composable Adaptive Secure Protocols Without Setup Under Polytime Assumptions
- An efficient secure real-time concurrency control protocol
- Concurrent general composition of secure protocols in the timing model
- Constraints Solution for Time Sensitive Security Protocols
- Local Sequentiality Does Not Help for Concurrent Composition
- Universally composable synchronous computation
- Constant round adaptively secure protocols in the tamper-proof hardware model
- Concurrently composable security with shielded super-polynomial simulators
- A formal analysis of timing channel security via bucketing
- Peeking into the future: MPC resilient to super-rushing adversaries
This page was built for publication: Concurrent composition of secure protocols in the timing model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2463448)