Ranjit Kumaresan

According to our database1, Ranjit Kumaresan authored at least 27 papers between 2007 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2019
LucidiTEE: Policy-based Fair Computing at Scale.
IACR Cryptology ePrint Archive, 2019

Sprites and State Channels: Payment Networks that Go Faster Than Lightning.
Proceedings of the Financial Cryptography and Data Security, 2019

2017
Instantaneous Decentralized Poker.
IACR Cryptology ePrint Archive, 2017

Sprites: Payment Channels that Go Faster than Lightning.
CoRR, 2017

2016
Network Oblivious Transfer.
IACR Cryptology ePrint Archive, 2016

Efficient Batched Oblivious PRF with Applications to Private Set Intersection.
IACR Cryptology ePrint Archive, 2016

Improvements to Secure Computation with Penalties.
Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, 2016

Amortizing Secure Computation with Penalties.
Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, 2016

2015
Amortizing Garbled Circuits.
IACR Cryptology ePrint Archive, 2015

Multi-Client Non-Interactive Verifiable Computation.
IACR Cryptology ePrint Archive, 2015

Secure Computation with Minimal Interaction, Revisited.
Proceedings of the Advances in Cryptology - CRYPTO 2015, 2015

How to Use Bitcoin to Play Decentralized Poker.
Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security, 2015

On Cut-and-Choose Oblivious Transfer and Its Variants.
Proceedings of the Advances in Cryptology - ASIACRYPT 2015 - 21st International Conference on the Theory and Application of Cryptology and Information Security, Auckland, New Zealand, November 29, 2015

2014
How to Use Bitcoin to Design Fair Protocols.
IACR Cryptology ePrint Archive, 2014

On the Cryptographic Complexity of the Worst Functions.
Proceedings of the Theory of Cryptography - 11th Theory of Cryptography Conference, 2014

On the Complexity of UC Commitments.
Proceedings of the Advances in Cryptology - EUROCRYPT 2014, 2014

How to Use Bitcoin to Incentivize Correct Computations.
Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications Security, 2014

2013
Improved OT Extension for Transferring Short Secrets.
IACR Cryptology ePrint Archive, 2013

2012
Broadcast and Verifiable Secret Sharing: New Security Models and Round Optimal Constructions.
PhD thesis, 2012

Improved Secure Two-Party Computation via Information-Theoretic Garbled Circuits.
Proceedings of the Security and Cryptography for Networks - 8th International Conference, 2012

Efficient Verification of Input Consistency in Server-Assisted Secure Function Evaluation.
Proceedings of the Cryptology and Network Security, 11th International Conference, 2012

2011
On the Security of the Free-XOR Technique.
IACR Cryptology ePrint Archive, 2011

Adaptively secure broadcast, revisited.
Proceedings of the 30th Annual ACM Symposium on Principles of Distributed Computing, 2011

2010
The Round Complexity of Verifiable Secret Sharing: The Statistical Case.
Proceedings of the Advances in Cryptology - ASIACRYPT 2010, 2010

2009
Authenticated Broadcast with a Partially Compromised Public-Key Infrastructure.
IACR Cryptology ePrint Archive, 2009

2007
Improving the Round Complexity of VSS in Point-to-Point Networks.
IACR Cryptology ePrint Archive, 2007

On Exponential Lower Bound for Protocols for Reliable Communication in Networks.
Proceedings of the Information Theoretic Security - Second International Conference, 2007


  Loading...