Richer Efficiency/Security Trade-offs in 2PC

DOI10.1007/978-3-662-46494-6_11zbMATH Open1354.94036OpenAlexW310976367MaRDI QIDQ5261631FDOQ5261631

Authors: Vladimir Kolesnikov, Payman Mohassel, Ben Riva, Mike Rosulek 

Publication date: 6 July 2015

Published in: Theory of Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-46494-6_11

Recommendations

• Better security-efficiency trade-offs in permutation-based two-party computation
• Programmable and Parallel ECC Coprocessor Architecture: Tradeoffs between Area, Speed and Security
• On perfectly secure 2PC in the OT-hybrid model
• On perfectly secure 2PC in the OT-hybrid model
• Public Key Cryptography - PKC 2006
• On the design and security of RC2

Mathematics Subject Classification ID

Cryptography (94A60)

Cited In (3)

• Robust publicly verifiable covert security: limited information leakage and guaranteed correctness with low overhead
• Toward malicious constant-rate 2PC via arithmetic garbling
• Hashing garbled circuits for free

This page was built for publication: Richer Efficiency/Security Trade-offs in 2PC

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