One-time tables for two-party computation

DOI10.1007/3-540-68535-9_40MaRDI QIDQ4218439zbMATH OpenFDO

Authors Donald Beaver

Publication date 7 March 2000

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

Full work available at URL https://doi.org/10.1007/3-540-68535-9_40

zbMATH Keywords

two-party one-time tabletwo-party secure computation

Mathematics Subject Classification ID

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

Recommendations

• Secure two-party computation with reusable bit-commitments, via a cut-and-choose with forge-and-lose technique (extended abstract)
• Secure two-party computation over a Z-channel
• Secure two-party computation: a visual way
• Information Security and Cryptology
• Secure multiparty computation and secret sharing

Cited in

(2)

• The TinyTable protocol for 2-party secure computation, or: Gate-scrambling revisited
• SecureBiNN: 3-party secure computation for binarized neural network inference

This page was built for publication: One-time tables for two-party computation

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