Efficient Two Party and Multi Party Computation Against Covert Adversaries

DOI10.1007/978-3-540-78967-3_17MaRDI QIDQ5458598zbMATH OpenOpenAlexFDO

Authors

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

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

Recommendations

• Security against covert adversaries: Efficient protocols for realistic adversaries
• Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries
• Efficient covert two-party computation
• Efficient multiparty computation for arithmetic circuits against a covert majority
• Covert two-party computation

Cited in

(29)

• The meeting businessmen problem: requirements and limitations
• Verifiable computation in multiparty protocols with honest majority
• Implementing Two-Party Computation Efficiently with Security Against Malicious Adversaries
• On the feasibility of consistent computations
• On the round complexity of covert computation
• Efficient covert two-party computation
• Covert two-party computation
• Efficient multiparty computation for arithmetic circuits against a covert majority
• Robust publicly verifiable covert security: limited information leakage and guaranteed correctness with low overhead
• Truly efficient string oblivious transfer using resettable tamper-proof tokens
• Faster secure two-party computation in the single-execution setting
• Non-interactive secure 2PC in the offline/online and batch settings
• Secure two-party computation via cut-and-choose oblivious transfer
• Secure multiparty RAM computation in constant rounds
• Universally composable private proximity testing
• Efficient compiler to covert security with public verifiability for honest majority MPC
• From Passive to Covert Security at Low Cost
• Generic compiler for publicly verifiable covert multi-party computation
• Efficiency preserving transformations for concurrent non-malleable zero knowledge
• Black-box transformations from passive to covert security with public verifiability
• Security against covert adversaries: Efficient protocols for realistic adversaries
• Hashing garbled circuits for free
• The complexity of memory checking with covert security
• On Adaptively Secure Multiparty Computation with a Short CRS
• Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries
• Adaptively Secure Two-Party Computation from Indistinguishability Obfuscation
• Efficient two-party exponentiation from quotient transfer
• One-Sided Adaptively Secure Two-Party Computation
• Efficient Secure Linear Algebra in the Presence of Covert or Computationally Unbounded Adversaries

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

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