Unconditionally Secure Constant-Rounds Multi-party Computation for Equality, Comparison, Bits and exponentiation

2006

Presented at the IACR Theory of Cryptography Conference

Additional Metadata
THEME	Software (theme 1)
Publisher	Springer
Editor	S. Halevi , T. Rabin
Series	Lecture Notes in Computer Science
Conference	IACR Theory of Cryptography Conference
Organisation	Cryptology
Citation APA Style AAA Style APA Style Cell Style Chicago Style Harvard Style IEEE Style MLA Style Nature Style Vancouver Style American-Institute-of-Physics Style Council-of-Science-Editors Style BibTex Format Endnote Format RIS Format CSL Format DOIs only Format	Damgård, I., Fitzi, M., Kiltz, E., Nielsen, J. B., & Toft, T. (2006). Unconditionally Secure Constant-Rounds Multi-party Computation for Equality, Comparison, Bits and exponentiation. In S. Halevi & T. Rabin (Eds.), Proceedings of Theory of Cryptography Conference 2006 (pp. 285–304). Springer.

Publication