Composable long-term security with rewinding
From MaRDI portal
Publication:6587965
Recommendations
Cites work
- scientific article; zbMATH DE number 176545 (Why is no real title available?)
- scientific article; zbMATH DE number 177820 (Why is no real title available?)
- scientific article; zbMATH DE number 1942445 (Why is no real title available?)
- scientific article; zbMATH DE number 1559560 (Why is no real title available?)
- scientific article; zbMATH DE number 1842484 (Why is no real title available?)
- A Framework for Efficient and Composable Oblivious Transfer
- A full proof of the BGW protocol for perfectly secure multiparty computation
- Adaptive hardness and composable security in the plain model from standard assumptions
- Concurrent zero knowledge, revisited
- Everlasting UC commitments from fully malicious PUFs
- Foundations of Cryptography
- Leveled fully homomorphic signatures from standard lattices
- Long-Term Security and Universal Composability
- Long-term security and universal composability
- New notions of security: achieving universal composability without trusted setup
- Round-Efficient Concurrently Composable Secure Computation via a Robust Extraction Lemma
- Short and Stateless Signatures from the RSA Assumption
- Statistical concurrent non-malleable zero knowledge
- Statistical concurrent non-malleable zero-knowledge from one-way functions
- Unconditional and composable security using a single stateful Tamper-proof hardware token
- Universal composition with global subroutines: capturing global setup within plain UC
- Universally Composable Security with Global Setup
- Universally composable security
- Universally composable two-party and multi-party secure computation
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)
