Composable long-term security with rewinding
From MaRDI portal
Publication:6587965
DOI10.1007/978-3-031-48624-1_19zbMATH Open1545.94053MaRDI QIDQ6587965FDOQ6587965
Authors: Robin M. Berger, Brandon Broadnax, Michael Klooß, Jeremias Mechler, Joern Mueller-Quade, Astrid Ottenhues, Markus Raiber 
Publication date: 15 August 2024
Cites Work
- Concurrent zero knowledge, revisited
- Title not available (Why is that?)
- Foundations of Cryptography
- Leveled fully homomorphic signatures from standard lattices
- A Framework for Efficient and Composable Oblivious Transfer
- Title not available (Why is that?)
- Short and Stateless Signatures from the RSA Assumption
- A full proof of the BGW protocol for perfectly secure multiparty computation
- Universally composable two-party and multi-party secure computation
- New notions of security: achieving universal composability without trusted setup
- Universally Composable Security with Global Setup
- Title not available (Why is that?)
- Title not available (Why is that?)
- Long-Term Security and Universal Composability
- Universally composable security
- Long-term security and universal composability
- Title not available (Why is that?)
- Statistical concurrent non-malleable zero knowledge
- Statistical concurrent non-malleable zero-knowledge from one-way functions
- Adaptive hardness and composable security in the plain model from standard assumptions
- Round-Efficient Concurrently Composable Secure Computation via a Robust Extraction Lemma
- Unconditional and composable security using a single stateful Tamper-proof hardware token
- Universal composition with global subroutines: capturing global setup within plain UC
- Everlasting UC commitments from fully malicious PUFs
This page was built for publication: Composable long-term security with rewinding
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6587965)
