Secure Protocols with Asymmetric Trust

DOI10.1007/978-3-540-76900-2_22zbMath1153.94364OpenAlexW1573994738MaRDI QIDQ3498386

Matthias Fitzi, Jesper Buus Nielsen, Yvo G. Desmedt, Ivan B. Damgård

Publication date: 15 May 2008

Published in: Advances in Cryptology – ASIACRYPT 2007 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-76900-2_22

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Player simulation and general adversary structures in perfect multiparty computation
• How to share a secret
• Universally composable two-party and multi-party secure computation
• Reaching Agreement in the Presence of Faults
• Detectable byzantine agreement secure against faulty majorities
• Towards a Theory of Consistency Primitives

This page was built for publication: Secure Protocols with Asymmetric Trust