Automatic protocol selection in secure two-party computations

DOI10.1007/978-3-319-07536-5_33MaRDI QIDQ5168566zbMATH OpenOpenAlexFDO

Authors Florian Kerschbaum, Thomas Schneider, Axel Schröpfer

Publication date 7 July 2014

Published in Applied Cryptography and Network Security (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-07536-5_33

zbMATH Keywords

optimizationperformanceprotocol selectionsecure two-party computation

Mathematics Subject Classification ID

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

Recommendations

• Efficient secure two-party computation using symmetric cut-and-choose
• Secure two-party computation is practical
• Faster secure two-party computation in the single-execution setting
• Secure two-party computation via cut-and-choose oblivious transfer
• Secure two-party computation via cut-and-choose oblivious transfer

Cited in

(3)

• MArBLed circuits: mixing arithmetic and Boolean circuits with active security
• An efficient secure division protocol using approximate multi-bit product and new constant-round building blocks
• scientific article; zbMATH DE number 2048535 (Why is no real title available?)

Describes a project that uses

Uses Software

• TASTY

This page was built for publication: Automatic protocol selection in secure two-party computations

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