most citedByzantine Fault Tolerance of Regenerating Codes

13 citations · 35 across the 6 of their papers we have counts for

collaborators

6 papers

cs.DC201113 cited

Byzantine Fault Tolerance of Regenerating Codes

Frédérique Oggier, Anwitaman Datta

Recent years have witnessed a slew of coding techniques custom designed for networked storage systems. Network coding inspired regenerating codes are the most prolifically studied…

cs.SI2011

SuperNova: Super-peers Based Architecture for Decentralized Online Social Networks

Rajesh Sharma, Anwitaman Datta

Recent years have seen several earnest initiatives from both academic researchers as well as open source communities to implement and deploy decentralized online social networks (D…

cs.DC20119 cited

Self-Repairing Codes for Distributed Storage - A Projective Geometric Construction

Frederique Oggier, Anwitaman Datta

Self-Repairing Codes (SRC) are codes designed to suit the need of coding for distributed networked storage: they not only allow stored data to be recovered even in the presence of…

cs.DC20113 cited

A generic trust framework for large-scale open systems using machine learning

Xin Liu, Gilles Tredan, Anwitaman Datta

In many large scale distributed systems and on the web, agents need to interact with other unknown agents to carry out some tasks or transactions. The ability to reason about and a…

cs.DC201010 cited

Self-repairing Homomorphic Codes for Distributed Storage Systems

Frederique Oggier, Anwitaman Datta

Erasure codes provide a storage efficient alternative to replication based redundancy in (networked) storage systems. They however entail high communication overhead for maintenanc…

cs.DC2010

Anonymous Gossiping

Anwitaman Datta

In this paper we introduce a novel gossiping primitive to support privacy preserving data analytics (PPDA). In contrast to existing computational PPDA primitives such as secure mul…