Pages that link to "Item:Q2179391"
From MaRDI portal
The following pages link to MArBLed circuits: mixing arithmetic and Boolean circuits with active security (Q2179391):
Displaying 15 items.
- Compilation of function representations for secure computing paradigms (Q826238) (← links)
- Overlaying conditional circuit clauses for secure computation (Q1703937) (← links)
- Actively secure setup for SPDZ (Q2072211) (← links)
- Improved primitives for MPC over mixed arithmetic-binary circuits (Q2096551) (← links)
- \( \mathsf{Rabbit} \): efficient comparison for secure multi-party computation (Q2145391) (← links)
- Full-threshold actively-secure multiparty arithmetic circuit garbling (Q2146106) (← links)
- The cost of IEEE arithmetic in secure computation (Q2146109) (← links)
- Circuit amortization friendly encodingsand their application to statistically secure multiparty computation (Q2691586) (← links)
- MPClan: protocol suite for privacy-conscious computations (Q6110388) (← links)
- \textsf{Through the looking-glass}: benchmarking secure multi-party computation comparisons for \textsf{ReLU}'s (Q6164395) (← links)
- Manticore: a framework for efficient multiparty computation supporting real number and Boolean arithmetic (Q6176271) (← links)
- A new approach to efficient and secure fixed-point computation (Q6547972) (← links)
- Efficient secure multi-party computation for proof of custody in Ethereum sharding (Q6564095) (← links)
- Privacy-preserving edit distance computation using secret-sharing two-party computation (Q6619924) (← links)
- Compressing unit-vector correlations via sparse pseudorandom generators (Q6653033) (← links)
