scientific article; zbMATH DE number 5485432

MaRDI QIDQ3549592zbMATH OpenFDO

Authors Jonathan Katz

Publication date 5 January 2009

zbMATH Keywords

secure multiparty computationbest possible securitylogarithmic-round protocolsprotocols using polynomial number of roundssimultaneous message transmission

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Network protocols (68M12)

Cited in

(19)

• Almost-optimally fair multiparty coin-tossing with nearly three-quarters malicious
• On complete primitives for fairness
• On fully secure MPC with solitary output
• Quantum secure two-party Euclidean distance computation based on mutually unbiased bases
• MPC with synchronous security and asynchronous responsiveness
• Beyond honest majority: the round complexity of fair and robust multi-party computation
• Synchronizable fair exchange
• Three party secure computation with friends and foes
• Incentive-driven attacker for corrupting two-party protocols
• Protocols for multiparty coin toss with a dishonest majority
• Endemic oblivious transfer via random oracles, revisited
• An optimally fair coin toss
• Partial fairness in secure two-party computation
• Best of both worlds. Revisiting the spymasters double agent problem
• Threshold-optimal MPC with friends and foes
• \(1/p\)-secure multiparty computation without an honest majority and the best of both worlds
• Best-of-both-worlds multiparty quantum computation with publicly verifiable identifiable abort
• On Adaptively Secure Multiparty Computation with a Short CRS
• Almost-optimally fair multiparty coin-tossing with nearly three-quarters malicious

This page was built for publication:

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