Search results

This paper seeks to advance research and strategies that lead to a heightened awareness of the need to protect data from disclosure, to guarantee the authenticity of data and messages, and to protect systems from network‐based attacks.

The paper introduces the necessary mathematics of cryptography: integer and modular arithmetic, linear congruence, Euclidean and extended Euclidean algorithm, Fermat's theorem, and Elliptic curve.

The results indicate that encryption has expanded beyond confidentiality concerns to include techniques for message integrity checking, sender/receiver identity authentication, digital signatures, interactive proofs, and secure computation.

The results of this research show that all forms of e‐commerce activities such as online credit card processing, purchasing stocks, and banking data processing, if compromised, would lead to businesses losing billions of dollars in lost revenues as well as losing confidence in e‐commerce. In the last few years, it had been reported that organizations that store and maintain customers' private and confidential records were compromised on many occasions by hackers breaking into the data networks and stealing the records from the storage media.

This paper tackles one of the most critical problems of securing data networks. Security problems arise among other things to resource and workload sharing; complexity of interconnected networks; authentication of users; fast expandability of networks; threats to networks such as wiretapping and violations of the seven pillars of security: authentication, authorization, privacy, integrity, non‐repudiation, availability, and audit.

Nowadays, to design the information security mechanism for computing and communication systems, there are various approaches available like cryptographic approach, game-theoretic approach, quantitative–qualitative analysis-based approach, cognitive-behavioral approach, digital forensic-based approach and swarm computing-based approach. The contemporary research in these various fields is independent in nature. The purpose of this paper is to investigate the relationship between these various approaches to information security and cybernetics.

To investigate the relationship between information security mechanisms and cybernetics, Norbert Wiener’s concepts and philosophy of the cybernetics have been used in the present work. For a detailed study, concepts, techniques and philosophy of the cybernetics have been extracted from the books of Norbert Wiener titled “The human use of human beings” and “Cybernetics or control and communication in the animal and the machine”.

By revisiting the concepts of the cybernetics from the information security perspectives, it has been found that the aspects of information security and the aspects of cybernetics have great bonding.

The present paper demonstrates how bonding between cybernetics and information security can be used to solve some of the complex research challenges in information security area.

Cryptography has become an essential feature for many current technological applications. Cryptographic methods are usually divided into private‐key (or symmetric) and public‐key (or asymmetric) algorithms. The purpose of this paper is to propose a client/server architecture to efficiently authenticate users by means of their fingerprint biometric feature. To do this, the personal data of each user are acquired at the client and, afterwards, they are conveniently encrypted using a combination of up‐to‐date symmetric and asymmetric cryptographic algorithms.

First the main issues related to public‐key and private‐key cryptography, including well‐known algorithms, such as data encryption standard and Rijndael methods are reviewed. After that, a proposal for the implementation of a client/server architecture to authenticate users by means of fingerprint features is proposed.

The results of the experiments show that such architecture is optimal for being applied in real authentication systems, provides high‐security standards and can be applied to any practical biometric system.

Biometrics has become an attractive alternative to password‐based systems: using a password is insecure, as they can easily be forgotten or stolen. Fingerprints are the most widely used biometric feature. This paper uses recent fingerprint identification algorithms together with the most advanced cryptographic methods recommended nowadays. This way, the system utilizes state‐of‐the‐art techniques that are also introduced in many practical systems; that is the reason why it will be flexible enough to integrate, any forthcoming needs of cryptographic systems.

To overview and discuss the technical, economical, legal, and social reasons why public key infrastructures (PKIs) have failed so far, summarizing the lessons learned, and giving expectations about the future development of the field.

A detailed analysis of the developments in the PKI field, pointing out the achievements so far and the issues that still remain unsolved.

The possible reasons for the failure of PKI technology.

Identifies and analyses the problems of PKIs considering the different perspectives, i.e. not only the technical issues but also other issues like the economical, legal, and social issues that have also influenced the failure of PKIs.

The purpose of this paper is to replace electronic meters with smart meters. Smart meters will provide high resolution real-time end-user power consumption data for utilities to better monitor and control the system, which is used for end users to better manage their energy usage and bills. By using smart meters, we can reduce the errors and also minimize human intervention in processing information in an efficient way. So that time will be reduced for organization functionalities and accuracy will be increase.

The authors propose a new cryptosystem based on factor problem over non commutative groups. They tried to use this cryptosystem in the field of electricity. They extend and transform this projected cryptosystem to design expert smart meters based on homomorphic encryption with factor problem.

In these smart meters, a monitoring system is integrated that preserves customer’s privacy by homomorphically accumulating the consumption of all n members of a specific domain.

This expert smart meter system has a proficient linear O(n) communication cost and is proven to protect customer's privacy even in the presence of a corrupted substation and some malicious smart meters.

This chapter reviews the underlying technologies of cryptoassets, including fundamental cryptographic primitives used in distributed ledger technologies and permissionless blockchain technologies and their consensus protocols such as proof-of-work and proof-of-stake. It discusses the pros and cons of existing approaches to improve blockchain scalability and considers the requirements for security and decentralization. The chapter also examines the following techniques: layer 1 tuning, layer 1 sharding, and layer 2 solutions. It concludes with an overview of technologies to swap cryptoassets off-chain, technical requirements for cross-chain transactions, and reviews cross-chain atomic swap implementation using hashed time lock contracts.

The purpose of this paper is to illustrate the many aspects of Poincare recurrence time theorem for an archetype of a complex system, the logistic map.

At the beginning of the twentieth century, Poincare's recurrence theorem had revolutionized modern mechanics and statistical physics. However, this theorem did not attract considerable attention, at least from a numerical and computational point of view. In a series of relatively recent papers, Balakrishnan, Nicolis and Nicolis have addressed the recurrence time problem in a firm basis, introducing notation, theory, and numerical studies. Motivated by this call, the paper proposes to illustrate the many aspects of Poincare recurrence time theorem for an archetype of a complex system, the logistic map. The authors propose here in different tests and computations, each one illuminating the many aspects of the problem of recurrence. The paper ends up with a short discussion and conclusions.

In this paper, the authors obtain new results on computations, each one illuminating the many aspects of the problem of recurrence. One striking aspect of this detailed work, is that when the sizes of the cells in the phase space became considerable, then the recurrence times assume ordinary values.

The paper extends previous results on chaotic maps to the logistic map, enhancing comprehension, making possible connections with number theory, combinatorics and cryptography.

Quantum key distribution (QKD) is a technology, based on the quantum laws of physics, rather than the assumed computational complexity of mathematical problems, to generate and distribute provably secure cipher keys over unsecured channels. The authors are using this concept of QKD for the online banking systems. The paper aims to discuss these issues.

In order to function properly, any system using QKD needs to transport both quantum and classical data from a specified source to a specified destination, resolve competing requests for shared hardware, and manage shared keys between neighboring trusted nodes via a multi-hop mechanism. In this paper the authors are going to explain the transmission and control system for QKD implementation in online banking systems.

This paper presents the transmission and system control of QKD for online banking system is feasible under specific conditions outside a laboratory. Above, the authors have shown the research on the QKD based online banking systems. Though the current researches are focused on QKD systems for online banking systems, the techniques discussed can be applied to other quantum information processing involving photons. Combination with other efforts that are not mentioned here, such as entangled-photon-sources, single photon sources, two-qubit gates, and so on, will provide a rigid foundation for future quantum information technologies.

Recognizing the importance of online access as one of the vehicles for the development of cheaper, faster and more reliable services there are areas of improvement where all involved parties should endeavor to improve toward the deployment of services without unnecessary or excessive risks. This improvement applies to both retail and commercial customers and does not endorse any particular technology.

This paper seeks to describe an approach to mitigate the unsoluble malicious host problem.

By using obfuscation as a component of communication patterns and their switching in an environment of cooperating agents the malicious host can be detected and the attacked agents can be deleted.

Finds that the information about the detected malicious host can be used further, e.g. to prevent another mobile agent from visiting this host.

This paper will be helpful to people involved in information management and computer security issues.