Adaptive and concurrent secure computation from new adaptive, non-malleable commitments

DOI10.1007/978-3-642-42033-7_17MaRDI QIDQ2867225zbMATH OpenOpenAlexFDO

Authors Dana Dachman-Soled, Mariana Raykova, Muthuramakrishnan Venkitasubramaniam

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

Mathematics Subject Classification ID

Network protocols (68M12) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Cryptography (94A60)

Recommendations

• Concurrent Nonmalleable Commitments
• On adaptively secure protocols
• A unified framework for concurrent security
• Adaptive security of multi-party protocols, revisited
• Adaptive hardness and composable security in the plain model from standard assumptions

Cited in

(15)

• Committed MPC -- maliciously secure multiparty computation from homomorphic commitments
• Overcoming impossibility results in composable security using interval-wise guarantees
• On black-box complexity of universally composable security in the CRS model
• Adaptive security of multi-party protocols, revisited
• Environmentally friendly composable multi-party computation in the plain model from standard (timed) assumptions
• On adaptively secure protocols
• Composable Security in the Tamper-Proof Hardware Model Under Minimal Complexity
• Composable Adaptive Secure Protocols Without Setup Under Polytime Assumptions
• Equivocating Yao: constant-round adaptively secure multiparty computation in the plain model
• 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
• Simple, fast, efficient, and tightly-secure non-malleable non-interactive timed commitments
• Four-round black-box non-malleable schemes from one-way permutations
• Fully-secure MPC with minimal trust

This page was built for publication: Adaptive and concurrent secure computation from new adaptive, non-malleable commitments

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2867225)