On Black-Box Complexity of Universally Composable Security in the CRS Model
From MaRDI portal
Publication:2795971
DOI10.1007/978-3-662-48800-3_8zbMath1375.94134OpenAlexW2293898425MaRDI QIDQ2795971
Carmit Hazay, Muthuramakrishnan Venkitasubramaniam
Publication date: 23 March 2016
Published in: Advances in Cryptology – ASIACRYPT 2015 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-48800-3_8
Related Items (9)
Composable Security in the Tamper-Proof Hardware Model Under Minimal Complexity ⋮ Composable Adaptive Secure Protocols Without Setup Under Polytime Assumptions ⋮ Universal Composition with Responsive Environments ⋮ Two-round adaptively secure MPC from isogenies, LPN, or CDH ⋮ Efficient and round-optimal oblivious transfer and commitment with adaptive security ⋮ Environmentally friendly composable multi-party computation in the plain model from standard (timed) assumptions ⋮ Constant Round Adaptively Secure Protocols in the Tamper-Proof Hardware Model ⋮ Concurrently Composable Security with Shielded Super-Polynomial Simulators ⋮ On black-box complexity of universally composable security in the CRS model
This page was built for publication: On Black-Box Complexity of Universally Composable Security in the CRS Model
