scholarly journals Verification of Security Protocols with a Bounded Number of Sessions Based on Resolution for Rigid Variables

2009 ◽  
pp. 1-20 ◽  
Author(s):  
Reynald Af feldt ◽  
Hubert Comon-Lundh
Keyword(s):  
Security Protocols ◽  
Bounded Number

scholarly journals Decidability of a Sound Set of Inference Rules for Computational Indistinguishability

2021 ◽  
Vol 22 (1) ◽  
pp. 1-44
Author(s):  
Adrien Koutsos
Keyword(s):  
Security Protocols ◽  
Term Rewriting ◽  
Automated Deduction ◽  
Inference Rules ◽  
Encryption Scheme ◽  
First Order ◽  
Bounded Number

Computational indistinguishability is a key property in cryptography and verification of security protocols. Current tools for proving it rely on cryptographic game transformations. We follow Bana and Comon’s approach [7, 8], axiomatizing what an adversary cannot distinguish. We prove the decidability of a set of first-order axioms that are computationally sound, though incomplete, for protocols with a bounded number of sessions whose security is based on an <small>IND-CCA 2 </small> encryption scheme. Alternatively, our result can be viewed as the decidability of a family of cryptographic game transformations. Our proof relies on term rewriting and automated deduction techniques.

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.

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 Clustered 3-colouring graphs of bounded degree

2021 ◽  
pp. 1-13
Author(s):  
Vida Dujmović ◽  
Louis Esperet ◽  
Pat Morin ◽  
Bartosz Walczak ◽  
David R. Wood
Keyword(s):  
Planar Graphs ◽  
Maximum Degree ◽  
Bounded Degree ◽  
Bounded Number ◽  
Proper Vertex ◽  
Vertex Colouring

Abstract A (not necessarily proper) vertex colouring of a graph has clustering c if every monochromatic component has at most c vertices. We prove that planar graphs with maximum degree $\Delta$ are 3-colourable with clustering $O(\Delta^2)$ . The previous best bound was $O(\Delta^{37})$ . This result for planar graphs generalises to graphs that can be drawn on a surface of bounded Euler genus with a bounded number of crossings per edge. We then prove that graphs with maximum degree $\Delta$ that exclude a fixed minor are 3-colourable with clustering $O(\Delta^5)$ . The best previous bound for this result was exponential in $\Delta$ .

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 From Security Protocols to Pushdown Automata

2015 ◽  
Vol 17 (1) ◽  
pp. 1-45 ◽  
Author(s):  
Rémy Chrétien ◽  
Véronique Cortier ◽  
Stéphanie Delaune
Keyword(s):  
Security Protocols ◽  
Pushdown Automata

The Equational Specification of Finite Minimal Unoids Using only Unary Hidden Functions

1982 ◽  
Vol 5 (2) ◽  
pp. 143-170
Author(s):  
Jan A. Bergstra ◽  
John-Jules Ch. Meyer
Keyword(s):  
Data Type ◽  
Bounded Number ◽  
Special Case ◽  
Finite Data

In [5] it has been proved that by using hidden functions the number of equations needed to specify a finite data type is bounded by numbers depending only on the signature of that data type. In the special case of a finite minimal unoid, however, it seems to be relevant to ask whether or not a specification can also be made by a bounded number of equations using only unary hidden functions. In this paper we prove that this can be done.

Sign in / Sign up

Export Citation Format

Share Document