How to garble mixed circuits that combine Boolean and arithmetic computations

DOI10.1007/978-3-031-58751-1_12MaRDI QIDQ6637574zbMATH OpenFDO

Authors Hanjun Li, Tianren Liu

Publication date 13 November 2024

Full work available at URL https://doi.org/10.1007/978-3-031-58751-1_12

zbMATH Keywords

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

Mathematics Subject Classification ID

Cryptography (94A60)

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

Cites work

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

Cited in

(5)

• New ways to garble arithmetic circuits
• A unified framework for succinct garbling from homomorphic secret sharing
• Efficient mixed garbling from homomorphic secret sharing and GGM-tree
• Rate-1 arithmetic garbling from homomorphic secret sharing
• \textsf{Zebra}: arithmetic garbled RAM for large words from DCR

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)