Finding Bugs in Network Protocols Using Simulation Code and Protocol-Specific Heuristics

Author(s):  
Ahmed Sobeih ◽  
Mahesh Viswanathan ◽  
Darko Marinov ◽  
Jennifer C. Hou
2004 ◽  
Author(s):  
Tom E. Anderson ◽  
David J. Wetherall
Keyword(s):  

Author(s):  
Leonel Moyou Metcheka ◽  
René Ndoundam

AbstractClassical or traditional steganography aims at hiding a secret in cover media such as text, image, audio, video or even in network protocols. Recent research has improved this approach called distributed steganography by fragmenting the secret message and embedding each secret piece into a distinct cover media. The major interest of this approach is to make the secret message detection extremely difficult. However, these file modifications leave fingerprints which can reveal a secret channel to an attacker. Our contribution is a new steganography paradigm transparent to any attacker and resistant to the detection and the secret extraction. Two properties contribute to achieve these goals: the files do not undergo any modification while the distribution of the secret in the multi-cloud storage environment allows us to hide the existence of the covert channel between the communicating parties. Information’s are usually hidden inside the cover media. In this work, the covert media is a pointer to information. Therefore the file carries the information without being modified and the only way to access it is to have the key. Experiments show interesting comparison results with remarkable security contributions. The work can be seen as a new open direction for further research in the field.


2021 ◽  
Vol 10 (3) ◽  
pp. 1-31
Author(s):  
Zhao Han ◽  
Daniel Giger ◽  
Jordan Allspaw ◽  
Michael S. Lee ◽  
Henny Admoni ◽  
...  

As autonomous robots continue to be deployed near people, robots need to be able to explain their actions. In this article, we focus on organizing and representing complex tasks in a way that makes them readily explainable. Many actions consist of sub-actions, each of which may have several sub-actions of their own, and the robot must be able to represent these complex actions before it can explain them. To generate explanations for robot behavior, we propose using Behavior Trees (BTs), which are a powerful and rich tool for robot task specification and execution. However, for BTs to be used for robot explanations, their free-form, static structure must be adapted. In this work, we add structure to previously free-form BTs by framing them as a set of semantic sets {goal, subgoals, steps, actions} and subsequently build explanation generation algorithms that answer questions seeking causal information about robot behavior. We make BTs less static with an algorithm that inserts a subgoal that satisfies all dependencies. We evaluate our BTs for robot explanation generation in two domains: a kitting task to assemble a gearbox, and a taxi simulation. Code for the behavior trees (in XML) and all the algorithms is available at github.com/uml-robotics/robot-explanation-BTs.


1993 ◽  
Vol 23 (4) ◽  
pp. 64-73 ◽  
Author(s):  
Chandramohan A. Thekkath ◽  
Thu D. Nguyen ◽  
Evelyn Moy ◽  
Edward D. Lazowska
Keyword(s):  

Author(s):  
Lech Nowicki ◽  
Jacek Jagielski ◽  
Cyprian Mieszczyński ◽  
Kazimierz Skrobas ◽  
Przemysław Jóźwik ◽  
...  

2007 ◽  
Author(s):  
Hengtai Ma ◽  
Zhiguo Hong ◽  
Dengke Zhu ◽  
Gang Zheng

2021 ◽  
Vol 11 (12) ◽  
pp. 5751
Author(s):  
Seyed Ali Mousavi Tayebi ◽  
Saeid Moussavi Tayyebi ◽  
Manuel Pastor

Due to the growing populations in areas at high risk of natural disasters, hazard and risk assessments of landslides have attracted significant attention from researchers worldwide. In order to assess potential risks and design possible countermeasures, it is necessary to have a better understanding of this phenomenon and its mechanism. As a result, the prediction of landslide evolution using continuum dynamic modeling implemented in advanced simulation tools is becoming more important. We analyzed a depth-integrated, two-phase model implemented in two different sets of code to stimulate rapid landslides, such as debris flows and rock avalanches. The first set of code, r.avaflow, represents a GIS-based computational framework and employs the NOC-TVD numerical scheme. The second set of code, GeoFlow-SPH, is based on the mesh-free numerical method of smoothed particle hydrodynamics (SPH) with the capability of describing pore pressure’s evolution along the vertical distribution of flowing mass. Two real cases of an Acheron rock avalanche and Sham Tseng San Tsuen debris flow were used with the best fit values of geotechnical parameters obtained in the prior modeling to investigate the capabilities of the sets of code. Comparison of the results evidenced that both sets of code were capable of properly reproducing the run-out distance, deposition thickness, and deposition shape in the benchmark exercises. However, the values of maximum propagation velocities and thickness were considerably different, suggesting that using more than one set of simulation code allows us to predict more accurately the possible scenarios and design more effective countermeasures.


Sign in / Sign up

Export Citation Format

Share Document