The following pages link to (Q3787498):
Displayed 21 items.
- Communication-efficient distributed oblivious transfer (Q439979) (← links)
- Generalized oblivious transfer by secret sharing (Q629875) (← links)
- Private multiparty sampling and approximation of vector combinations (Q1014646) (← links)
- Oblivious transfer in incomplete networks (Q1629424) (← links)
- Efficient \(k\)-out-of-\(n\) oblivious transfer scheme with the ideal communication cost (Q1694723) (← links)
- Flexible quantum oblivious transfer (Q1705113) (← links)
- Oblivious keyword search (Q1827575) (← links)
- Secure non-interactive reduction and spectral analysis of correlations (Q2170114) (← links)
- Basing cryptographic protocols on tamper-evident seals (Q2268101) (← links)
- Network Oblivious Transfer (Q2829221) (← links)
- A New Efficient Protocol for k-out-of-n Oblivious Transfer (Q3007540) (← links)
- On Complete Primitives for Fairness (Q3408189) (← links)
- Founding Cryptography on Tamper-Proof Hardware Tokens (Q3408202) (← links)
- Improved Garbled Circuit: Free XOR Gates and Applications (Q3519525) (← links)
- Graph Design for Secure Multiparty Computation over Non-Abelian Groups (Q3600363) (← links)
- Cryptography and cryptographic protocols (Q5138490) (← links)
- OT-Combiners via Secure Computation (Q5445517) (← links)
- Counting Method for Multi-party Computation over Non-abelian Groups (Q5502759) (← links)
- Statistical Security Conditions for Two-Party Secure Function Evaluation (Q5502794) (← links)
- Secure non-interactive reducibility is decidable (Q6169412) (← links)
- Oblivious-transfer complexity of noisy coin-toss via secure zero communication reductions (Q6169552) (← links)