Please login to be able to save your searches and receive alerts for new content matching your search criteria.
Since the advent of networked systems, fuzzy graph theory has surfaced as a fertile paradigm for handling uncertainties and ambiguities. Among the different modes of handling challenges created by the uncertainties and ambiguities of current networked systems, integrating fuzzy graph theory with cryptography has emerged as the most promising approach. In this regard, this review paper elaborates on potentially studying fuzzy graph-based cryptographic techniques, application perspectives, and future research directions. Since the expressive power of fuzzy graphs allows the cryptographic schemes to handle imprecise information and to enhance security in many domains, several domains have benefited, such as image encryption, key management, and attribute-based encryption. The paper analyzes in depth the research landscape, mainly by focusing on the varied techniques used, such as fuzzy logic for key generation and fuzzy attribute representation for access control policies. A comparison with performance metrics unveils the trade-offs and advantages of different fuzzy graph-based approaches in efficiency, security strength, and computational overhead. Additionally, the survey explores the security applications of fuzzy graph-based cryptography and underpins potential development for secure communication in wireless sensor networks, privacy-preserving data mining, fine-grained access control in cloud computing, and blockchain security. Some challenges and research directions, such as the standardization of fuzzy logic operators, algorithmic optimization, integration with emerging technologies, and exploitation of post-quantum cryptography applications, are also brought out. This review will thus bring insight into this interdisciplinary domain and stimulate further research for the design of more robust, adaptive, and secure cryptographic systems in the wake of rising complexities and uncertainties.
Wireless sensor networks (WSNs) have attracted a lot of interests over last years in security to ensure integrity, authenticity and data confidentiality. WSN applications are numerous, which range from smart home in indoor deployment offices to smart agriculture in outdoor deployments. Due to the deployment of nodes in remote areas, the solution brought to the wireless sensor network to increase the information security consists in protecting the messages exchanged between nodes. In the paper, modifications in the key management scheme are presented. Due to resource constraints in the sensor nodes, the proposed scheme ensures a distribution of the secured keys between nodes. New session keys transmitted between sensor nodes are defined during the discovery and path key phases. The experimental results prove that the proposed scheme is adapted to the WSN applications in terms of connectivity and resiliency.
The recent Financial Action Task Force (FATF) Recommendations define virtual assets and virtual asset service providers (VASPs), and require under the Travel Rule that originating VASPs obtain and hold the required and accurate originator information and the required beneficiary information on virtual asset transfers. In this paper, we discuss the notion of key ownership evidence as a core part of originator and beneficiary information required by the FATF Recommendations. We discuss the approaches to securely communicate the originator and beneficiary information between VASPs, and review the existing standards for public-key certificates as applied to VASPs and virtual asset transfers. We propose the notion of a trust network of VASPs in which originator and beneficiary information, including key ownership information, can be exchanged securely off-chain while observing the individual privacy requirements.
Establishing pairwise symmetric keys is a critical resource management issue in wireless sensor networks. Usually deployed in a hostile environment where malicious users or adversaries are bound to exist, wireless sensors are subject to a general attack model—a sensor node can be captured, re-programmed, and consequently exhibit arbitrary faulty behaviors. Thus, sensor key management is a challenging research issue, attracting a high level of interests in recent years. In general, a key management system works by first pre-allocating some keys to each sensor before deployment. After deployment, neighboring sensors can undergo a discovery process to set up shared keys for secure communications. An efficient key management scheme has to work under severe system constraints including limited memory storage and communication overhead in each sensor. In this chapter we provide a detailed survey of state-of-the-art sensor key management techniques that have demonstrated a high degree of effectiveness.
In this chapter, we provide a comprehensive survey of security issues in wireless sensor networks. We show that the main features of WSNs, namely their limited resources, wireless communications, and close physical coupling with environment, are the main causes of the their security vulnerabilities. We discuss the main attacks stemming from these vulnerabilities, along with the solutions proposed in the literature to cope with them. The security solutions are analyzed with respect to the different layers of the network protocol stack and cover the following issues: key management, secure data dissemination, secure data aggregation, secure channel access and secure node compromise.
Access control of electronic records involves establishing a common set of access requirements, binding those access requirements to the electronic records, and computing whether or not the criteria are met for allowing access. An electronic record can be an email, a document, a spreadsheet, or a series of sensor readings. Records that need to be controlled are stored in an encrypted file, which is decrypted when access criteria are verified. The number of controlled electronic records is rising dramatically. Current methods of key management often group and segment objects by type to reduce the number of keys and the associated management overhead. This approach compromises a large number of content files and uses PKI managed wrapped keys to extract cryptographic keys. The proposed process uses a hybrid symmetric/asymmetric keying approach that provides a unique key for each electronic record while minimizing the key management requirements. This method reduces losses to individual electronic records when keys are compromised, but with a greatly reduced key management process that leverages PKI processes.