W. El Hadj Youssef, Ali Abdelli, Fethi Dridi, Rim Brahim, Mohsen Machhout
{"title":"An Efficient Lightweight Cryptographic Instructions Set Extension for IoT Device Security","authors":"W. El Hadj Youssef, Ali Abdelli, Fethi Dridi, Rim Brahim, Mohsen Machhout","doi":"10.1155/2022/9709601","DOIUrl":"https://doi.org/10.1155/2022/9709601","url":null,"abstract":"The Internet of Things is changing all sectors such as manufacturing, agriculture, city infrastructure, and the automotive industry. All these applications ask for secure processors that can be embedded in the IoT devices. Furthermore, these devices are restricted in terms of computing capabilities, memory, and power consumption. A major challenge is how to meet the need for security in such resource-constrained devices. This paper presents a customized version of LEON3, the ReonV RISCV (Reduced Instruction Set Computer-five) processor, dedicated for IoT applications that has strong effective security mechanisms built in at the design stage. Firstly, efficient lightweight cipher designs are elaborated and validated. Then, the proposed cryptographic instructions (PRESENT and PRINCE) are integrated into the default instruction set architecture of the ReonV processor core. The instruction set extensions (ISE) of lightweight cipher modules can be instantiated in software routines exactly as the instructions of the base architecture. A single instruction is needed to implement a full lightweight cryptographic instruction. The customized ReonV RISCV processor is implemented on a Xilinx FPGA platform and is evaluated for Slice LUTs plus FF-pairs, frequency, and throughput. Obtained results show that our proposed concepts not only can achieve good encryption results with high performance and reduced cost but also are secure enough to resist against the most common attacks.","PeriodicalId":167643,"journal":{"name":"Secur. Commun. Networks","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-02-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129730688","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Bo Wang, Yucai Li, Xiaohan Wu, Yanyan Ma, Zengren Song, Min Wu
{"title":"Face Forgery Detection Based on the Improved Siamese Network","authors":"Bo Wang, Yucai Li, Xiaohan Wu, Yanyan Ma, Zengren Song, Min Wu","doi":"10.1155/2022/5169873","DOIUrl":"https://doi.org/10.1155/2022/5169873","url":null,"abstract":"Face tampering is an intriguing task in video/image genuineness identification and has attracted significant amounts of attention in recent years. In this work, we propose a face forgery detection method that consists of preprocessing, an improved Siamese network-based feature extractor (including a feature alignment module), and postprocessing (a voting principle). Roughly speaking, our method extracts the features in the grey space of face/background image pairs and measures the difference to make decisions. Experiments on several standard databases prove the effectiveness of our method, and especially on the low-quality subdataset of the FaceForensics++ , our method achieves a competitive result.","PeriodicalId":167643,"journal":{"name":"Secur. Commun. Networks","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-02-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133955085","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Kazi Tamzid Akhter Md. Hasib, Ixion Chowdhury, Saadman Sakib, Mohammad Monirujjaman Khan, Nawal Alsufyani, A. Alsufyani, S. Bourouis
{"title":"Electronic Health Record Monitoring System and Data Security Using Blockchain Technology","authors":"Kazi Tamzid Akhter Md. Hasib, Ixion Chowdhury, Saadman Sakib, Mohammad Monirujjaman Khan, Nawal Alsufyani, A. Alsufyani, S. Bourouis","doi":"10.1155/2022/2366632","DOIUrl":"https://doi.org/10.1155/2022/2366632","url":null,"abstract":"Bangladesh should have owned a decentralized medical record server. We face a lot of issues, such as doctor’s appointments, report organization in one spot, and report follow-ups. People now bring a large number of papers to the doctor’s chamber. They carry prescriptions, reports, and X-ray files, among other things. It complicates everyone’s life as a result. All of the reports must be reviewed by doctors on a regular basis. It is difficult to read old reports on a regular basis, and patients do not receive the correct medications or treatment. Doctors also find it extremely difficult to comprehend handwritten prescriptions. Data security, authenticity, time management, and other areas of data administration are dramatically improved when blockchain (smart contract) technology is linked with standard database management solutions. Blockchain is a groundbreaking, decentralized technology that protects data from unauthorized access. After smart contracts are implemented, the management will be satisfied with the patients. As a result, maintaining data privacy and accountability in the system is tough. It signifies that the information is only accessible to those who have been authenticated. This study focuses on limiting third-party engagement in medical health data and improving data security. Throughout the process, this will improve accessibility and time efficiency. People will feel safer during the payment procedure, which is the most significant benefit. A smart contract and a peer-to-peer encrypted technology were used. The hacker will not be able to gain access to this system since this document uses an immutable ledger. They will not be able to change any of the data if they gain access to the system. If the items are found to be defective, the transaction will be halted. Transaction security will be a viable option for recasting these problems using cryptographic methodologies. We developed a website where patients and doctors will both benefit because of the use of blockchain technology to ensure the security of medical data. We have different profiles for doctors and patients. In the patient profile, they can create their own account by using a unique address, name, and age. This unique address will be created from the genesis block. The unique address is completely private to the owner, who will remain fully secure in our network. After creating an account, the patient can view the doctors’ list and they can upload their medical reports such as prescriptions and X-rays. All the records uploaded by the patient will be stored on our local server (Ganache). The records are stored as hashed strings of the data. Those files will also have a unique address, and it will be shown in the patient profile. After granting access, the doctors will be able to view their records in the respective doctor’s profile. For accessing the options such as uploading, viewing, or editing the data, Ethereum currency (a fee) will have to be paid in order to com","PeriodicalId":167643,"journal":{"name":"Secur. Commun. Networks","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-02-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126549572","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Certificateless Reliable and Privacy-Preserving Auditing of Group Shared Data for FOG-CPSs","authors":"M. S. Burra, Soumyadev Maity","doi":"10.1155/2022/6705948","DOIUrl":"https://doi.org/10.1155/2022/6705948","url":null,"abstract":"FOG-enabled cyber-physical systems (FOG-CPSs) open new security challenges as the local edge devices are easier to compromise than a traditional cloud server. Remote data integrity checking (RDIC) plays an important role in safeguarding against data corruption from a storage server. Certificateless cryptography (CLPKC)-based RDIC schemes do not suffer from the drawbacks of the public key infrastructure (PKI)-based RDIC protocols. Most of the CLPKC-based RDIC schemes proposed in the literature deal with personal data. However, in a FOG-CPS, it is also important to audit a data file shared by a group of edge devices. Most of the existing group shared data auditing schemes lack mechanisms to defend against a semi-trusted data auditor applicable for a FOG-CPS scenario. In order to address these issues, in this paper, we propose a novel CLPKC-based group shared data auditing protocol tailored to the specific security requirements of a FOG-CPS. Besides, we perform a detailed cryptanalysis of two existing CLPKC-based privacy-preserving group shared data auditing schemes. The formal security analysis of our proposed protocol establishes metadata and data integrity proof unforgeability and claimed zero-knowledge privacy and reliability properties through rigorous proofs in the random oracle model setting. Performance evaluations establish the efficiency of our proposed protocol.","PeriodicalId":167643,"journal":{"name":"Secur. Commun. Networks","volume":"108 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-02-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117285049","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Y. Chen, H. Xing, S. Chen, Ning Zhang, X. Chen, J. Huang
{"title":"Game-Based Channel Selection for UAV Services in Mobile Edge Computing","authors":"Y. Chen, H. Xing, S. Chen, Ning Zhang, X. Chen, J. Huang","doi":"10.1155/2022/4827956","DOIUrl":"https://doi.org/10.1155/2022/4827956","url":null,"abstract":"Computation offloading is a hot research topic in mobile edge computing (MEC). Computation offloading among multiedge nodes in heterogeneous networks can help reduce offloading cost. In addition, the unmanned aerial vehicles (UAVs) play a key role in MEC, where UAVs in the air communicate with ground base stations to improve the network performance. However, limited channel resources can lead to the increase of transmission delay and the decline of communication quality. Effective channel selection mechanisms can help address those issues by improving transmission rate and ensuring communication quality. In this paper, we study channel selection during communication between multiple UAVs and base stations in an MEC system with heterogeneous networks. To maximize the transmission rate of each UAV user, we formulate a channel selection problem and model it as a noncooperative game. Then, we prove the existence of Nash equilibrium (NE). In addition, we design a multiple UAV-enabled transmission channel selection (UTCS) algorithm to obtain the equilibrium strategy profile of all the UAV users. Experimental results validate that UTCS algorithm can converge after a finite number of iterations and it outperforms random transmission algorithm (RTA) and sequential transmission algorithm (STA).","PeriodicalId":167643,"journal":{"name":"Secur. Commun. Networks","volume":"2013 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-02-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125894489","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Sharpening and Detection of Road Studs for Intelligent Vehicles at Nighttime","authors":"Muhammad Hameed Siddiqi, Ibrahim Alrashdi","doi":"10.1155/2022/9329715","DOIUrl":"https://doi.org/10.1155/2022/9329715","url":null,"abstract":"Intelligent vehicles need to survive against various environments on roads such as sunlit, unclear, showery, shadowy, and inside tunnel conditions. This research designs a robust approach for detecting road studs at nighttime, which is the combination of various statistical methods. This detection approach is a unique approach developed for the detection of road lanes instead of road-painted lanes. Therefore, we detect road studs (cat eyes) instead of the painted lanes on roads at nighttime as the road studs have higher intensities at nighttime. First, we utilized Butterworth low-pass filter in order to sharpen the images. Second, we converted the image to grayscale and extracted the corresponding region of interest (ROI) from it. Then, the Canny edge detection algorithm was applied to create boundary lines in images. Finally, the Hough transform was applied to detect the desired lanes in the images, which are the road studs, and hence we successfully detected the road studs in images. We have used our own dataset for the stud’s detection, which considered most of the limitations of the previous datasets. Also, the dataset was collected in naturalistic environments at nighttime. The experimental result presents that the designed approach is accurate and robust for road stud detection against nighttime.","PeriodicalId":167643,"journal":{"name":"Secur. Commun. Networks","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-02-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127888620","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Naeem Ahmed, Rashid Amin, Hamza Aldabbas, D. Koundal, Bader Alouffi, Tariq Shah
{"title":"Machine Learning Techniques for Spam Detection in Email and IoT Platforms: Analysis and Research Challenges","authors":"Naeem Ahmed, Rashid Amin, Hamza Aldabbas, D. Koundal, Bader Alouffi, Tariq Shah","doi":"10.1155/2022/1862888","DOIUrl":"https://doi.org/10.1155/2022/1862888","url":null,"abstract":"Nowaday, emails are used in almost every field, from business to education. Emails have two subcategories, i.e., ham and spam. Email spam, also called junk emails or unwanted emails, is a type of email that can be used to harm any user by wasting his/her time, computing resources, and stealing valuable information. The ratio of spam emails is increasing rapidly day by day. Spam detection and filtration are significant and enormous problems for email and IoT service providers nowadays. Among all the techniques developed for detecting and preventing spam, filtering email is one of the most essential and prominent approaches. Several machine learning and deep learning techniques have been used for this purpose, i.e., Naïve Bayes, decision trees, neural networks, and random forest. This paper surveys the machine learning techniques used for spam filtering techniques used in email and IoT platforms by classifying them into suitable categories. A comprehensive comparison of these techniques is also made based on accuracy, precision, recall, etc. In the end, comprehensive insights and future research directions are also discussed.","PeriodicalId":167643,"journal":{"name":"Secur. Commun. Networks","volume":"60 5","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-02-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121006036","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Blockchain-Based Proof of Retrievability Scheme","authors":"Yan Ren, Haipeng Guan, Qiuxia Zhao, Zongxiang Yi","doi":"10.1155/2022/3186112","DOIUrl":"https://doi.org/10.1155/2022/3186112","url":null,"abstract":"In the internet of things, user information is usually collected by all kinds of smart devices. The collected user information is stored in the cloud storage, and there is a risk of information leakage. In order to protect the security and the privacy of user information, the user and cloud provider will periodically execute a protocol called proof of retrievability scheme. A proof of retrievability scheme ensures the security of the data by generating proof to convince the user that the cloud provider does correctly store the user information. In this paper, we construct a proof of retrievability scheme using the blockchain technology. Using the advantage that the stored data cannot be tampered with in blockchain, this ensures the integrity of the data. Specifically, some related definitions, security models, and a blockchain-based construction of a proof of retrievability scheme are given. Then the validity and security of the scheme are proved later. As a result, user information can be protected by our scheme.","PeriodicalId":167643,"journal":{"name":"Secur. Commun. Networks","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-02-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127415359","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
M. Ullah, R. Khan, Irfan Ullah Khan, N. Aslam, Sumayh S. Aljameel, Muhammad Inam Ul Haq, Muhammad Arshad Islam
{"title":"Profile Aware ObScure Logging (PaOSLo): A Web Search Privacy-Preserving Protocol to Mitigate Digital Traces","authors":"M. Ullah, R. Khan, Irfan Ullah Khan, N. Aslam, Sumayh S. Aljameel, Muhammad Inam Ul Haq, Muhammad Arshad Islam","doi":"10.1155/2022/2109024","DOIUrl":"https://doi.org/10.1155/2022/2109024","url":null,"abstract":"Web search querying is an inevitable activity of any Internet user. The web search engine (WSE) is the easiest way to search and retrieve data from the Internet. The WSE stores the user’s search queries to retrieve the personalized search result in a form of query log. A user often leaves digital traces and sensitive information in the query log. WSE is known to sell the query log to a third party to generate revenue. However, the release of the query log can compromise the security and privacy of a user. In this work, we propose a Profile Aware ObScure Logging (PaOSLo) Web search privacy-preserving protocol that mitigates the digital traces a user leaves in Web searching. PaOSLo systematically groups users based on profile similarity. The primary objective of this work is to evaluate the impact of the systematic group compared to random grouping. We first computed the similarity between the users’ profiles and then clustered them using the K-mean algorithm to group the users systematically. Unlikability and indistinguishability are the two dimensions in which we have measured the privacy of a user. To compute the impact of systematic grouping on a user’s privacy, we have experimented with and compared the performance of PaOSLo with modern distributed protocols like OSLo and UUP(e). Results show that, at the top degree of the ODP hierarchy, PaOSLo preserved 10% and 3% better profile privacy than the modern distributed protocols mentioned above. In addition, the PaOSLo has less profile exposure for any group size and at each degree of the ODP hierarchy.","PeriodicalId":167643,"journal":{"name":"Secur. Commun. Networks","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-02-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126790851","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A Blockchain-Assisted Electronic Medical Records by Using Proxy Reencryption and Multisignature","authors":"Xiaoguang Liu, Junqiu Yan, Shuqiang Shan, Rongjun Wu","doi":"10.1155/2022/6737942","DOIUrl":"https://doi.org/10.1155/2022/6737942","url":null,"abstract":"Electronic medical records (EMR) have been commonly used in medical institutions in recent years. In particular, the combination of EMR and the cloud server has significantly improved the work efficiency and therapeutic level of the hospital. It also raises some security concerns, e.g., the information leaks. Blockchain has features including decentralization, traceability, openness, and tamper resistance. Therefore, the technology may be used to overcome the above flaws. In this paper, we introduce a new blockchain-assisted EMR in the cloud environment by using proxy reencryption and sequential multisignature. Firstly, blockchain makes the scheme have high-security performance without a trusty center. Secondly, we use proxy reencryption to protect personal medical data while helping doctors to access patients’ historical medical records. Moreover, the doctors have used a sequential multisignature, which is practical and can effectively improve security performance. The analysis results show that the proposed scheme can satisfy various security features of EMR and has an ideal computational and communication cost. Finally, the scheme is implemented to show its performance.","PeriodicalId":167643,"journal":{"name":"Secur. Commun. Networks","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125542195","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}