Pages that link to "Item:Q2413616"
From MaRDI portal
The following pages link to Fast garbling of circuits under standard assumptions (Q2413616):
Displaying 20 items.
- On multiparty garbling of arithmetic circuits (Q1710662) (← links)
- \textsf{LogStack}: stacked garbling with \(O(b \log b)\) computation (Q2056778) (← 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)
- The price of active security in cryptographic protocols (Q2119012) (← links)
- TNT: how to tweak a block cipher (Q2119027) (← links)
- Three halves make a whole? Beating the half-gates lower bound for garbled circuits (Q2120069) (← links)
- Threshold Schnorr with stateless deterministic signing from standard assumptions (Q2120070) (← links)
- Adaptive security of practical garbling schemes (Q2152063) (← links)
- Secure two-party computation in a quantum world (Q2229292) (← links)
- Linicrypt: A Model for Practical Cryptography (Q2829955) (← links)
- How to Circumvent the Two-Ciphertext Lower Bound for Linear Garbling Schemes (Q2953802) (← links)
- Scalable Multi-party Private Set-Intersection (Q5738787) (← links)
- Public-Seed Pseudorandom Permutations (Q5738982) (← links)
- Block cipher invariants as eigenvectors of correlation matrices (Q5915627) (← links)
- High-throughput secure three-party computation with an honest majority (Q6110385) (← links)
- Breaking and fixing garbled circuits when a gate has duplicate input wires (Q6176274) (← links)
- Geometry-based garbled circuits relying solely on one evaluation algorithm under standard assumption (Q6573661) (← links)
- Efficient arithmetic in garbled circuits (Q6637536) (← links)
- How to garble mixed circuits that combine Boolean and arithmetic computations (Q6637574) (← links)
