The following pages link to A new interactive hashing theorem (Q2442643):
Displaying 7 items.
- On the power of secure two-party computation (Q2303458) (← links)
- On the Power of Secure Two-Party Computation (Q2829222) (← links)
- Disjunctions for Hash Proof Systems: New Constructions and Applications (Q2948379) (← links)
- Leftover Hash Lemma, Revisited (Q5199181) (← links)
- Finding Collisions in Interactive Protocols---Tight Lower Bounds on the Round and Communication Complexities of Statistically Hiding Commitments (Q5252662) (← links)
- Analysis of Multivariate Hash Functions (Q5385529) (← links)
- Interactive Hashing: An Information Theoretic Tool (Invited Talk) (Q5502788) (← links)