scientific article
From MaRDI portal
Publication:3549592
zbMath1232.68045MaRDI QIDQ3549592
Publication date: 5 January 2009
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
secure multiparty computationbest possible securitylogarithmic-round protocolsprotocols using polynomial number of roundssimultaneous message transmission
Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Network protocols (68M12)
Related Items (16)
Incentive-driven attacker for corrupting two-party protocols ⋮ An optimally fair coin toss ⋮ Almost-Optimally Fair Multiparty Coin-Tossing with Nearly Three-Quarters Malicious ⋮ On fully secure MPC with solitary output ⋮ Almost-optimally fair multiparty coin-tossing with nearly three-quarters malicious ⋮ Partial fairness in secure two-party computation ⋮ Endemic oblivious transfer via random oracles, revisited ⋮ Best of both worlds. Revisiting the spymasters double agent problem ⋮ MPC with synchronous security and asynchronous responsiveness ⋮ An Almost-Optimally Fair Three-Party Coin-Flipping Protocol ⋮ \(1/p\)-secure multiparty computation without an honest majority and the best of both worlds ⋮ Beyond honest majority: the round complexity of fair and robust multi-party computation ⋮ Protocols for multiparty coin toss with a dishonest majority ⋮ On Adaptively Secure Multiparty Computation with a Short CRS ⋮ On Complete Primitives for Fairness ⋮ Quantum secure two-party Euclidean distance computation based on mutually unbiased bases
This page was built for publication:
