The following pages link to (Q3210139):
Displaying 13 items.
- Secure multiparty protocols and zero-knowledge proof systems tolerating a faulty minority (Q809588) (← links)
- On the structure of the privacy hierarchy (Q1324758) (← links)
- On the structure of unconditional UC hybrid protocols (Q1631320) (← links)
- The privacy of dense symmetric functions (Q1842776) (← links)
- On privacy and partition arguments (Q1854427) (← links)
- Mathematical problems in cryptology (Q1910812) (← links)
- Computational hardness of optimal fair computation: beyond Minicrypt (Q2128555) (← links)
- Completeness for symmetric two-party functionalities: revisited (Q2413612) (← links)
- (Q3024960) (← links)
- Practical Everlasting Privacy (Q5326751) (← links)
- Susceptible Two-Party Quantum Computations (Q5502797) (← links)
- Oblivious-transfer complexity of noisy coin-toss via secure zero communication reductions (Q6169552) (← links)
- Randomized functions with high round complexity (Q6581793) (← links)