@inproceedings{Held2018FightingRansomware,

title = {Fighting Ransomware with Guided Undo},

author = {Matthias Held and Marcel Waldvogel},

url = {https://netfuture.ch/wp-content/uploads/2018/07/held2018fightingransomware.pdf

https://netfuture.ch/wp-content/uploads/2018/09/ransomware_detection.pdf

https://netfuture.ch/wp-content/uploads/2018/09/2018-ransomware.odp},

year  = {2018},

date = {2018-09-18},

urldate = {1000-01-01},

booktitle = {Proceedings of NISK 2018},

abstract = {Ransomware attacks are rare, yet catastrophic. On closer inspection, they differ from other malware infections: Given appropriate preparation, they do not need to be caught on first sight, but can be undone later. However, current ransomware protection follows the beaten path of anti-malware copying their fallacies. We show how the move to personal cloud storage allows for a paradigm shift in ransomware protection: exceptional attack isolation, perfect elimination of false positive alerts, and simplified recovery.



In this paper, we analyze the necessary operations for ransomware, extend existing ransomware taxonomy, and verify them against real-world malware samples. We analyze the costs and benefits of moving ransomware detection to versioned personal cloud storage. Our content, meta data, and behavior analysis paired with a `guilt by association' capability greatly improve the false positive rate, but the guided undo make this rate all but inconsequential. Even though the user now carries a new burden, it comes with clear responsibilities and benefits, while being freed from questionable duties, resulting in a win-win situation for user experience and detection quality.

},

keywords = {Cloud Storage, Intrusion Detection, Ransomware, Replication, Security, Usability, Web Applications},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{Bauer2007Replica,

title = {Replica Placement and Location using Distributed Hash Tables},

author = {Daniel Bauer and Paul Hurley and Marcel Waldvogel},

url = {https://netfuture.ch/wp-content/uploads/2007/bauer07replica.pdf},

isbn = {0-7695-3000-1},

year  = {2007},

date = {2007-10-15},

urldate = {2007-10-15},

booktitle = {Proceedings of IEEE LCN},

pages = {315-324},

crossref = {DBLP:conf/lcn/2007},

abstract = {Interest in distributed storage is fueled by demand for reliability and resilience combined with decreasing hardware costs. Peer-to-peer storage networks based on distributed hash tables are attractive for their efficient use of resources and resulting performance. The placement and subsequent efficient location of replicas in such systems remain open problems, especially (1) the requirement to update replicated content, (2) working in the absence of global information, and (3) determination of the locations in a dynamic system without introducing single points of failure. We present and evaluate a novel and versatile technique, replica enumeration, which allows for controlled replication and replica access. The possibility of enumerating and addressing individual replicas allows dynamic updates as well as superior performance without burdening the network with state information, yet taking advantage of locality information when available. We simulate, analyze, and prove properties of the system, and discuss some applications.},

keywords = {Peer-to-Peer, Replication},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{Caronni2003Establishing,

title = {Establishing Trust in Distributed Storage Providers},

author = {Germano Caronni and Marcel Waldvogel},

url = {https://netfuture.ch/wp-content/uploads/2003/caronni03establishing.pdf},

year  = {2003},

date = {2003-09-01},

urldate = {1000-01-01},

booktitle = {Proceedings of Third IEEE International Conference on Peer-to-Peer Computing (P2P 2003)},

abstract = {Corporate IT as well as individuals show increasing interest in reliable outsourcing of storage infrastructure. Decentralized solutions with their resilience against partial outages are among the most attractive approaches. Irrespective of the form of the relationship, be it based on a contract or on the more flexible cooperative model, the problem of verifying whether someone promising to store one's data actually does so remains to be solved, especially in the presence of multiple replicas. In this paper, we introduce a lightweight mechanism that allows the \textit{data originator} or a dedicated \textit{verification agent} to build up trust in the \textit{replica holder} by means of protocols that do not require prior trust or key establishment. We show how naive versions of the protocol do not prevent cheating, and then strengthen it by adding means that make it economically attractive to be honest. This provides a foundation for further work in providing trustworthy distributed storage.},

keywords = {Cloud Storage, Peer-to-Peer, Replication, Trust},

pubstate = {published},

tppubtype = {inproceedings}

}