Evaluating a peer-to-peer storage system in presence of malicious peers

Abstract

We present a peer-to-peer based storage system and evaluate its resistance in the presence of malicious peers. To do so, we resort to simulation of the actual code borrowed from the production system. Our analysis allows to identify the main threats, prioritise them and propose directions for mitigating the attacks.

A BSP algorithm for on-the-fly checking CTL* formulas on security protocols

“…Finally, we would like to generalise our present results by extending its application domain to more complex protocols with branching and looping structures, as well as complex data types manipulations as in protocols for secure storage distributed through peer-to-peer communication [13], secured routing protocols [17], etc.…”

“…If σ has not been found False, and if σ is in the stack (meaning that its SCC is still being constructed), the σ and σ will be in the same SCC: we reflect this by updating σ .low accordingly. We also update σ .valid by removing formulas whose starting points occur after σ ; as we show below, these formulas cannot be used as evidence for the success of the SCC containing σ and σ (lines [8][9][10][11][12][13][14]. Once the subgoal processing is completed, loop ltl checks to see whether a new SCC component has been detected; if no, it removes it from the stack (lines [18][19][20][21][22][23] and finally backtracks to the parent call (line 25).…”

“…Using PYTHON in our implementation allows us to manipulate any kind of data-structures that could be used by agents in protocols. This is a well-desired feature for complex protocols like P2P security protocols in [13]. We believe that our observations and the subsequent optimisations are general enough to be adapted to the model-checkers dedicated to protocol verification: we worked in a very general setting of LTS, defined by an initial state and a successor function.…”

SNAKES: A Flexible High-Level Petri Nets Library (Tool Paper)

“…As explained already, it is very hard to have a clear picture of who is using snakes because it is freely available and very few users actually ask for support. Fortunately, there are works we known well about [6,7,12,14,15,21,29,30] and that illustrate typical use cases for snakes as listed below.…”

A BSP Algorithm for On-the-fly Checking LTL Formulas on Security Protocols

“…In the security domain, we will consider more complex protocols with branching and looping structures, as well as complex data types manipulations. In particular, we will consider protocols for secure storage distributed through peer-to-peer communication [33], [34] because it is currently modeled using ABCD and generates large state spaces.…”