Revisiting the Efficiency of Malicious Two-Party Computation

DOI10.1007/978-3-540-72540-4_5MaRDI QIDQ5429384zbMATH OpenOpenAlexFDO

Authors David P. Woodruff

Publication date 29 November 2007

Published in Advances in Cryptology - EUROCRYPT 2007 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-72540-4_5

zbMATH Keywords

efficiencyexpander graphsmalicious modelsecure function evaluation

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Public Key Cryptography - PKC 2006
• Secure two-party computation via cut-and-choose oblivious transfer
• Secure two-party computation via cut-and-choose oblivious transfer
• Implementing Two-Party Computation Efficiently with Security Against Malicious Adversaries
• An efficient protocol for secure two-party computation in the presence of malicious adversaries

Cited in

(9)

• Round optimal black-box ``commit-and-prove
• Enforcing input correctness via certification in garbled circuit evaluation
• An efficient protocol for secure two-party computation in the presence of malicious adversaries
• Efficiency preserving transformations for concurrent non-malleable zero knowledge
• Implementing Two-Party Computation Efficiently with Security Against Malicious Adversaries
• An Efficient Protocol for Fair Secure Two-Party Computation
• Public Key Cryptography - PKC 2006
• Maliciously secure massively parallel computation for all-but-one corruptions
• Accountable storage

This page was built for publication: Revisiting the Efficiency of Malicious Two-Party Computation

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