Commodity-based 2PC for arithmetic circuits

DOI10.1007/978-3-030-35199-1_8MaRDI QIDQ2177658zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 6 May 2020

Full work available at URL https://pure.au.dk/portal/da/publications/commoditybased-2pc-for-arithmetic-circuits(586f5582-84c7-4cd9-a42b-a0d3368a3b64).html

zbMATH Keywords

secure two-party computationinformation theoretic securityoblivious linear evaluationcommodity-based cryptography

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• scientific article; zbMATH DE number 1559560
• Unconditionally Secure Homomorphic Pre-distributed Bit Commitment and Secure Two-Party Computations
• Committed MPC -- maliciously secure multiparty computation from homomorphic commitments
• Secure multiparty computation with sublinear preprocessing
• Secure multi-party computation minimizing online rounds

Cited in

(1)

• scientific article; zbMATH DE number 1559560 (Why is no real title available?)

This page was built for publication: Commodity-based 2PC for arithmetic circuits

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