Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data.

Siddhartha Nandi

dblp:69/3806 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
0since 2021 · last 2018
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 2Databases, data management, data science and information retrieval · 1Applied, interdisciplinary, general and emerging computing · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Coding theory · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Storage systems · 100%

Topics — the 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Storage systems › storage reliability
erasure coding
0.312018
Clay Codes: Moulding MDS Codes to Yield an MSR Code · FAST 2018
Storage systems
storage reliability
0.312018
Clay Codes: Moulding MDS Codes to Yield an MSR Code · FAST 2018
Coding theory › error-correcting codes
erasure coding
0.312018
Clay Codes: Moulding MDS Codes to Yield an MSR Code · FAST 2018
Coding theory › distributed storage › distributed storage codes › regenerating codes
minimum storage regenerating codes
0.312018
Clay Codes: Moulding MDS Codes to Yield an MSR Code · FAST 2018
Coding theory › distributed storage › distributed storage codes
regenerating codes
0.312018
Clay Codes: Moulding MDS Codes to Yield an MSR Code · FAST 2018
YearPublicationVenuePosition
2018 An Efficient Secure Distributed Cloud Storage for Append-Only Data
abstract
Cloud computing enables users (clients) to outsource large volume of their data to cloud servers. Secure distributed cloud storage schemes ensure that multiple servers store these data in a reliable and untampered fashion. We propose an idea to construct such a scheme for static data by encoding data blocks (using error-correcting codes) and then attaching authentication information (tags) to these encoded blocks. We identify some challenges while extending this idea to accommodate append-only data. Then, we propose our secure distributed cloud storage scheme for append-only data that addresses the challenges efficiently. The main advantage of our scheme is that it enables the servers to update the parity blocks themselves. Moreover, the client need not download any data (or parity) block to update the tags of the modified parity blocks residing on the servers. Finally, we analyze the security and performance of our scheme.
Binanda Sengupta, Nishant Nikam, Sushmita Ruj, Srinivasan Narayanamurthy, Siddhartha Nandi
IEEE CLOUD5
2018 Clay Codes: Moulding MDS Codes to Yield an MSR Code
Myna Vajha, Vinayak Ramkumar, Bhagyashree Puranik, Ganesh R. Kini, Elita A. Lobo, Birenjith Sasidharan, P. Vijay Kumar, Alexander Barg, Min Ye 0005, Srinivasan Narayanamurthy, Syed Hussain, Siddhartha Nandi
FAST12
2014 Evaluation of Codes with Inherent Double Replication for Hadoop
M. Nikhil Krishnan, N. Prakash 0001, V. Lalitha 0001, Birenjith Sasidharan, P. Vijay Kumar, Srinivasan Narayanamurthy, Ranjit Kumar, Siddhartha Nandi
HotStorage8