Error detection in monotone span programs with application to communication-efficient multi-party computation

DOI10.1007/978-3-030-12612-4_11MaRDI QIDQ2290451zbMATH OpenOpenAlexFDO

Authors N. P. Smart, Tim Wood

Publication date 28 January 2020

Full work available at URL https://lirias.kuleuven.be/handle/123456789/637522

Mathematics Subject Classification ID

Cryptography (94A60) Theory of data (68Pxx)

Recommendations

• Communication-efficient MPC for general adversary structures
• Perfectly-Secure MPC with Linear Communication Complexity
• Progress in Cryptology - INDOCRYPT 2003
• Applied Cryptography and Network Security
• Construction of a monotone span program with multiplication

Cited in

(6)

• Gladius: LWR Based Efficient Hybrid Public Key Encryption with Distributed Decryption
• MArBLed circuits: mixing arithmetic and Boolean circuits with active security
• \textsf{Through the looking-glass}: benchmarking secure multi-party computation comparisons for \textsf{ReLU}'s
• MPC for \(\mathcal{Q}_2\) access structures over rings and fields
• The cost of IEEE arithmetic in secure computation
• Private liquidity matching using MPC

This page was built for publication: Error detection in monotone span programs with application to communication-efficient multi-party computation

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