Unconditionally secure computation with reduced interaction

DOI10.1007/978-3-662-49896-5_15MaRDI QIDQ5739210zbMATH OpenOpenAlexFDO

Authors Jesper Buus Nielsen, Rafail Ostrovsky, Adi Rosén, Ivan B. Damgård

Publication date 15 July 2016

Published in Advances in Cryptology – EUROCRYPT 2016 (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• On the message complexity of secure multiparty computation
• Secure multiparty computation with minimal interaction
• Secure computation with minimal interaction, revisited
• Scalable and Unconditionally Secure Multiparty Computation
• Near-linear unconditionally-secure multiparty computation with a dishonest minority

Cited in

(3)

• Lower and upper bounds on the randomness complexity of private computations of AND
• Lower and upper bounds on the randomness complexity of private computations of AND
• Secure computation with low communication from cross-checking

This page was built for publication: Unconditionally secure computation with reduced interaction

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