The following pages link to Omer Horvitz (Q1027977):
Displaying 6 items.
- Reducing complexity assumptions for statistically-hiding commitment (Q1027978) (← links)
- Bounds on the efficiency of black-box commitment schemes (Q2268099) (← links)
- Universally-Composable Two-Party Computation in Two Rounds (Q3612546) (← links)
- Reducing Complexity Assumptions for Statistically-Hiding Commitment (Q5385722) (← links)
- Advances in Cryptology - CRYPTO 2003 (Q5428140) (← links)
- Automata, Languages and Programming (Q5716759) (← links)