How to garble mixed circuits that combine Boolean and arithmetic computations

DOI10.1007/978-3-031-58751-1_12MaRDI QIDQ6637574FDOQ6637574

Authors: Hanjun Li, Tianren Liu 

Publication date: 13 November 2024

Recommendations

• New ways to garble arithmetic circuits
• On multiparty garbling of arithmetic circuits
• How to garble arithmetic circuits
• A new approach to garbled circuits
• MArBLed circuits: mixing arithmetic and Boolean circuits with active security

zbMATH Keywords

mixed GC based on computational assumptionsmixed GC in the random oracle model

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• Flexor: Flexible garbling for XOR gates that beats free-XOR
• Title not available (Why is that?)
• Improved Garbled Circuit: Free XOR Gates and Applications
• Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
• Garbling XOR gates ``for free in the standard model
• Secure two-party computation is practical
• How to Garble Arithmetic Circuits
• Two halves make a whole: reducing data transfer in garbled circuits using half gates
• Fast garbling of circuits under standard assumptions
• Candidate iO from homomorphic encryption schemes
• Three halves make a whole? Beating the half-gates lower bound for garbled circuits
• New ways to garble arithmetic circuits

Cited In (1)

• New ways to garble arithmetic circuits

This page was built for publication: How to garble mixed circuits that combine Boolean and arithmetic computations

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