Pages that link to "Item:Q5458598"
From MaRDI portal
The following pages link to Efficient Two Party and Multi Party Computation Against Covert Adversaries (Q5458598):
Displayed 6 items.
- Secure two-party computation via cut-and-choose oblivious transfer (Q1928765) (← links)
- The meeting businessmen problem: requirements and limitations (Q2443007) (← links)
- Universally Composable Private Proximity Testing (Q3092361) (← links)
- From Passive to Covert Security at Low Cost (Q3408191) (← links)
- Truly Efficient String Oblivious Transfer Using Resettable Tamper-Proof Tokens (Q3408203) (← links)
- Efficiency Preserving Transformations for Concurrent Non-malleable Zero Knowledge (Q3408214) (← links)