Pub Date : 2024-05-01DOI: 10.1016/j.jiixd.2024.03.001
Peiyu Li , Juntao Gao , Xuelian Li
Partially blind signatures are introduced on the basis of blind signatures, which not only retain the advantages of blind signatures, but also solve the contradiction between anonymity and controllability in blind signatures. With the development of quantum computing technology, it becomes more urgent to construct secure partially blind signature schemes in quantum environments. In this paper, we present a new partially blind signature scheme and prove the security under the Ring-SIS assumption in the random oracle model. To avoid the restart problem of signature schemes caused by rejection sampling, a large number of random numbers are sampled in advance, so that they only need to be re-selected at the current stage without terminating the whole signature process when the conditions are not met. In addition, the hash tree technology is used to reduce communication costs and improve interactive performance. In order to avoid the errors in the security proof of the previous scheme, our proof builds upon and extends the modular framework for blind signatures of Hauck et al. and the correctness, partial blindness, and one-more unforgeability of the scheme are proved in detail according to the properties of the linear hash function.
{"title":"A new lattice-based partially blind signature with more complete proof","authors":"Peiyu Li , Juntao Gao , Xuelian Li","doi":"10.1016/j.jiixd.2024.03.001","DOIUrl":"10.1016/j.jiixd.2024.03.001","url":null,"abstract":"<div><p>Partially blind signatures are introduced on the basis of blind signatures, which not only retain the advantages of blind signatures, but also solve the contradiction between anonymity and controllability in blind signatures. With the development of quantum computing technology, it becomes more urgent to construct secure partially blind signature schemes in quantum environments. In this paper, we present a new partially blind signature scheme and prove the security under the Ring-SIS assumption in the random oracle model. To avoid the restart problem of signature schemes caused by rejection sampling, a large number of random numbers are sampled in advance, so that they only need to be re-selected at the current stage without terminating the whole signature process when the conditions are not met. In addition, the hash tree technology is used to reduce communication costs and improve interactive performance. In order to avoid the errors in the security proof of the previous scheme, our proof builds upon and extends the modular framework for blind signatures of Hauck et al. and the correctness, partial blindness, and one-more unforgeability of the scheme are proved in detail according to the properties of the linear hash function.</p></div>","PeriodicalId":100790,"journal":{"name":"Journal of Information and Intelligence","volume":"2 3","pages":"Pages 236-252"},"PeriodicalIF":0.0,"publicationDate":"2024-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2949715924000155/pdfft?md5=b4f02711a72cc18ef1aaa3009a5e29c6&pid=1-s2.0-S2949715924000155-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140272837","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-05-01DOI: 10.1016/j.jiixd.2024.01.003
Hoang Nguyen, Dina Nawara, Rasha Kashef
The pace of society development is faster than ever before, and the smart city paradigm has also emerged, which aims to enable citizens to live in more sustainable cities that guarantee well-being and a comfortable living environment. This has been done by a network of new technologies hosted in real time to track the activities and provide smart solutions for the incoming requests or problems of the citizens. One of the most often used methodologies for creating a smart city is the Internet of Things (IoT). Therefore, the IoT-enabled smart city research topic, which consists of many different domains such as transportation, healthcare, and agriculture, has recently attracted increasing attention in the research community. Further, advances in artificial intelligence (AI) significantly contribute to the growth of IoT. In this paper, we first present the smart city concept, the background of smart city development and the components of the IoT-based smart city. This is followed up by a literature review of the research literature on the most recent IoT-enabled smart cities developments and breakthroughs empowered by AI techniques to highlight the current stage, major trends and unsolved challenges of adopting AI-driven IoT technologies for the establishment of desirable smart cities. Finally, we summarize the paper with a discussion of future research to provide recommendations for research direction in the smart city domain.
{"title":"Connecting the indispensable roles of IoT and artificial intelligence in smart cities: A survey","authors":"Hoang Nguyen, Dina Nawara, Rasha Kashef","doi":"10.1016/j.jiixd.2024.01.003","DOIUrl":"10.1016/j.jiixd.2024.01.003","url":null,"abstract":"<div><p>The pace of society development is faster than ever before, and the smart city paradigm has also emerged, which aims to enable citizens to live in more sustainable cities that guarantee well-being and a comfortable living environment. This has been done by a network of new technologies hosted in real time to track the activities and provide smart solutions for the incoming requests or problems of the citizens. One of the most often used methodologies for creating a smart city is the Internet of Things (IoT). Therefore, the IoT-enabled smart city research topic, which consists of many different domains such as transportation, healthcare, and agriculture, has recently attracted increasing attention in the research community. Further, advances in artificial intelligence (AI) significantly contribute to the growth of IoT. In this paper, we first present the smart city concept, the background of smart city development and the components of the IoT-based smart city. This is followed up by a literature review of the research literature on the most recent IoT-enabled smart cities developments and breakthroughs empowered by AI techniques to highlight the current stage, major trends and unsolved challenges of adopting AI-driven IoT technologies for the establishment of desirable smart cities. Finally, we summarize the paper with a discussion of future research to provide recommendations for research direction in the smart city domain.</p></div>","PeriodicalId":100790,"journal":{"name":"Journal of Information and Intelligence","volume":"2 3","pages":"Pages 261-285"},"PeriodicalIF":0.0,"publicationDate":"2024-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2949715924000039/pdfft?md5=dbe5fc30bdb6ef659aea2a2609e4cf12&pid=1-s2.0-S2949715924000039-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139540673","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-05-01DOI: 10.1016/j.jiixd.2024.01.005
Yanhan Ji , Zhuo Ma , Luyang Li , Yujuan Sun
S-boxes play a central role in the design of symmetric cipher schemes. For stream cipher applications, an S-box should satisfy several criteria such as high nonlinearity, balanceness, correlation immunity, and so on. In this paper, by using disjoint linear codes, a class of S-boxes possessing high nonlinearity and 1st-order correlation immunity is given. It is shown that the constructed correlation immune S-boxes can possess currently best known nonlinearity, which is confirmed by the example 1st-order correlation immune (12, 3) S-box with nonlinearity 2000. In addition, two other frameworks concerning the criteria of balanced and resiliency are obtained respectively.
{"title":"Constructions of correlation immnue S-boxes with high nonlinearity","authors":"Yanhan Ji , Zhuo Ma , Luyang Li , Yujuan Sun","doi":"10.1016/j.jiixd.2024.01.005","DOIUrl":"https://doi.org/10.1016/j.jiixd.2024.01.005","url":null,"abstract":"<div><p>S-boxes play a central role in the design of symmetric cipher schemes. For stream cipher applications, an S-box should satisfy several criteria such as high nonlinearity, balanceness, correlation immunity, and so on. In this paper, by using disjoint linear codes, a class of S-boxes possessing high nonlinearity and 1st-order correlation immunity is given. It is shown that the constructed correlation immune S-boxes can possess currently best known nonlinearity, which is confirmed by the example 1st-order correlation immune (12, 3) S-box with nonlinearity 2000. In addition, two other frameworks concerning the criteria of balanced and resiliency are obtained respectively.</p></div>","PeriodicalId":100790,"journal":{"name":"Journal of Information and Intelligence","volume":"2 3","pages":"Pages 253-260"},"PeriodicalIF":0.0,"publicationDate":"2024-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2949715924000052/pdfft?md5=ea4e350f6b9d3b0dd5bb671a433bf976&pid=1-s2.0-S2949715924000052-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141314093","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Nowadays, flying ad hoc network (FANET) has captured great attention for its huge potential in military and civilian applications. However, the high-speed movement of unmanned aerial vehicles (UAVs) in three-dimensional (3D) space leads to fast topology change in FANET and brings new challenges to traditional routing mechanisms. To improve the performance of packet transmission in the 3D high dynamic FANETs, we propose a 3D greedy perimeter stateless routing (GPSR) algorithm using adaptive Kalman prediction for FANETs with omnidirectional antenna (KOGPSR). Especially, in data forwarding part of the KOGPSR, we propose a new link metric for greedy forwarding based on a torus-shaped radiation pattern of the omnidirectional antenna of UAVs, and a restricted flooding strategy is introduced to solve the 3D void node problem in geographic routing. In addition, in order to enhance the accuracy of the location information of high dynamic UAVs, we design an adaptive Kalman algorithm to track and predict the motion of UAVs. Finally, a FANET simulation platform based on OPNET is built to depict the performance of the KOGPSR algorithm. The simulation results show that the proposed KOGPSR algorithm is more suitable for the actual 3D high dynamic FANET.
如今,飞行 ad hoc 网络(FANET)因其在军事和民用领域的巨大应用潜力而备受关注。然而,无人飞行器(UAV)在三维(3D)空间的高速运动导致 FANET 拓扑快速变化,给传统路由机制带来了新的挑战。为了提高三维高动态 FANET 中数据包传输的性能,我们提出了一种针对全向天线 FANET 的三维贪婪周边无状态路由(GPSR)算法(KOGPSR),该算法采用自适应卡尔曼预测。特别是在KOGPSR的数据转发部分,我们根据无人机全向天线的环形辐射模式提出了一种新的贪婪转发链路度量,并引入了一种限制性泛洪策略来解决地理路由中的三维空节点问题。此外,为了提高高动态无人机位置信息的准确性,我们设计了一种自适应卡尔曼算法来跟踪和预测无人机的运动。最后,我们建立了一个基于 OPNET 的 FANET 仿真平台来描述 KOGPSR 算法的性能。仿真结果表明,所提出的 KOGPSR 算法更适合实际的三维高动态 FANET。
{"title":"KOGPSR: A 3D GPSR algorithm using adaptive Kalman prediction for FANETs with omnidirectional antenna","authors":"Zhongjie Wang, Yuhan Ruan, Yongzhao Li, Tao Li, Rui Zhang, Jian Liang","doi":"10.1016/j.jiixd.2023.11.001","DOIUrl":"10.1016/j.jiixd.2023.11.001","url":null,"abstract":"<div><p>Nowadays, flying ad hoc network (FANET) has captured great attention for its huge potential in military and civilian applications. However, the high-speed movement of unmanned aerial vehicles (UAVs) in three-dimensional (3D) space leads to fast topology change in FANET and brings new challenges to traditional routing mechanisms. To improve the performance of packet transmission in the 3D high dynamic FANETs, we propose a 3D greedy perimeter stateless routing (GPSR) algorithm using adaptive Kalman prediction for FANETs with omnidirectional antenna (KOGPSR). Especially, in data forwarding part of the KOGPSR, we propose a new link metric for greedy forwarding based on a torus-shaped radiation pattern of the omnidirectional antenna of UAVs, and a restricted flooding strategy is introduced to solve the 3D void node problem in geographic routing. In addition, in order to enhance the accuracy of the location information of high dynamic UAVs, we design an adaptive Kalman algorithm to track and predict the motion of UAVs. Finally, a FANET simulation platform based on OPNET is built to depict the performance of the KOGPSR algorithm. The simulation results show that the proposed KOGPSR algorithm is more suitable for the actual 3D high dynamic FANET.</p></div>","PeriodicalId":100790,"journal":{"name":"Journal of Information and Intelligence","volume":"2 3","pages":"Pages 191-208"},"PeriodicalIF":0.0,"publicationDate":"2024-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2949715923000719/pdfft?md5=2b18cbef163ce52128b820ccdbf4100b&pid=1-s2.0-S2949715923000719-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138613868","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-03-15DOI: 10.1016/j.jiixd.2024.03.003
Video-text retrieval is a challenging task for multimodal information processing due to the semantic gap between different modalities. However, most existing methods do not fully mine the intra-modal interactions, as with the temporal correlation of video frames, which results in poor matching performance. Additionally, the imbalanced semantic information between videos and texts also leads to difficulty in the alignment of the two modalities. To this end, we propose a dual inter-modal interaction network for video-text retrieval, i.e., DI-VTR. To learn the intra-modal interaction of video frames, we design a contextual-related video encoder to obtain more fine-grained content-oriented video representations. We also propose a dual inter-modal interaction module to accomplish accurate multilingual alignment between the video and text modalities by introducing multilingual text to improve the representation ability of text semantic features. Extensive experimental results on commonly-used video-text retrieval datasets, including MSR-VTT, MSVD and VATEX, show that the proposed method achieves significantly improved performance compared with state-of-the-art methods.
{"title":"DI-VTR: Dual inter-modal interaction model for video-text retrieval","authors":"","doi":"10.1016/j.jiixd.2024.03.003","DOIUrl":"10.1016/j.jiixd.2024.03.003","url":null,"abstract":"<div><p>Video-text retrieval is a challenging task for multimodal information processing due to the semantic gap between different modalities. However, most existing methods do not fully mine the intra-modal interactions, as with the temporal correlation of video frames, which results in poor matching performance. Additionally, the imbalanced semantic information between videos and texts also leads to difficulty in the alignment of the two modalities. To this end, we propose a dual inter-modal interaction network for video-text retrieval, i.e., DI-VTR. To learn the intra-modal interaction of video frames, we design a contextual-related video encoder to obtain more fine-grained content-oriented video representations. We also propose a dual inter-modal interaction module to accomplish accurate multilingual alignment between the video and text modalities by introducing multilingual text to improve the representation ability of text semantic features. Extensive experimental results on commonly-used video-text retrieval datasets, including MSR-VTT, MSVD and VATEX, show that the proposed method achieves significantly improved performance compared with state-of-the-art methods.</p></div>","PeriodicalId":100790,"journal":{"name":"Journal of Information and Intelligence","volume":"2 5","pages":"Pages 388-403"},"PeriodicalIF":0.0,"publicationDate":"2024-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S294971592400026X/pdfft?md5=99a5f02c39ebbf60a2f3d5a6ebd243c0&pid=1-s2.0-S294971592400026X-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140268908","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-03-08DOI: 10.1016/j.jiixd.2024.02.001
Membership inference (MI) attacks mainly aim to infer whether a data record was used to train a target model or not. Due to the serious privacy risks, MI attacks have been attracting a tremendous amount of attention in the research community. One existing work conducted — to our best knowledge — the first dedicated survey study in this specific area: The survey provides a comprehensive review of the literature during the period of 2017∼2021 (e.g., over 100 papers). However, due to the tremendous amount of progress (i.e., 176 papers) made in this area since 2021, the survey conducted by the one existing work has unfortunately already become very limited in the following two aspects: (1) Although the entire literature from 2017∼2021 covers 18 ways to categorize (all the proposed) MI attacks, the literature during the period of 2017∼2021, which was reviewed in the one existing work, only covered 5 ways to categorize MI attacks. With 13 ways missing, the survey conducted by the one existing work only covers 27% of the landscape (in terms of how to categorize MI attacks) if a retrospective view is taken. (2) Since the literature during the period of 2017∼2021 only covers 27% of the landscape (in terms of how to categorize), the number of new insights (i.e., why an MI attack could succeed) behind all the proposed MI attacks has been significantly increasing since year 2021. As a result, although none of the previous work has made the insights as a main focus of their studies, we found that the various insights leveraged in the literature can be broken down into 10 groups. Without making the insights as a main focus, a survey study could fail to help researchers gain adequate intellectual depth in this area of research. In this work, we conduct a systematic study to address these limitations. In particular, in order to address the first limitation, we make the 13 newly emerged ways to categorize MI attacks as a main focus on the study. In order to address the second limitation, we provide — to our best knowledge — the first review of the various insights leveraged in the entire literature. We found that the various insights leveraged in the literature can be broken down into 10 groups. Moreover, our survey also provides a comprehensive review of the existing defenses against MI attacks, the existing applications of MI attacks, the widely used datasets (e.g., 107 new datasets), and the evaluation metrics (e.g., 20 new evaluation metrics).
成员推断(MI)攻击的主要目的是推断数据记录是否用于训练目标模型。由于存在严重的隐私风险,MI 攻击在研究界引起了极大的关注。据我们所知,现有的一项工作是首次对这一特定领域进行专门调查研究:该调查对 2017-2021 年间的文献(如 100 多篇论文)进行了全面回顾。然而,由于 2021 年以来该领域取得的巨大进步(即 176 篇论文),现有的一项工作所进行的调查在以下两个方面已经变得非常有限:(1) 虽然 2017-2021 年期间的全部文献涵盖了 18 种 MI 攻击的分类方法(所有提议的),但现有的一项工作所回顾的 2017-2021 年期间的文献仅涵盖了 5 种 MI 攻击的分类方法。由于缺少 13 种方法,如果从回顾的角度来看,现有的一项工作所进行的调查只涵盖了(如何对 MI 攻击进行分类的)27% 的情况。(2)由于 2017 年至 2021 年期间的文献只覆盖了 27%的领域(在如何分类方面),因此自 2021 年以来,所有提出的 MI 攻击背后的新见解(即 MI 攻击为何能够成功)的数量一直在显著增加。因此,尽管之前的研究都没有将洞察力作为研究重点,但我们发现,文献中利用的各种洞察力可分为 10 组。如果不把洞察力作为研究重点,调查研究可能无法帮助研究人员在这一研究领域获得足够的知识深度。在这项工作中,我们针对这些局限性开展了一项系统研究。其中,针对第一个局限,我们将新出现的 13 种 MI 攻击分类方法作为研究重点。为了解决第二个局限性,据我们所知,我们首次对整个文献中利用的各种见解进行了回顾。我们发现,文献中的各种见解可分为 10 组。此外,我们的调查还全面回顾了针对 MI 攻击的现有防御、MI 攻击的现有应用、广泛使用的数据集(如 107 个新数据集)和评估指标(如 20 个新评估指标)。
{"title":"A survey on membership inference attacks and defenses in machine learning","authors":"","doi":"10.1016/j.jiixd.2024.02.001","DOIUrl":"10.1016/j.jiixd.2024.02.001","url":null,"abstract":"<div><p>Membership inference (MI) attacks mainly aim to infer whether a data record was used to train a target model or not. Due to the serious privacy risks, MI attacks have been attracting a tremendous amount of attention in the research community. One existing work conducted — to our best knowledge — the first dedicated survey study in this specific area: The survey provides a comprehensive review of the literature during the period of 2017∼2021 (e.g., over 100 papers). However, due to the tremendous amount of progress (i.e., 176 papers) made in this area since 2021, the survey conducted by the one existing work has unfortunately already become very limited in the following two aspects: (1) Although the entire literature from 2017∼2021 covers 18 ways to categorize (all the proposed) MI attacks, the literature during the period of 2017∼2021, which was reviewed in the one existing work, only covered 5 ways to categorize MI attacks. With 13 ways missing, the survey conducted by the one existing work only covers 27% of the landscape (in terms of how to categorize MI attacks) if a retrospective view is taken. (2) Since the literature during the period of 2017∼2021 only covers 27% of the landscape (in terms of how to categorize), the number of new insights (i.e., why an MI attack could succeed) behind all the proposed MI attacks has been significantly increasing since year 2021. As a result, although none of the previous work has made the insights as a main focus of their studies, we found that the various insights leveraged in the literature can be broken down into 10 groups. Without making the insights as a main focus, a survey study could fail to help researchers gain adequate intellectual depth in this area of research. In this work, we conduct a systematic study to address these limitations. In particular, in order to address the first limitation, we make the 13 newly emerged ways to categorize MI attacks as a main focus on the study. In order to address the second limitation, we provide — to our best knowledge — the first review of the various insights leveraged in the entire literature. We found that the various insights leveraged in the literature can be broken down into 10 groups. Moreover, our survey also provides a comprehensive review of the existing defenses against MI attacks, the existing applications of MI attacks, the widely used datasets (e.g., 107 new datasets), and the evaluation metrics (e.g., 20 new evaluation metrics).</p></div>","PeriodicalId":100790,"journal":{"name":"Journal of Information and Intelligence","volume":"2 5","pages":"Pages 404-454"},"PeriodicalIF":0.0,"publicationDate":"2024-03-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2949715924000064/pdfft?md5=a51bb65bff0598f8d5676e4453da8337&pid=1-s2.0-S2949715924000064-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140090679","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-03-01DOI: 10.1016/j.jiixd.2024.02.004
Shiyang He , Hui Li , Fenghua Li , Ruhui Ma
The security of cryptographic algorithms based on integer factorization and discrete logarithm will be threatened by quantum computers in future. Since December 2016, the National Institute of Standards and Technology (NIST) has begun to solicit post-quantum cryptographic (PQC) algorithms worldwide. CRYSTALS-Kyber was selected as the standard of PQC algorithm after 3 rounds of evaluation. Meanwhile considering the large resource consumption of current implementation, this paper presents a lightweight architecture for ASICs and its implementation on FPGAs for prototyping. In this implementation, a novel compact modular multiplication unit (MMU) and compression/decompression module is proposed to save hardware resources. We put forward a specially optimized schoolbook polynomial multiplication (SPM) instead of number theoretic transform (NTT) core for polynomial multiplication, which can reduce about 74% SLICE cost. We also use signed number representation to save memory resources. In addition, we optimize the hardware implementation of the Hash module, which cuts off about 48% of FF consumption by register reuse technology. Our design can be implemented on Kintex-7 (XC7K325T-2FFG900I) FPGA for prototyping, which occupations of 4777/4993 LUTs, 2661/2765 FFs, 1395/1452 SLICEs, 2.5/2.5 BRAMs, and 0/0 DSP respective of client/server side. The maximum clock frequency can reach at 244 MHz. As far as we know, our design consumes the least resources compared with other existing designs, which is very friendly to resource-constrained devices.
{"title":"A lightweight hardware implementation of CRYSTALS-Kyber","authors":"Shiyang He , Hui Li , Fenghua Li , Ruhui Ma","doi":"10.1016/j.jiixd.2024.02.004","DOIUrl":"10.1016/j.jiixd.2024.02.004","url":null,"abstract":"<div><p>The security of cryptographic algorithms based on integer factorization and discrete logarithm will be threatened by quantum computers in future. Since December 2016, the National Institute of Standards and Technology (NIST) has begun to solicit post-quantum cryptographic (PQC) algorithms worldwide. CRYSTALS-Kyber was selected as the standard of PQC algorithm after 3 rounds of evaluation. Meanwhile considering the large resource consumption of current implementation, this paper presents a lightweight architecture for ASICs and its implementation on FPGAs for prototyping. In this implementation, a novel compact modular multiplication unit (MMU) and compression/decompression module is proposed to save hardware resources. We put forward a specially optimized schoolbook polynomial multiplication (SPM) instead of number theoretic transform (NTT) core for polynomial multiplication, which can reduce about 74% SLICE cost. We also use signed number representation to save memory resources. In addition, we optimize the hardware implementation of the Hash module, which cuts off about 48% of FF consumption by register reuse technology. Our design can be implemented on Kintex-7 (XC7K325T-2FFG900I) FPGA for prototyping, which occupations of 4777/4993 LUTs, 2661/2765 FFs, 1395/1452 SLICEs, 2.5/2.5 BRAMs, and 0/0 DSP respective of client/server side. The maximum clock frequency can reach at 244 MHz. As far as we know, our design consumes the least resources compared with other existing designs, which is very friendly to resource-constrained devices.</p></div>","PeriodicalId":100790,"journal":{"name":"Journal of Information and Intelligence","volume":"2 2","pages":"Pages 167-176"},"PeriodicalIF":0.0,"publicationDate":"2024-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S294971592400009X/pdfft?md5=554b4ca1fa191ff4a92f726744e62d79&pid=1-s2.0-S294971592400009X-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140465321","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-03-01DOI: 10.1016/j.jiixd.2023.10.007
Xiaodong Wu, Ran Duan, Jianbing Ni
This paper delves into the realm of ChatGPT, an AI-powered chatbot that utilizes topic modeling and reinforcement learning to generate natural responses. Although ChatGPT holds immense promise across various industries, such as customer service, education, mental health treatment, personal productivity, and content creation, it is essential to address its security, privacy, and ethical implications. By exploring the upgrade path from GPT-1 to GPT-4, discussing the model's features, limitations, and potential applications, this study aims to shed light on the potential risks of integrating ChatGPT into our daily lives. Focusing on security, privacy, and ethics issues, we highlight the challenges these concerns pose for widespread adoption. Finally, we analyze the open problems in these areas, calling for concerted efforts to ensure the development of secure and ethically sound large language models.
{"title":"Unveiling security, privacy, and ethical concerns of ChatGPT","authors":"Xiaodong Wu, Ran Duan, Jianbing Ni","doi":"10.1016/j.jiixd.2023.10.007","DOIUrl":"10.1016/j.jiixd.2023.10.007","url":null,"abstract":"<div><p>This paper delves into the realm of ChatGPT, an AI-powered chatbot that utilizes topic modeling and reinforcement learning to generate natural responses. Although ChatGPT holds immense promise across various industries, such as customer service, education, mental health treatment, personal productivity, and content creation, it is essential to address its security, privacy, and ethical implications. By exploring the upgrade path from GPT-1 to GPT-4, discussing the model's features, limitations, and potential applications, this study aims to shed light on the potential risks of integrating ChatGPT into our daily lives. Focusing on security, privacy, and ethics issues, we highlight the challenges these concerns pose for widespread adoption. Finally, we analyze the open problems in these areas, calling for concerted efforts to ensure the development of secure and ethically sound large language models.</p></div>","PeriodicalId":100790,"journal":{"name":"Journal of Information and Intelligence","volume":"2 2","pages":"Pages 102-115"},"PeriodicalIF":0.0,"publicationDate":"2024-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2949715923000707/pdfft?md5=d54b43065c82b1dd4241ba7d67e27d46&pid=1-s2.0-S2949715923000707-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136129887","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-03-01DOI: 10.1016/j.jiixd.2024.02.003
Sean Lalla, Rongxing Lu, Yunguo Guan, Songnian Zhang
Outsourcing decision tree models to cloud servers can allow model providers to distribute their models at scale without purchasing dedicated hardware for model hosting. However, model providers may be forced to disclose private model details when hosting their models in the cloud. Due to the time and monetary investments associated with model training, model providers may be reluctant to host their models in the cloud due to these privacy concerns. Furthermore, clients may be reluctant to use these outsourced models because their private queries or their results may be disclosed to the cloud servers. In this paper, we propose BloomDT, a privacy-preserving scheme for decision tree inference, which uses Bloom filters to hide the original decision tree's structure, the threshold values of each node, and the order in which features are tested while maintaining reliable classification results that are secure even if the cloud servers collude. Our scheme's security and performance are verified through rigorous testing and analysis.
{"title":"BloomDT - An improved privacy-preserving decision tree inference scheme","authors":"Sean Lalla, Rongxing Lu, Yunguo Guan, Songnian Zhang","doi":"10.1016/j.jiixd.2024.02.003","DOIUrl":"10.1016/j.jiixd.2024.02.003","url":null,"abstract":"<div><p>Outsourcing decision tree models to cloud servers can allow model providers to distribute their models at scale without purchasing dedicated hardware for model hosting. However, model providers may be forced to disclose private model details when hosting their models in the cloud. Due to the time and monetary investments associated with model training, model providers may be reluctant to host their models in the cloud due to these privacy concerns. Furthermore, clients may be reluctant to use these outsourced models because their private queries or their results may be disclosed to the cloud servers. In this paper, we propose BloomDT, a privacy-preserving scheme for decision tree inference, which uses Bloom filters to hide the original decision tree's structure, the threshold values of each node, and the order in which features are tested while maintaining reliable classification results that are secure even if the cloud servers collude. Our scheme's security and performance are verified through rigorous testing and analysis.</p></div>","PeriodicalId":100790,"journal":{"name":"Journal of Information and Intelligence","volume":"2 2","pages":"Pages 130-147"},"PeriodicalIF":0.0,"publicationDate":"2024-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2949715924000088/pdfft?md5=7d9b7fbb49ca778f809e1f16a75c50b6&pid=1-s2.0-S2949715924000088-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140469188","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-03-01DOI: 10.1016/j.jiixd.2024.01.001
Qi Xu , Hui Zhu , Yandong Zheng , Fengwei Wang , Le Gao
With the rapid development of location-based services and online social networks, POI recommendation services considering geographic and social factors have received extensive attention. Meanwhile, the vigorous development of cloud computing has prompted service providers to outsource data to the cloud to provide POI recommendation services. However, there is a degree of distrust of the cloud by service providers. To protect digital assets, service providers encrypt data before outsourcing it. However, encryption reduces data availability, making it more challenging to provide POI recommendation services in outsourcing scenarios. Some privacy-preserving schemes for geo-social-based POI recommendation have been presented, but they have some limitations in supporting group query, considering both geographic and social factors, and query accuracy, making these schemes impractical. To solve this issue, we propose two practical and privacy-preserving geo-social-based POI recommendation schemes for single user and group users, which are named GSPR-S and GSPR-G. Specifically, we first utilize the quad tree to organize geographic data and the MinHash method to index social data. Then, we apply BGV fully homomorphic encryption to design some private algorithms, including a private max/min operation algorithm, a private rectangular set operation algorithm, and a private rectangular overlapping detection algorithm. After that, we use these algorithms as building blocks in our schemes for efficiency improvement. According to security analysis, our schemes are proven to be secure against the honest-but-curious cloud servers, and experimental results show that our schemes have good performance.
随着基于位置的服务和在线社交网络的快速发展,考虑地理和社交因素的 POI 推荐服务受到广泛关注。与此同时,云计算的蓬勃发展也促使服务提供商将数据外包给云,以提供 POI 推荐服务。然而,服务提供商对云存在一定程度的不信任。为了保护数字资产,服务提供商会在外包数据前对其进行加密。然而,加密降低了数据的可用性,使得在外包场景中提供 POI 推荐服务更具挑战性。目前已经提出了一些基于地理社交的 POI 推荐的隐私保护方案,但这些方案在支持群组查询、考虑地理和社交因素以及查询准确性方面存在一些局限性,使得这些方案不切实际。为了解决这个问题,我们提出了两种实用且能保护隐私的基于地理社交的 POI 推荐方案,分别适用于单个用户和群体用户,分别命名为 GSPR-S 和 GSPR-G。具体来说,我们首先利用四叉树来组织地理数据,并利用 MinHash 方法来索引社交数据。然后,我们应用 BGV 全同态加密技术设计了一些私有算法,包括私有最大/最小运算算法、私有矩形集运算算法和私有矩形重叠检测算法。之后,我们将这些算法作为我们方案的构建模块,以提高效率。根据安全性分析,我们的方案被证明可以安全地对抗诚实但好奇的云服务器,实验结果表明我们的方案具有良好的性能。
{"title":"Practical and privacy-preserving geo-social-based POI recommendation","authors":"Qi Xu , Hui Zhu , Yandong Zheng , Fengwei Wang , Le Gao","doi":"10.1016/j.jiixd.2024.01.001","DOIUrl":"10.1016/j.jiixd.2024.01.001","url":null,"abstract":"<div><p>With the rapid development of location-based services and online social networks, POI recommendation services considering geographic and social factors have received extensive attention. Meanwhile, the vigorous development of cloud computing has prompted service providers to outsource data to the cloud to provide POI recommendation services. However, there is a degree of distrust of the cloud by service providers. To protect digital assets, service providers encrypt data before outsourcing it. However, encryption reduces data availability, making it more challenging to provide POI recommendation services in outsourcing scenarios. Some privacy-preserving schemes for geo-social-based POI recommendation have been presented, but they have some limitations in supporting group query, considering both geographic and social factors, and query accuracy, making these schemes impractical. To solve this issue, we propose two practical and privacy-preserving geo-social-based POI recommendation schemes for single user and group users, which are named GSPR-S and GSPR-G. Specifically, we first utilize the quad tree to organize geographic data and the MinHash method to index social data. Then, we apply BGV fully homomorphic encryption to design some private algorithms, including a private max/min operation algorithm, a private rectangular set operation algorithm, and a private rectangular overlapping detection algorithm. After that, we use these algorithms as building blocks in our schemes for efficiency improvement. According to security analysis, our schemes are proven to be secure against the honest-but-curious cloud servers, and experimental results show that our schemes have good performance.</p></div>","PeriodicalId":100790,"journal":{"name":"Journal of Information and Intelligence","volume":"2 2","pages":"Pages 148-166"},"PeriodicalIF":0.0,"publicationDate":"2024-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2949715924000015/pdfft?md5=a2e0865bfbb9a59bb240fc8da82554c1&pid=1-s2.0-S2949715924000015-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139395049","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}