A Simpler Variant of Universally Composable Security for Standard Multiparty Computation
From MaRDI portal
Publication:3457057
DOI10.1007/978-3-662-48000-7_1zbMath1351.94031OpenAlexW1458516385MaRDI QIDQ3457057
Yehuda Lindell, Ran Canetti, Asaf Cohen
Publication date: 10 December 2015
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-48000-7_1
Related Items (19)
More Efficient Constant-Round Multi-party Computation from BMR and SHE ⋮ Supersingular curves you can trust ⋮ Adaptive Oblivious Transfer and Generalization ⋮ Efficient Generic Zero-Knowledge Proofs from Commitments (Extended Abstract) ⋮ SoftSpokenOT: quieter OT extension from small-field silent VOLE in the Minicrypt model ⋮ Completeness theorems for adaptively secure broadcast ⋮ Cryptographic shallots: a formal treatment of repliable onion encryption ⋮ The IITM model: a simple and expressive model for universal composability ⋮ TinyKeys: a new approach to efficient multi-party computation ⋮ Simplified Universal Composability Framework ⋮ High-performance multi-party computation for binary circuits based on oblivious transfer ⋮ Low cost constant round MPC combining BMR and oblivious transfer ⋮ Trinocchio: Privacy-Preserving Outsourcing by Distributed Verifiable Computation ⋮ BETA: biometric-enabled threshold authentication ⋮ Probabilistic Termination and Composability of Cryptographic Protocols ⋮ Probabilistic termination and composability of cryptographic protocols ⋮ Efficient and tight oblivious transfer from PKE with tight multi-user security ⋮ How to Simulate It – A Tutorial on the Simulation Proof Technique ⋮ Formalizing data deletion in the context of the right to be forgotten
Uses Software
Cites Work
This page was built for publication: A Simpler Variant of Universally Composable Security for Standard Multiparty Computation
