Secure Computability of Functions in the IT Setting with Dishonest Majority and Applications to Long-Term Security

DOI10.1007/978-3-642-00457-5_15zbMath1213.94118OpenAlexW1779849045MaRDI QIDQ3611769

Dominik Raub, Jörn Müller-Quade, Robin Künzler

Publication date: 3 March 2009

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

Full work available at URL: https://doi.org/10.1007/978-3-642-00457-5_15

zbMATH Keywords

secure function evaluationinformation-theoretic securitylong-term securitycorrupted majority

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (2)

Computational hardness of optimal fair computation: beyond Minicrypt ⋮ The Limits of Common Coins: Further Results

This page was built for publication: Secure Computability of Functions in the IT Setting with Dishonest Majority and Applications to Long-Term Security