The following pages link to A new interactive hashing theorem (Q2442643):
Displaying 4 items.
- On the power of secure two-party computation (Q2303458) (← links)
- On the Power of Secure Two-Party Computation (Q2829222) (← 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)
