The following pages link to Theory of Cryptography (Q5901786):
Displaying 16 items.
- Smooth projective hashing and two-message oblivious transfer (Q421036) (← links)
- Non-interactive timestamping in the bounded-storage model (Q1015360) (← links)
- An improved affine equivalence algorithm for random permutations (Q1648807) (← links)
- Two-round oblivious transfer from CDH or LPN (Q2119032) (← links)
- Three-round secure multiparty computation from black-box two-round oblivious transfer (Q2128560) (← links)
- Incompressible cryptography (Q2170026) (← links)
- High entropy random selection protocols (Q2659776) (← links)
- On the Power of Secure Two-Party Computation (Q2829222) (← links)
- Weak Oblivious Transfer from Strong One-Way Functions (Q3092347) (← links)
- Rationality in the Full-Information Model (Q3408207) (← links)
- Optimal Reductions Between Oblivious Transfers Using Interactive Hashing (Q3593097) (← links)
- Information-Theoretic Conditions for Two-Party Secure Function Evaluation (Q3593116) (← links)
- The Many Entropies in One-Way Functions (Q5021132) (← links)
- Blind Identity-Based Encryption and Simulatable Oblivious Transfer (Q5387104) (← links)
- Basing Weak Public-Key Cryptography on Strong One-Way Functions (Q5445498) (← links)
- Fine-grained cryptography revisited (Q5918348) (← links)
