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 13 items.
- Secure two-party computation via cut-and-choose oblivious transfer (Q1928765) (← links)
- Generic compiler for publicly verifiable covert multi-party computation (Q2056768) (← links)
- Black-box transformations from passive to covert security with public verifiability (Q2096543) (← links)
- Efficient compiler to covert security with public verifiability for honest majority MPC (Q2096640) (← links)
- The meeting businessmen problem: requirements and limitations (Q2443007) (← links)
- Universally Composable Private Proximity Testing (Q3092361) (← links)
- Secure Multiparty RAM Computation in Constant Rounds (Q3179368) (← 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)
- Faster Secure Two-Party Computation in the Single-Execution Setting (Q5270369) (← links)
- Non-interactive Secure 2PC in the Offline/Online and Batch Settings (Q5270370) (← links)
- Hashing Garbled Circuits for Free (Q5270371) (← links)