The following pages link to Ranjit Kumaresan (Q2389349):
Displaying 14 items.
- Improving the round complexity of VSS in point-to-point networks (Q2389350) (← links)
- Authenticated broadcast with a partially compromised public-key infrastructure (Q2637312) (← links)
- On Cut-and-Choose Oblivious Transfer and Its Variants (Q2811140) (← links)
- Network Oblivious Transfer (Q2829221) (← links)
- Improved OT Extension for Transferring Short Secrets (Q2849386) (← links)
- How to Use Bitcoin to Design Fair Protocols (Q2874551) (← links)
- Amortizing Garbled Circuits (Q2874553) (← links)
- On the Security of the “Free-XOR” Technique (Q2891475) (← links)
- Improved Secure Two-Party Computation via Information-Theoretic Garbled Circuits (Q2912796) (← links)
- Adaptively secure broadcast, revisited (Q2943395) (← links)
- The Round Complexity of Verifiable Secret Sharing: The Statistical Case (Q3058670) (← links)
- Secure Computation with Minimal Interaction, Revisited (Q3457074) (← links)
- Improving the Round Complexity of VSS in Point-to-Point Networks (Q3519526) (← links)
- On Exponential Lower Bound for Protocols for Reliable Communication in Networks (Q3649190) (← links)
