Pages that link to "Item:Q4924432"
From MaRDI portal
The following pages link to How to Hide Circuits in MPC an Efficient Framework for Private Function Evaluation (Q4924432):
Displaying 18 items.
- Practical attacks against the walnut digital signature scheme (Q1633439) (← links)
- Free IF: how to omit inactive branches and implement \(\mathcal{S}\)-universal garbled circuit (almost) for free (Q1710663) (← links)
- Private set operations from oblivious switching (Q2061976) (← links)
- Pushing the limits of Valiant's universal circuits: simpler, tighter and more compact (Q2128569) (← links)
- Improved zero-knowledge argument of encrypted extended permutation (Q2151308) (← links)
- Secure multiparty computation with free branching (Q2170008) (← links)
- Efficient and scalable universal circuits (Q2188968) (← links)
- Secret-shared shuffle (Q2691590) (← links)
- Maliciously circuit-private multi-key FHE and MPC based on LWE (Q2701482) (← links)
- Making Private Function Evaluation Safer, Faster, and Simpler (Q5087263) (← links)
- Non-interactive Secure 2PC in the Offline/Online and Batch Settings (Q5270370) (← links)
- Circuit-Private Multi-key FHE (Q5738758) (← links)
- Count me in! Extendability for threshold ring signatures (Q6113963) (← links)
- Practical multi-party private set intersection cardinality and intersection-sum under arbitrary collusion (Q6134016) (← links)
- Linear-Complexity Private Function Evaluation is Practical (Q6485994) (← links)
- Private Decision Tree Evaluation with Constant Rounds via (Only) Fair SS-4PC (Q6488389) (← links)
- Constant-round multiparty private function evaluation with (quasi-)linear complexities (Q6535112) (← links)
- Scalable multi-party private set union from multi-query secret-shared private membership test (Q6595683) (← links)
