Adaptively Secure Multi-Party Computation with Dishonest Majority
From MaRDI portal
Publication:2914256
DOI10.1007/978-3-642-32009-5_8zbMath1294.94047OpenAlexW1593059878MaRDI QIDQ2914256
Publication date: 25 September 2012
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-32009-5_8
Related Items (13)
Round-optimal and communication-efficient multiparty computation ⋮ Round-optimal multi-party computation with identifiable abort ⋮ Adaptively secure computation for RAM programs ⋮ Two-round adaptively secure MPC from isogenies, LPN, or CDH ⋮ Reverse firewalls for adaptively secure MPC without setup ⋮ Completeness theorems for adaptively secure broadcast ⋮ Adaptive security of multi-party protocols, revisited ⋮ Efficient one-sided adaptively secure computation ⋮ Constant Round Adaptively Secure Protocols in the Tamper-Proof Hardware Model ⋮ Adaptively secure MPC with sublinear communication complexity ⋮ On Adaptively Secure Multiparty Computation with a Short CRS ⋮ MPC with friends and foes ⋮ Equivocating Yao: Constant-Round Adaptively Secure Multiparty Computation in the Plain Model
This page was built for publication: Adaptively Secure Multi-Party Computation with Dishonest Majority
