Adaptive and Concurrent Secure Computation from New Adaptive, Non-malleable Commitments
From MaRDI portal
Publication:2867225
DOI10.1007/978-3-642-42033-7_17zbMath1328.68024OpenAlexW1904753036MaRDI QIDQ2867225
Mariana Raykova, Tal Malkin, Muthuramakrishnan Venkitasubramaniam, Dana Dachman-Soled
Publication date: 10 December 2013
Published in: Advances in Cryptology - ASIACRYPT 2013 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-42033-7_17
Cryptography (94A60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Network protocols (68M12)
Related Items
Composable Security in the Tamper-Proof Hardware Model Under Minimal Complexity, Composable Adaptive Secure Protocols Without Setup Under Polytime Assumptions, Four-round black-box non-malleable schemes from one-way permutations, Fully-secure MPC with minimal trust, 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, Adaptively secure MPC with sublinear communication complexity, On black-box complexity of universally composable security in the CRS model, Equivocating Yao: Constant-Round Adaptively Secure Multiparty Computation in the Plain Model
