From Passive to Covert Security at Low Cost

DOI10.1007/978-3-642-11799-2_9zbMath1274.94058OpenAlexW1528698042MaRDI QIDQ3408191

Martin Geisler, Jesper Buus Nielsen, Ivan B. Damgård

Publication date: 24 February 2010

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

Full work available at URL: https://doi.org/10.1007/978-3-642-11799-2_9

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (5)

Secure Outsourced Computation ⋮ Generic compiler for publicly verifiable covert multi-party computation ⋮ From Passive to Covert Security at Low Cost ⋮ Black-box transformations from passive to covert security with public verifiability ⋮ Efficient compiler to covert security with public verifiability for honest majority MPC

Cites Work

• Unnamed Item
• Unnamed Item
• Optimal amortized distributed consensus
• From Passive to Covert Security at Low Cost
• Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries
• Scalable Multiparty Computation with Nearly Optimal Work and Resilience
• Scalable and Unconditionally Secure Multiparty Computation
• Secure Multiparty Computation Goes Live
• Sequential composition of protocols without simultaneous termination
• Perfectly-Secure MPC with Linear Communication Complexity
• Efficient Two Party and Multi Party Computation Against Covert Adversaries

This page was built for publication: From Passive to Covert Security at Low Cost