Search results for "Computer Science::Cryptography and Security"
showing 6 items of 36 documents
"Table 11" of "Freeze-out radii extracted from three-pion cumulants in pp, p-Pb and Pb-Pb collisions at the LHC"
2014
Gaussian radii and intercept parameters in pp collisions versus Nch at high KT3.
On strongly tactical codes
1986
We study perfect error correcting codes in which the codewords are protected by Hamming spheres of distinct protective radii. These codes have been introduced by Cohen, Montaron and Frankl [3, 4, 10].
Morphological Enhancement and Triangular Matching for Fingerprint Recognition
2008
Among the principal problems for realizing a robust Automated Fingerprint Identification System (AFIS) there are the images quality and matching algorithms. In this paper a fingerprint enhancement algorithm based on morphological filter and a triangular matching are introduced. The enhancement phase is based on tree steps: directional decomposition, morphological filter and composition. For the matching phase a global transformation to overcame the effects of rotation, displacement and deformation between acquired and stored fingerprint is performed using the number of similar triangular, having fingerprint minutiae as vertexes. The performance of the proposed approach has been evaluated on…
Secure random number generation in wireless sensor networks
2011
The increasing adoption of wireless sensor networks as a flexible and inexpensive tool for the most diverseapplications, ranging from environmental monitoring to home automation, has raised more and more atten-tion to the issues related to the design of specifically customized security mechanisms. The scarcity ofcomputational, storage, and bandwidth resources cannot definitely be disregarded in such context, and thismakes the implementation of security algorithms particularly challenging. This paper proposes a securityframework for the generation of true random numbers, which are paramount as the core building blockfor many security algorithms; the intrinsic nature of wireless sensor nodes …
Privacy-preserving scheme for mobile ad hoc networks
2011
This paper proposes a decentralized trust establishment protocol for mobile ad hoc networks (MANETs), where nodes establish security associations. In order to achieve privacy and security, we use homomorphic encryption and polynomial intersection so as to find the intersection of two sets. The first set represents a list of recommenders of the initiator and the second set is a list of trusted recommenders of the responder. The intersection of the sets represents a list of nodes that recommend the first node and their recommendations are trusted by the second node. In our experimental results we show that our scheme is effective even if there are 30 trusted nodes.
Defending Surveillance Sensor Networks Against Data-Injection Attacks Via Trusted Nodes
2018
By injecting false data through compromised sensors, an adversary can drive the probability of detection in a sensor network-based spatial field surveillance system to arbitrarily low values. As a countermeasure, a small subset of sensors may be secured. Leveraging the theory of Matched Subspace Detection, we propose and evaluate several detectors that add robustness to attacks when such trusted nodes are available. Our results reveal the performance-security tradeoff of these schemes and can be used to determine the number of trusted nodes required for a given performance target.