Faster maliciously secure two-party computation using the GPU

DOI10.1007/978-3-319-10879-7_21MaRDI QIDQ2922667zbMATH OpenOpenAlexFDO

Authors Jesper Buus Nielsen, Tore Kasper Frederiksen, Thomas Pelle Jakobsen

Publication date 14 October 2014

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-10879-7_21

Mathematics Subject Classification ID

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

Recommendations

• Fast cut-and-choose-based protocols for malicious and covert adversaries
• Faster secure two-party computation in the single-execution setting
• Fast Cut-and-Choose Based Protocols for Malicious and Covert Adversaries
• Two-output secure computation with malicious adversaries
• Secure two-party computation via cut-and-choose oblivious transfer

Cited in

(5)

• Faster homomorphic encryption over GPGPUs via hierarchical DGT
• On garbling schemes with and without privacy
• Fast cut-and-choose-based protocols for malicious and covert adversaries
• Reactive garbling: foundation, instantiation, application
• Faster secure two-party computation in the single-execution setting

Describes a project that uses

Uses Software

• TASTY

This page was built for publication: Faster maliciously secure two-party computation using the GPU

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