Ranjit Kumaresan

Available identifiers

Publication	Date of Publication	Type
Synchronizable fair exchange	2024-08-01	Paper
Network Oblivious Transfer	2016-10-27	Paper
On Cut-and-Choose Oblivious Transfer and Its Variants	2016-06-10	Paper
Secure Computation with Minimal Interaction, Revisited	2015-12-10	Paper
Adaptively secure broadcast, revisited	2015-09-11	Paper
How to Use Bitcoin to Design Fair Protocols	2014-08-07	Paper
Amortizing Garbled Circuits	2014-08-07	Paper
On the Complexity of UC Commitments	2014-05-27	Paper
On the Cryptographic Complexity of the Worst Functions	2014-02-18	Paper
Authenticated broadcast with a partially compromised public-key infrastructure	2014-02-11	Paper
Improved OT Extension for Transferring Short Secrets	2013-09-17	Paper
Multi-Client Non-interactive Verifiable Computation	2013-03-18	Paper
Improved Secure Two-Party Computation via Information-Theoretic Garbled Circuits	2012-09-25	Paper
On the Security of the “Free-XOR” Technique	2012-06-15	Paper
The round complexity of verifiable secret sharing: the statistical case	2010-12-07	Paper
On exponential lower bound for protocols for reliable communication in networks	2009-12-03	Paper
Improving the round complexity of VSS in point-to-point networks	2009-07-15	Paper
Improving the Round Complexity of VSS in Point-to-Point Networks	2008-08-19	Paper

This page was built for person: Ranjit Kumaresan