Revisiting the Efficiency of Malicious Two-Party Computation

DOI10.1007/978-3-540-72540-4_5zbMath1141.94378OpenAlexW1551111576MaRDI QIDQ5429384

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

efficiencysecure function evaluationexpander graphsmalicious model

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (7)

Round optimal black-box ``commit-and-prove ⋮ Enforcing input correctness via certification in garbled circuit evaluation ⋮ Implementing Two-Party Computation Efficiently with Security Against Malicious Adversaries ⋮ Accountable Storage ⋮ An Efficient Protocol for Fair Secure Two-Party Computation ⋮ Efficiency Preserving Transformations for Concurrent Non-malleable Zero Knowledge ⋮ An efficient protocol for secure two-party computation in the presence of malicious adversaries

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