Efficient Two Party and Multi Party Computation Against Covert Adversaries

DOI10.1007/978-3-540-78967-3_17zbMath1149.94317OpenAlexW2169802112MaRDI QIDQ5458598

No author found.

Publication date: 15 April 2008

Published in: Advances in Cryptology – EUROCRYPT 2008 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-78967-3_17

Mathematics Subject Classification ID

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

Related Items (13)

Secure Multiparty RAM Computation in Constant Rounds ⋮ Secure two-party computation via cut-and-choose oblivious transfer ⋮ The meeting businessmen problem: requirements and limitations ⋮ Generic compiler for publicly verifiable covert multi-party computation ⋮ Universally Composable Private Proximity Testing ⋮ From Passive to Covert Security at Low Cost ⋮ Truly Efficient String Oblivious Transfer Using Resettable Tamper-Proof Tokens ⋮ Efficiency Preserving Transformations for Concurrent Non-malleable Zero Knowledge ⋮ Black-box transformations from passive to covert security with public verifiability ⋮ Efficient compiler to covert security with public verifiability for honest majority MPC ⋮ Faster Secure Two-Party Computation in the Single-Execution Setting ⋮ Non-interactive Secure 2PC in the Offline/Online and Batch Settings ⋮ Hashing Garbled Circuits for Free

This page was built for publication: Efficient Two Party and Multi Party Computation Against Covert Adversaries