Environmentally friendly composable multi-party computation in the plain model from standard (timed) assumptions
From MaRDI portal
Publication:2695656
DOI10.1007/978-3-030-90459-3_25OpenAlexW3186194563MaRDI QIDQ2695656
Jeremias Mechler, Brandon Broadnax, Jörn Müller-Quade
Publication date: 31 March 2023
Full work available at URL: https://doi.org/10.1007/978-3-030-90459-3_25
Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Distributed systems (68M14)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new approach to black-box concurrent secure computation
- Non-malleability vs. CCA-security: the case of commitments
- TARDIS: a foundation of time-lock puzzles in UC
- On the security of time-lock puzzles and timed commitments
- On Black-Box Complexity of Universally Composable Security in the CRS Model
- Adaptive Hardness and Composable Security in the Plain Model from Standard Assumptions
- Unconditionally Secure and Universally Composable Commitments from Physical Assumptions
- Adaptive and Concurrent Secure Computation from New Adaptive, Non-malleable Commitments
- Round-Efficient Black-Box Construction of Composable Multi-Party Computation
- Concurrently Secure Computation in Constant Rounds
- A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms
- Publicly verifiable proofs of sequential work
- Universally composable two-party and multi-party secure computation
- New notions of security
- New and improved constructions of non-malleable cryptographic protocols
- Concurrent general composition of secure protocols in the timing model
- Universally Composable Security with Global Setup
- Founding Cryptography on Oblivious Transfer – Efficiently
- A unified framework for concurrent security
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology - CRYPTO 2003
- Concurrently Composable Security with Shielded Super-Polynomial Simulators
- Computational Complexity
