We present a novel equivalence for cryptographic expressions that overcomes two limitations of classical security models: perfect cryptography and nondeterministic adversary. The uncertainty concerning the robustness of cryptographic primitives against breaking attacks is estimated through probabilistic information. We also define an approximated relation that allows cryptographic expressions (...

This paper proposes a novel lightweight security-enabled distributed software-defined drone network (SDDN) for traffic monitoring. Security of drone/Unmanned Aerial Vehicles (UAV) communication and data exchange is ensured through key generation encryption/decryption algorithm. A hybrid (static dynamic) OpenMP/MPI-based processing used to compute the security primitives drone-to-drone communica...

Radio-Frequency Identification (RFID) technology is a crucial used in many IoT applications such as healthcare, asset tracking, logistics, supply chain management, assembly, manufacturing, and payment systems. Nonetheless, RFID-based have security privacy issues restricting their use on large scale. Many authors proposed lightweight RFID authentication schemes based Elliptic Curve Cryptography ...

E-voting protocols aim at achieving a wide range of sophisticated security properties and, consequently, commonly employ advanced cryptographic primitives. This makes their design as well as rigorous analysis quite challenging. As a matter of fact, existing automated analysis techniques, which are mostly based on automated theorem provers, are inadequate to deal with commonly used cryptographic...

Security based on cryptographic techniques is commonly used in many applications from many fields. Using security based on cryptographic techniques in remote control systems is certainly a subject of great interest. This paper will try to bring some points of view on the security objectives present in remote control systems and on the cryptographic primitives used to ensure them. Two solutions ...

Security of cryptographic symmetric primitives is studied in this thesis. Pseudorandomness characteristics of cryptographic sequences are analyzed, resulting in new methods for constructing sequences with high linear complexity. Connections between nonlinear complexity and other cryptographic criteria are also established, whereas a new recursive algorithm for efficiently computing the minimal ...

The growing demand of security features in pervasive computing requires cryptographic implementations to meet tight cost constraints. Lightweight Cryptography is a generic term that captures new efforts in this area, covering lightweight cryptography proposals as well as lightweight implementation techniques. This paper demonstrates the influence of technology selection when comparing different...

Up to now, the design of block ciphers has been mainly driven by heuristic arguments, and little theory is known to constitute a good guideline for the development of their architecture. Trying to remedy this situation, we introduce a new type of design for symmetric cryptographic primitives with high self-similarity. Our design strategy enables to give a reductionist security proof for the pri...

This paper presents computationally “lightweight” schemes for performing biometric authentication that carry out the comparison stage without revealing any information that can later be used to impersonate the user (or reveal personal biometric information). Unlike some previous computationally expensive schemes — which make use of slower cryptographic primitives — this paper presents methods t...

The analysis of code that uses cryptographic primitives is unfeasible with current state-of-the-art symbolic execution tools. We develop an extension that overcomes this limitation by treating certain concrete functions, like cryptographic primitives, as symbolic functions whose execution analysis is entirely avoided; their behaviour is in turn modelled formally via rewriting rules. Our code ru...