The following pages link to Two Halves Make a Whole (Q2948384):
Displayed 20 items.
- Exploring crypto dark matter: new simple PRF candidates and their applications (Q1631360) (← links)
- Practical attacks against the walnut digital signature scheme (Q1633439) (← links)
- An efficient structural attack on NIST submission DAGS (Q1633442) (← links)
- Shortest vector from lattice sieving: a few dimensions for free (Q1648783) (← links)
- Homomorphic \(\mathrm {SIM}^2\)D operations: single instruction much more data (Q1648801) (← links)
- Optimal forgeries against polynomial-based MACs and GCM (Q1648808) (← links)
- On multiparty garbling of arithmetic circuits (Q1710662) (← links)
- Free IF: how to omit inactive branches and implement \(\mathcal{S}\)-universal garbled circuit (almost) for free (Q1710663) (← links)
- Concretely efficient large-scale MPC with active security (or tinykeys for tinyot) (Q1710665) (← links)
- Fast garbling of circuits under standard assumptions (Q2413616) (← links)
- Network Oblivious Transfer (Q2829221) (← links)
- Linicrypt: A Model for Practical Cryptography (Q2829955) (← links)
- Efficient Zero-Knowledge Proof of Algebraic and Non-Algebraic Statements with Applications to Privacy Preserving Credentials (Q2829958) (← links)
- How to Circumvent the Two-Ciphertext Lower Bound for Linear Garbling Schemes (Q2953802) (← links)
- Cross and Clean: Amortized Garbled Circuits with Constant Overhead (Q3179371) (← 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)
- High-Throughput Secure Three-Party Computation for Malicious Adversaries and an Honest Majority (Q5738976) (← links)
- Block cipher invariants as eigenvectors of correlation matrices (Q5915627) (← links)