Efficient Three-Party Computation from Cut-and-Choose

DOI10.1007/978-3-662-44381-1_29zbMath1335.94039OpenAlexW1040951941MaRDI QIDQ2874556

Seung Geol Choi, Vassilis Zikas, Alex J. Malozemoff, Jonathan N. Katz

Publication date: 7 August 2014

Published in: Advances in Cryptology – CRYPTO 2014 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-44381-1_29

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

Related Items (9)

Two attacks on rank metric code-based schemes: RankSign and an IBE scheme ⋮ More Efficient Constant-Round Multi-party Computation from BMR and SHE ⋮ Secure computation with low communication from cross-checking ⋮ Scalable Multi-party Private Set-Intersection ⋮ On the exact round complexity of secure three-party computation ⋮ Low cost constant round MPC combining BMR and oblivious transfer ⋮ Probabilistic Termination and Composability of Cryptographic Protocols ⋮ Probabilistic termination and composability of cryptographic protocols ⋮ Efficient constant-round multi-party computation combining BMR and SPDZ

This page was built for publication: Efficient Three-Party Computation from Cut-and-Choose