From Passive to Covert Security at Low Cost

DOI10.1007/978-3-642-11799-2_9MaRDI QIDQ3408191zbMATHOpenAlexFDO

Authors 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)

Recommendations

• Usability aware secret protection with minimum cost
• scientific article; zbMATH DE number 1149908
• Practical covert authentication
• The price of active security in cryptographic protocols
• Security against covert adversaries: Efficient protocols for realistic adversaries
• Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries
• Covert security with public verifiability: faster, leaner, and simpler
• Mitigating covert channels based on analysis of the potential for communication
• Low-cost cryptography for privacy in RFID systems

Cites work

• scientific article; zbMATH DE number 1942435 (Why is no real title available?)
• scientific article; zbMATH DE number 1942445 (Why is no real title available?)
• Efficient Two Party and Multi Party Computation Against Covert Adversaries
• From Passive to Covert Security at Low Cost
• Optimal amortized distributed consensus
• Perfectly-Secure MPC with Linear Communication Complexity
• Scalable Multiparty Computation with Nearly Optimal Work and Resilience
• Scalable and Unconditionally Secure Multiparty Computation
• Secure multiparty computation goes live
• Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries
• Sequential composition of protocols without simultaneous termination

Cited in

(13)

• From Passive to Covert Security at Low Cost
• Financially backed covert security
• Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries
• Efficient compiler to covert security with public verifiability for honest majority MPC
• On the feasibility of consistent computations
• Generic compiler for publicly verifiable covert multi-party computation
• NTRU prime: reducing attack surface at low cost
• Calling out cheaters: covert security with public verifiability
• Robust publicly verifiable covert security: limited information leakage and guaranteed correctness with low overhead
• Black-box transformations from passive to covert security with public verifiability
• Security against covert adversaries: Efficient protocols for realistic adversaries
• Public verifiability in the covert model (almost) for free
• Secure outsourced computation

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

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