Ranjit Kumaresan
Ranjit Kumaresan
Okänd anknytning
Verifierad e-postadress på csail.mit.edu - Startsida
Titel
Citeras av
Citeras av
År
How to use bitcoin to design fair protocols
I Bentov, R Kumaresan
Annual Cryptology Conference, 421-439, 2014
2792014
Sprites: Payment channels that go faster than lightning
A Miller, I Bentov, R Kumaresan, P McCorry
CoRR abs/1702.05812 306, 2017
172*2017
How to use bitcoin to incentivize correct computations
R Kumaresan, I Bentov
Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications …, 2014
1402014
Improved OT extension for transferring short secrets
V Kolesnikov, R Kumaresan
Annual Cryptology Conference, 54-70, 2013
1212013
How to use bitcoin to play decentralized poker
R Kumaresan, T Moran, I Bentov
Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications …, 2015
952015
Multi-client non-interactive verifiable computation
SG Choi, J Katz, R Kumaresan, C Cid
Theory of Cryptography Conference, 499-518, 2013
902013
Efficient batched oblivious PRF with applications to private set intersection
V Kolesnikov, R Kumaresan, M Rosulek, N Trieu
Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications …, 2016
892016
Amortizing garbled circuits
Y Huang, J Katz, V Kolesnikov, R Kumaresan, AJ Malozemoff
Annual Cryptology Conference, 458-475, 2014
782014
On the security of the “free-XOR” technique
SG Choi, J Katz, R Kumaresan, HS Zhou
Theory of Cryptography Conference, 39-53, 2012
702012
Improving the round complexity of VSS in point-to-point networks
J Katz, CY Koo, R Kumaresan
International Colloquium on Automata, Languages, and Programming, 499-510, 2008
602008
Improvements to secure computation with penalties
R Kumaresan, V Vaikuntanathan, PN Vasudevan
Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications …, 2016
492016
Amortizing secure computation with penalties
R Kumaresan, I Bentov
Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications …, 2016
472016
Instantaneous decentralized poker
I Bentov, R Kumaresan, A Miller
International conference on the theory and application of cryptology and …, 2017
462017
On the cryptographic complexity of the worst functions
A Beimel, Y Ishai, R Kumaresan, E Kushilevitz
Theory of Cryptography Conference, 317-342, 2014
422014
The round complexity of verifiable secret sharing: The statistical case
R Kumaresan, A Patra, CP Rangan
International Conference on the Theory and Application of Cryptology and …, 2010
392010
Adaptively secure broadcast, revisited
JA Garay, J Katz, R Kumaresan, HS Zhou
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of …, 2011
342011
Secure computation with minimal interaction, revisited
Y Ishai, R Kumaresan, E Kushilevitz, A Paskin-Cherniavsky
Annual Cryptology Conference, 359-378, 2015
282015
On the complexity of UC commitments
JA Garay, Y Ishai, R Kumaresan, H Wee
Annual International Conference on the Theory and Applications of …, 2014
232014
Improved secure two-party computation via information-theoretic garbled circuits
V Kolesnikov, R Kumaresan
International Conference on Security and Cryptography for Networks, 205-221, 2012
222012
Improving the round complexity of VSS in point-to-point networks
J Katz, CY Koo, R Kumaresan
Information and Computation 207 (8), 889-899, 2009
202009
Systemet kan inte utföra åtgärden just nu. Försök igen senare.
Artiklar 1–20