Pages that link to "Item:Q1710662"
From MaRDI portal
The following pages link to On multiparty garbling of arithmetic circuits (Q1710662):
Displaying 7 items.
- \(k\)-round multiparty computation from \(k\)-round oblivious transfer via garbled interactive circuits (Q1648849) (← links)
- Privacy-free garbled circuits for formulas: size zero and information-theoretic (Q1675725) (← links)
- Fast garbling of circuits over 3-valued logic (Q1749304) (← links)
- Improved primitives for MPC over mixed arithmetic-binary circuits (Q2096551) (← links)
- Full-threshold actively-secure multiparty arithmetic circuit garbling (Q2146106) (← links)
- MArBLed circuits: mixing arithmetic and Boolean circuits with active security (Q2179391) (← links)
- Towards practical multi-key TFHE: parallelizable, key-compatible, quasi-linear complexity (Q6635903) (← links)