Compilation of function representations for secure computing paradigms

DOI10.1007/978-3-030-75539-3_2OpenAlexW3139910702MaRDI QIDQ826238

Karim Baghery, Titouan Tanguy, Nigel P. Smart, Emmanuela Orsini, Cyprien Delpech De Saint Guilhem

Publication date: 20 December 2021

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

Mathematics Subject Classification ID

Computer system organization (68Mxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Fast large-scale honest-majority MPC for malicious adversaries
• The TinyTable protocol for 2-party secure computation, or: Gate-scrambling revisited
• \(\mathrm{SPD}\mathbb {Z}_{2^k}\): efficient MPC \(\mod 2^k\) for dishonest majority
• MArBLed circuits: mixing arithmetic and Boolean circuits with active security
• Multiparty Computation from Somewhat Homomorphic Encryption
• Practical Covertly Secure MPC for Dishonest Majority – Or: Breaking the SPDZ Limits
• Improved Primitives for Secure Multiparty Integer Computation
• Asynchronous Multiparty Computation: Theory and Implementation
• Concretely-Efficient Zero-Knowledge Arguments for Arithmetic Circuits and Their Application to Lattice-Based Cryptography
• Theory of Cryptography

This page was built for publication: Compilation of function representations for secure computing paradigms