A Systematic Review of Security Protocols for Ubiquitous Wireless Networks

2017 ◽  
Vol 7 (5) ◽  
pp. 290-297
Author(s):  
Manas Kumar Yogi ◽  
◽  
L. Yamuna ◽  
P. Surayanka ◽  
◽  
...  
Keyword(s):  
Systematic Review ◽  
Wireless Networks ◽  
Security Protocols

Towards a Standard for a Reliable Execution Environment for Security Protocols

2016 ◽  
Vol 2 (1) ◽  
pp. 78
Author(s):  
Mahalingam Ramkumar
Keyword(s):  
Information Systems ◽  
Full Advantage ◽  
Real World ◽  
Security Protocols ◽  
Low Complexity ◽  
High Integrity ◽  
Execution Environment ◽  
World Information ◽  
Digital Assets ◽  
Attack Models

Approaches for securing digital assets of information systems can be classified as active approaches based on attack models, and passive approaches based on system-models. Passive approaches are inherently superior to active ones. However, taking full advantage of passive approaches calls for a rigorous standard for a low-complexity-high-integrity execution environment for security protocols. We sketch broad outlines of mirror network (MN) modules, as a candidate for such a standard. Their utility in assuring real-world information systems is illustrated with examples.

scholarly journals Efficient Verification of Dicke States

2019 ◽  
Vol 12 (4) ◽  
Author(s):  
Ye-Chao Liu ◽  
Xiao-Dong Yu ◽  
Jiangwei Shang ◽  
Huangjun Zhu ◽  
Xiangdong Zhang
Keyword(s):  
Efficient Verification ◽  
Dicke States

scholarly journals Towards efficient verification of population protocols

2021 ◽  
Author(s):  
Michael Blondin ◽  
Javier Esparza ◽  
Stefan Jaax ◽  
Philipp J. Meyer
Keyword(s):  
Linear Constraints ◽  
Computational Power ◽  
High Complexity ◽  
Reachability Problem ◽  
Population Protocols ◽  
Finite State ◽  
State Agents ◽  
Efficient Verification ◽  
Primitive Recursive ◽  
Very High

AbstractPopulation protocols are a well established model of computation by anonymous, identical finite-state agents. A protocol is well-specified if from every initial configuration, all fair executions of the protocol reach a common consensus. The central verification question for population protocols is the well-specification problem: deciding if a given protocol is well-specified. Esparza et al. have recently shown that this problem is decidable, but with very high complexity: it is at least as hard as the Petri net reachability problem, which is -hard, and for which only algorithms of non-primitive recursive complexity are currently known. In this paper we introduce the class $${ WS}^3$$ WS 3 of well-specified strongly-silent protocols and we prove that it is suitable for automatic verification. More precisely, we show that $${ WS}^3$$ WS 3 has the same computational power as general well-specified protocols, and captures standard protocols from the literature. Moreover, we show that the membership and correctness problems for $${ WS}^3$$ WS 3 reduce to solving boolean combinations of linear constraints over $${\mathbb {N}}$$ N . This allowed us to develop the first software able to automatically prove correctness for all of the infinitely many possible inputs.

Evaluation of Algorithms and Security Protocols to Mitigate the Risks in Commercial Transactions carried out by Public Companies

2020 ◽  
Author(s):  
Segundo Moises Toapanta Toapanta ◽  
Luis Enrique Mafla Gallegos ◽  
Alex Enrique Aranda Alvarado ◽  
Maximo Prado Solis
Keyword(s):  
Security Protocols ◽  
Public Companies

scholarly journals Survey of Security Protocols and Vulnerabilities in Unmanned Aerial Vehicles

IEEE Access ◽  
2021 ◽  
pp. 1-1
Author(s):  
Arslan Shafique ◽  
Abid Mehmood ◽  
Mourad Elhadef
Keyword(s):  
Unmanned Aerial Vehicles ◽  
Security Protocols ◽  
Aerial Vehicles

scholarly journals On the unusual effectiveness of type-aware operator mutations for testing SMT solvers

2020 ◽  
Vol 4 (OOPSLA) ◽  
pp. 1-25
Author(s):  
Dominik Winterer ◽  
Chengyu Zhang ◽  
Zhendong Su
Keyword(s):  
Smt Solvers
Sign in / Sign up

Export Citation Format

Share Document