Pages that link to "Item:Q3603006"

The following pages link to A Practical Universal Circuit Construction and Secure Evaluation of Private Functions (Q3603006):

Displaying 14 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)
• Masked triples. Amortizing multiplication triples across conditionals (Q2061960) (← links)
• Zero-knowledge proofs for committed symmetric Boolean functions (Q2118554) (← 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)
• Garbled circuits with sublinear evaluator (Q2169991) (← links)
• Efficient and scalable universal circuits (Q2188968) (← links)
• \texttt{MOTIF}: (almost) free branching in GMW. Via vector-scalar multiplication (Q2691578) (← links)
• How to Circumvent the Two-Ciphertext Lower Bound for Linear Garbling Schemes (Q2953802) (← links)
• One-Time Programs with Limited Memory (Q3454868) (← links)
• Improved Garbled Circuit: Free XOR Gates and Applications (Q3519525) (← links)
• Making Private Function Evaluation Safer, Faster, and Simpler (Q5087263) (← links)
• Hashing Garbled Circuits for Free (Q5270371) (← links)