Pages that link to "Item:Q2874552"

The following pages link to FleXOR: Flexible Garbling for XOR Gates That Beats Free-XOR (Q2874552):

Displaying 21 items.

• FleXOR (Q35008) (← links)
• 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)
• Stacked garbling. Garbled circuit proportional to longest execution path (Q2096548) (← links)
• Better concrete security for half-gates garbling (in the multi-instance setting) (Q2096549) (← links)
• Three halves make a whole? Beating the half-gates lower bound for garbled circuits (Q2120069) (← links)
• Adaptive security of practical garbling schemes (Q2152063) (← links)
• Garbled circuits with sublinear evaluator (Q2169991) (← links)
• Fast garbling of circuits under standard assumptions (Q2413616) (← links)
• Linicrypt: A Model for Practical Cryptography (Q2829955) (← links)
• How to Circumvent the Two-Ciphertext Lower Bound for Linear Garbling Schemes (Q2953802) (← links)
• Garbled Circuits as Randomized Encodings of Functions: a Primer (Q5021129) (← links)
• Faster Secure Two-Party Computation in the Single-Execution Setting (Q5270369) (← links)
• Non-interactive Secure 2PC in the Offline/Online and Batch Settings (Q5270370) (← links)
• Hashing Garbled Circuits for Free (Q5270371) (← links)
• TinyKeys: a new approach to efficient multi-party computation (Q5918657) (← links)
• A new approach to garbled circuits (Q6535139) (← links)
• Geometry-based garbled circuits relying solely on one evaluation algorithm under standard assumption (Q6573661) (← links)
• Efficient arithmetic in garbled circuits (Q6637536) (← links)
• Garbled circuit lookup tables with logarithmic number of ciphertexts (Q6637543) (← links)
• How to garble mixed circuits that combine Boolean and arithmetic computations (Q6637574) (← links)