\n \n \n
\n
\n \n 2024\n \n \n (1)\n \n \n
\n
\n \n \n
\n
\n\n \n \n \n \n \n \n Optimal Sharding for Scalable Blockchains with Deconstructed SMR.\n \n \n \n \n\n\n \n Zhang, J.; Luo, Z.; Ramesh, R.; and Kate, A.\n\n\n \n\n\n\n 2024.\n
\n\n
\n\n
\n\n
\n\n \n \n
Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@misc{zhang2024optimalshardingscalableblockchains,\n title={Optimal Sharding for Scalable Blockchains with Deconstructed SMR}, \n author={Jianting Zhang and Zhongtang Luo and Raghavendra Ramesh and Aniket Kate},\n year={2024},\n eprint={2406.08252},\n archivePrefix={arXiv},\n primaryClass={cs.CR},\n url={https://arxiv.org/abs/2406.08252}, \n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n \n 2021\n \n \n (1)\n \n \n
\n
\n \n \n
\n
\n\n \n \n \n \n \n \n Algorithm for Cross-shard Cross-EE Atomic User-level ETH Transfer in Ethereum.\n \n \n \n \n\n\n \n Ramesh, R.\n\n\n \n\n\n\n 2021.\n
\n\n
\n\n
\n\n
\n\n \n \n
Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@misc{ramesh2021algorithmcrossshardcrosseeatomic,\n title={Algorithm for Cross-shard Cross-EE Atomic User-level ETH Transfer in Ethereum}, \n author={Raghavendra Ramesh},\n year={2021},\n eprint={2102.09688},\n archivePrefix={arXiv},\n primaryClass={cs.DC},\n url={https://arxiv.org/abs/2102.09688}, \n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n \n 2017\n \n \n (1)\n \n \n
\n
\n \n \n
\n
\n\n \n \n \n \n \n \n Inference of Security-Sensitive Entities in Libraries.\n \n \n \n \n\n\n \n Lu, Y.; Bae, S.; Krishnan, P.; and Ramesh, R.\n\n\n \n\n\n\n 2017.\n
\n\n
\n\n
\n\n
\n\n \n \n
Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@misc{inference,\n title={Inference of Security-Sensitive Entities in Libraries}, \n author={Yi Lu and Sora Bae and Paddy Krishnan and Raghavendra Ramesh},\n year={2017},\n booktitle={LangSec Workshop, IEEE S&P},\n url={http://spw17.langsec.org/papers.html#inference}\n}
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n\n\n\n