Pub Date : 2021-01-01DOI: 10.3966/160792642021012201009
Guojun Wang, Xueya Xia, S. Ji, C. Lai
Smart grid is a new generation of power system on the strength of rapid-speed bidirectional communication network. In smart grid, the electricity data from users needs to be collected to realize efficient energy management, which may reveal their privacy. In the past period of time, data aggregation protocols have been extensively studied to solve this problem. However, these protocols treat users’ electricity data as single-dimensional data, which is inconsistent with reality. Moreover, key leakage is also a serious security threat in the smart grid. Therefore, we propose a multi-dimensional data aggregation protocol with forward security. In this protocol, a cube data structure is designed to represent the multi-dimensional electricity consumption data of users in a region over multiple time periods, realizing the dual aggregation of electricity data both in time and space. In addition, security analysis shows that the proposed protocol satisfies multiple security properties and performance analysis shows that our protocol is more superior in the smart grid environment.
{"title":"A Privacy-preserving Multi-dimensional Data Aggregation Scheme with Forward Security in Smart Grid","authors":"Guojun Wang, Xueya Xia, S. Ji, C. Lai","doi":"10.3966/160792642021012201009","DOIUrl":"https://doi.org/10.3966/160792642021012201009","url":null,"abstract":"Smart grid is a new generation of power system on the strength of rapid-speed bidirectional communication network. In smart grid, the electricity data from users needs to be collected to realize efficient energy management, which may reveal their privacy. In the past period of time, data aggregation protocols have been extensively studied to solve this problem. However, these protocols treat users’ electricity data as single-dimensional data, which is inconsistent with reality. Moreover, key leakage is also a serious security threat in the smart grid. Therefore, we propose a multi-dimensional data aggregation protocol with forward security. In this protocol, a cube data structure is designed to represent the multi-dimensional electricity consumption data of users in a region over multiple time periods, realizing the dual aggregation of electricity data both in time and space. In addition, security analysis shows that the proposed protocol satisfies multiple security properties and performance analysis shows that our protocol is more superior in the smart grid environment.","PeriodicalId":50172,"journal":{"name":"Journal of Internet Technology","volume":"22 1","pages":"91-99"},"PeriodicalIF":1.6,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"70039375","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2020-12-01DOI: 10.3966/160792642020122107022
Yinglong Li, Zhenjiang Zhang, Zhiyuan Zhang, Yi-Chih Kao
Internet of Vehicles (IoV) generates large amounts of data at the network edge. Machine learning models are often built on these data, to enable the detection, classification, and prediction of traffic events. Due to network bandwidth, storage, and especially privacy concerns, it is often impossible to send all the IoV data to the edge server for centralized model training . Federated learning is a promising paradigm for distributed machine learning, which enables edge nodes to train models locally. As vehicle usually has unreliable and relatively slow network connection, reducing the communication overhead is importance. In this paper, we propose a secure federated learning with efficient communication (SFLEC) scheme in vehicle network. To protect the privacy of local update, we upload the updated parameters of the model with local differential privacy. We further propose a client selection approach that identifies relevant updates trained by vehicles and prevents irrelevant updates from being uploaded for reduced network footprint to achieve efficient communication. Then we prove the loss function of the trained FL in our scheme exits a theoretical convergence. Finally, we evaluate our scheme on two datasets and compare with basic FL. Our proposed scheme improves the communication efficiency, while preserves the data privacy.
{"title":"Secure federated learning with efficient communication in vehicle network","authors":"Yinglong Li, Zhenjiang Zhang, Zhiyuan Zhang, Yi-Chih Kao","doi":"10.3966/160792642020122107022","DOIUrl":"https://doi.org/10.3966/160792642020122107022","url":null,"abstract":"Internet of Vehicles (IoV) generates large amounts of data at the network edge. Machine learning models are often built on these data, to enable the detection, classification, and prediction of traffic events. Due to network bandwidth, storage, and especially privacy concerns, it is often impossible to send all the IoV data to the edge server for centralized model training . Federated learning is a promising paradigm for distributed machine learning, which enables edge nodes to train models locally. As vehicle usually has unreliable and relatively slow network connection, reducing the communication overhead is importance. In this paper, we propose a secure federated learning with efficient communication (SFLEC) scheme in vehicle network. To protect the privacy of local update, we upload the updated parameters of the model with local differential privacy. We further propose a client selection approach that identifies relevant updates trained by vehicles and prevents irrelevant updates from being uploaded for reduced network footprint to achieve efficient communication. Then we prove the loss function of the trained FL in our scheme exits a theoretical convergence. Finally, we evaluate our scheme on two datasets and compare with basic FL. Our proposed scheme improves the communication efficiency, while preserves the data privacy.","PeriodicalId":50172,"journal":{"name":"Journal of Internet Technology","volume":"21 1","pages":"2075-2084"},"PeriodicalIF":1.6,"publicationDate":"2020-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47602368","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2020-11-01DOI: 10.3966/160792642020112106019
Ziyue Zhang, Jie Gong, Xiang Chen, Terng-Yin Hsu
Computation-aware delay optimal mobility management (MM) is an important problem in ultra-dense network (UDN) with mobile edge computing (MEC). Since the additional time delay caused by task computation is not taken into consideration, traditional radio access-oriented mobility management scheme cannot guarantee the overall delay performance of delay-sensitive user equipment (UE). In this paper, we propose a novel dynamic programming-based mobility management (DPMM) scheme to minimize the average delay under an energy consumption constraint. DPMM makes MM decisions using statistic information to handle the inaccurate state information. Cooperative data transmission is adopted to improve the delay performance. Simulation shows that the proposed DPMM scheme can achieve delay performance close to optimal and reduce the frequency of handover. However, the wireless link, computation resources and UE’s location in UDN environment is dynamic, which leads to information uncertainties. We further propose an MM scheme based on deep Q-network (DQN) to learn the system information from the environment. In this scheme, UE takes the current and past observed delay as experience, learning the optimal mobility management strategy through DQN training. Simulation shows that DQN-based MM can learn from experience and reduce the handover frequency to a certain degree.
{"title":"Reinforcement learning based computation-aware mobility management in ultra dense networks","authors":"Ziyue Zhang, Jie Gong, Xiang Chen, Terng-Yin Hsu","doi":"10.3966/160792642020112106019","DOIUrl":"https://doi.org/10.3966/160792642020112106019","url":null,"abstract":"Computation-aware delay optimal mobility management (MM) is an important problem in ultra-dense network (UDN) with mobile edge computing (MEC). Since the additional time delay caused by task computation is not taken into consideration, traditional radio access-oriented mobility management scheme cannot guarantee the overall delay performance of delay-sensitive user equipment (UE). In this paper, we propose a novel dynamic programming-based mobility management (DPMM) scheme to minimize the average delay under an energy consumption constraint. DPMM makes MM decisions using statistic information to handle the inaccurate state information. Cooperative data transmission is adopted to improve the delay performance. Simulation shows that the proposed DPMM scheme can achieve delay performance close to optimal and reduce the frequency of handover. However, the wireless link, computation resources and UE’s location in UDN environment is dynamic, which leads to information uncertainties. We further propose an MM scheme based on deep Q-network (DQN) to learn the system information from the environment. In this scheme, UE takes the current and past observed delay as experience, learning the optimal mobility management strategy through DQN training. Simulation shows that DQN-based MM can learn from experience and reduce the handover frequency to a certain degree.","PeriodicalId":50172,"journal":{"name":"Journal of Internet Technology","volume":"21 1","pages":"1785-1794"},"PeriodicalIF":1.6,"publicationDate":"2020-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49649375","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2020-09-01DOI: 10.3966/160792642020092105013
Wei-Chih Hong, Y. Chen, Ren-Kai Yang, Bo Li, Jung-San Lee
The number of people surfing over the e-commerce has reached to 1.6 billion, while the transaction scale has approached to 2,304 billion dollars at the end of 2017. No doubt that the security and efficiency of an e-payment system have attracted lots of attention in the field of e-commerce. That is the reason why the blockchain technique has been widely spread to most of the e-commerce mechanisms. A blockchain employment can be used to guarantee the properties of decentralization and non-tampering, which provide users a more stable and reliable trading process and prevent malicious behaviors, including double-spending and sybil attack. Nevertheless, the overhead of each transaction process is too heavy to realize immediate transaction. In this study, we aim to speed up the performance of transaction through an asynchronous dual blockchain. Moreover, we have exploited the reputation mechanism to reduce resource consumption. The new method has inherited the security from a blockchain technique. Specifically, the experimental results have demonstrated that the asynchronous dual block-chain is fairly safe and efficient.
{"title":"Efficient peer-to-peer E-payment based on asynchronous dual blockchain","authors":"Wei-Chih Hong, Y. Chen, Ren-Kai Yang, Bo Li, Jung-San Lee","doi":"10.3966/160792642020092105013","DOIUrl":"https://doi.org/10.3966/160792642020092105013","url":null,"abstract":"The number of people surfing over the e-commerce has reached to 1.6 billion, while the transaction scale has approached to 2,304 billion dollars at the end of 2017. No doubt that the security and efficiency of an e-payment system have attracted lots of attention in the field of e-commerce. That is the reason why the blockchain technique has been widely spread to most of the e-commerce mechanisms. A blockchain employment can be used to guarantee the properties of decentralization and non-tampering, which provide users a more stable and reliable trading process and prevent malicious behaviors, including double-spending and sybil attack. Nevertheless, the overhead of each transaction process is too heavy to realize immediate transaction. In this study, we aim to speed up the performance of transaction through an asynchronous dual blockchain. Moreover, we have exploited the reputation mechanism to reduce resource consumption. The new method has inherited the security from a blockchain technique. Specifically, the experimental results have demonstrated that the asynchronous dual block-chain is fairly safe and efficient.","PeriodicalId":50172,"journal":{"name":"Journal of Internet Technology","volume":"21 1","pages":"1375-1385"},"PeriodicalIF":1.6,"publicationDate":"2020-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48283478","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2020-09-01DOI: 10.3966/160792642020092105007
Meng Feng, Chin-Feng Lai, Hong Liu, Qian Rongxin, Jian Shen
Message broadcasting is a fundamental data transmission service in wireless sensor networks (WSNs), which enables a great many users to join the network dynamically and spread messages. However, due to the open network environment, attackers can easily eavesdrop on traffic, inject false data messages, or modify legitimate content. So, many broadcast authentication schemes have been proposed to ensure the integrity and authenticity of messages transmitted in WSN, but these schemes suffer from higher computational overhead due to hash-to-point operation or certification management. To reduce the computational and communication costs, we first propose a novel Identity (ID)-based signature scheme with message recovery, and then construct an identity-based signature broadcast authentication scheme (ISBAS). In our scheme, the original messages do not require to be transmitted with its generated signature. Authentication process can recover the original message. Moreover, a larger number of messages can be verified simultaneously with batch verification. The security analysis indicates our scheme achieve known security requirements and the performance analysis proves it to be efficient.
{"title":"A Novel Identity-based Broadcast Authentication Scheme with Batch Verification for Wireless Sensor Networks","authors":"Meng Feng, Chin-Feng Lai, Hong Liu, Qian Rongxin, Jian Shen","doi":"10.3966/160792642020092105007","DOIUrl":"https://doi.org/10.3966/160792642020092105007","url":null,"abstract":"Message broadcasting is a fundamental data transmission service in wireless sensor networks (WSNs), which enables a great many users to join the network dynamically and spread messages. However, due to the open network environment, attackers can easily eavesdrop on traffic, inject false data messages, or modify legitimate content. So, many broadcast authentication schemes have been proposed to ensure the integrity and authenticity of messages transmitted in WSN, but these schemes suffer from higher computational overhead due to hash-to-point operation or certification management. To reduce the computational and communication costs, we first propose a novel Identity (ID)-based signature scheme with message recovery, and then construct an identity-based signature broadcast authentication scheme (ISBAS). In our scheme, the original messages do not require to be transmitted with its generated signature. Authentication process can recover the original message. Moreover, a larger number of messages can be verified simultaneously with batch verification. The security analysis indicates our scheme achieve known security requirements and the performance analysis proves it to be efficient.","PeriodicalId":50172,"journal":{"name":"Journal of Internet Technology","volume":"21 1","pages":"1303-1311"},"PeriodicalIF":1.6,"publicationDate":"2020-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49152610","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2020-09-01DOI: 10.3966/160792642020092105005
W. Gunarathne, T. Shih, Chalothon Chootong, Worapot Sommool, A. Ochirbat
The value of OERs mainly depends on how easy they can be searched or located through a web search engine. Currently, the MERLOT II metadata repository requests resource providers to choose the relevant discipline category manually while adding material to its repository. This practice appears very time-consuming and also bound to involve human errors. If a member picks an incorrect discipline category, then the learning resource may not be correctly categorized in the repository. This situation may result in a learning resource to be not shortlisted for a given keyword search of the “MERLOT Smart Search” or in the “Advanced search.” Above investigations motivated us to recognize the importance of developing an automated learning content classification solution for OER repositories. In this study, we proposed a novel automated learning content classification model (LCCM) to classify learning resources into relevant discipline categories while adding them to the MERLOT repository. The research goal incorporated in this paper include dataset preparation, data preprocessing, feature extraction using LDA topic model, and calculating the semantic similarity using a pre-trained word embedding matrix. These methods serve as a base for classifying learning resources more effectively within a short time.
{"title":"An automated learning content classification model for open education repositories: Case of MERLOT II","authors":"W. Gunarathne, T. Shih, Chalothon Chootong, Worapot Sommool, A. Ochirbat","doi":"10.3966/160792642020092105005","DOIUrl":"https://doi.org/10.3966/160792642020092105005","url":null,"abstract":"The value of OERs mainly depends on how easy they can be searched or located through a web search engine. Currently, the MERLOT II metadata repository requests resource providers to choose the relevant discipline category manually while adding material to its repository. This practice appears very time-consuming and also bound to involve human errors. If a member picks an incorrect discipline category, then the learning resource may not be correctly categorized in the repository. This situation may result in a learning resource to be not shortlisted for a given keyword search of the “MERLOT Smart Search” or in the “Advanced search.” Above investigations motivated us to recognize the importance of developing an automated learning content classification solution for OER repositories. In this study, we proposed a novel automated learning content classification model (LCCM) to classify learning resources into relevant discipline categories while adding them to the MERLOT repository. The research goal incorporated in this paper include dataset preparation, data preprocessing, feature extraction using LDA topic model, and calculating the semantic similarity using a pre-trained word embedding matrix. These methods serve as a base for classifying learning resources more effectively within a short time.","PeriodicalId":50172,"journal":{"name":"Journal of Internet Technology","volume":"21 1","pages":"1277-1288"},"PeriodicalIF":1.6,"publicationDate":"2020-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46254111","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2020-09-01DOI: 10.3966/160792642020092105017
Baofeng Wang, Liming Chen, Zumin Wang, Mengmeng Xu, Shuai Tao
The fingerprint-based localization technique is one of the most popular indoor localization technologies. There are quite a few localization algorithms that use the RSS distance of position pairs to characterize their physical distance. In this paper, we introduce two coefficients to measure the relationship between RSS distance and physical distance. Based on the definition of tree-ring distance, we found that the characterization capability of RSS distance to physical distance is closely related to APs’ tree-ring distance. To exploit this, through an in-depth analysis of the relationship between tree-ring distance and physical distance, we pointed out that the APs sets composed of APs at the edge positions of the positioning area makes the RSS distance better to characterize the physical distance. Further, we proposed a novel RSS distance calculation algorithm based on the comparison of tree-ring distances. In the algorithm, for each pairwise position, the abnormal APs are eliminated by the Mean+3S method, and the APs with larger tree-ring distance are selected to participate in the calculation of RSS distance, namely, for different pairwise positions, different APs subsets of all APs are selected to participate in RSS distance calculation. We evaluate the algorithm in a simulation study and initial results show that an APs set with 3 APs is sufficient to guarantee very strong correlation (the correlation coefficient>0.8) and very high consistency (the consistency coefficient>0.8) between RSS distance and physical distance, which demonstrates the effectiveness and the practicability of the algorithm.
{"title":"A New RSS Distance Calculation Algorithm Based on Tree-ring Distance in APs Rich Indoor Localization Environments","authors":"Baofeng Wang, Liming Chen, Zumin Wang, Mengmeng Xu, Shuai Tao","doi":"10.3966/160792642020092105017","DOIUrl":"https://doi.org/10.3966/160792642020092105017","url":null,"abstract":"The fingerprint-based localization technique is one of the most popular indoor localization technologies. There are quite a few localization algorithms that use the RSS distance of position pairs to characterize their physical distance. In this paper, we introduce two coefficients to measure the relationship between RSS distance and physical distance. Based on the definition of tree-ring distance, we found that the characterization capability of RSS distance to physical distance is closely related to APs’ tree-ring distance. To exploit this, through an in-depth analysis of the relationship between tree-ring distance and physical distance, we pointed out that the APs sets composed of APs at the edge positions of the positioning area makes the RSS distance better to characterize the physical distance. Further, we proposed a novel RSS distance calculation algorithm based on the comparison of tree-ring distances. In the algorithm, for each pairwise position, the abnormal APs are eliminated by the Mean+3S method, and the APs with larger tree-ring distance are selected to participate in the calculation of RSS distance, namely, for different pairwise positions, different APs subsets of all APs are selected to participate in RSS distance calculation. We evaluate the algorithm in a simulation study and initial results show that an APs set with 3 APs is sufficient to guarantee very strong correlation (the correlation coefficient>0.8) and very high consistency (the consistency coefficient>0.8) between RSS distance and physical distance, which demonstrates the effectiveness and the practicability of the algorithm.","PeriodicalId":50172,"journal":{"name":"Journal of Internet Technology","volume":"26 65","pages":"1423-1436"},"PeriodicalIF":1.6,"publicationDate":"2020-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"41260726","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2020-09-01DOI: 10.3966/160792642020092105012
Byungseok Kang, Joohyun Lee, O. Bagdasar, Hyunseung Choo
Contents services have been provided to people in a variety of ways. Jukebox service is one of the contents streaming which provides an automated music-playing service. User inserts coin and presses a play button, the jukebox automatically selects and plays the record. The Disk Jockey (DJ) in Korean cafeteria (cafe) received contents desired of customer and played them through the speakers in the store. In this paper, we propose a service platform that reinvented the Korean cafe DJ in an integrated environment of IoT and cloud computing. The user in a store can request contents (music, video, and message) through the service platform. The contents are provided through the public screen and speaker in the store where the user is located. This allows people in the same location store to enjoy the contents together. The user information and the usage history are collected and managed in the cloud. Therefore, users can receive customized services regardless of stores. We compare our platform to exist services. As a result of the performance evaluation, the proposed platform shows that contents can be efficiently provided to users and adapts IoT-Cloud integrated environments.
{"title":"CloudIoT-based Jukebox Platform: A Music Player for Mobile Users in Café","authors":"Byungseok Kang, Joohyun Lee, O. Bagdasar, Hyunseung Choo","doi":"10.3966/160792642020092105012","DOIUrl":"https://doi.org/10.3966/160792642020092105012","url":null,"abstract":"Contents services have been provided to people in a variety of ways. Jukebox service is one of the contents streaming which provides an automated music-playing service. User inserts coin and presses a play button, the jukebox automatically selects and plays the record. The Disk Jockey (DJ) in Korean cafeteria (cafe) received contents desired of customer and played them through the speakers in the store. In this paper, we propose a service platform that reinvented the Korean cafe DJ in an integrated environment of IoT and cloud computing. The user in a store can request contents (music, video, and message) through the service platform. The contents are provided through the public screen and speaker in the store where the user is located. This allows people in the same location store to enjoy the contents together. The user information and the usage history are collected and managed in the cloud. Therefore, users can receive customized services regardless of stores. We compare our platform to exist services. As a result of the performance evaluation, the proposed platform shows that contents can be efficiently provided to users and adapts IoT-Cloud integrated environments.","PeriodicalId":50172,"journal":{"name":"Journal of Internet Technology","volume":"21 1","pages":"1363-1374"},"PeriodicalIF":1.6,"publicationDate":"2020-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48575800","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2020-07-01DOI: 10.3966/160792642020072104018
Tao-Hua Wang, H. Lin, Ting-Ting Wu, Yueh-Min Huang
Cultivating the capacity to create and reflect has been a prominent feature of professional training in numerous disciplines. Through teaching strategies, creativity and reflection abilities can be enhanced. In this article, we report the findings of a new multimethod approach (including narrative essay writing, high-level prompts, and online collaborative learning strategies) that provides a learning environment to influence students’ creativity and reflection. Graduate students in an online course of a national university in southern Taiwan served as participants. Through the multimethod approach, we analyzed and discussed students’ reflection, creativity, and academic emotions after learning. The results revealed that students’ reflective and creative abilities were enhanced, and the students held positive emotions toward the multimethod approach. This approach may aid teachers in the design of learning activities and guide online collaborative learning activities.
{"title":"A multimethod approach for supporting reflection and creativity in online collaborative courses","authors":"Tao-Hua Wang, H. Lin, Ting-Ting Wu, Yueh-Min Huang","doi":"10.3966/160792642020072104018","DOIUrl":"https://doi.org/10.3966/160792642020072104018","url":null,"abstract":"Cultivating the capacity to create and reflect has been a prominent feature of professional training in numerous disciplines. Through teaching strategies, creativity and reflection abilities can be enhanced. In this article, we report the findings of a new multimethod approach (including narrative essay writing, high-level prompts, and online collaborative learning strategies) that provides a learning environment to influence students’ creativity and reflection. Graduate students in an online course of a national university in southern Taiwan served as participants. Through the multimethod approach, we analyzed and discussed students’ reflection, creativity, and academic emotions after learning. The results revealed that students’ reflective and creative abilities were enhanced, and the students held positive emotions toward the multimethod approach. This approach may aid teachers in the design of learning activities and guide online collaborative learning activities.","PeriodicalId":50172,"journal":{"name":"Journal of Internet Technology","volume":"21 1","pages":"1097-1106"},"PeriodicalIF":1.6,"publicationDate":"2020-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48081773","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2020-07-01DOI: 10.3966/160792642020072104020
Jung-Shian Li, I. Liu, Chao-Yuan Lee, Chu-Fen Li, Chuan-Gang Liu
As the demand for data sharing and complex access-control policies continues to grow, traditional encryption mechanisms, which are generally established using a Public Key Infrastructure, face the problem of massive processing overheads and huge network bandwidth consumption. Attribute-Based Encryption (ABE) schemes have been proposed as a potential means of addressing these issues and have attracted great attention in recent years. Most previous studies on ABE focus on issues such as the revocation mechanism, multi-authority, the access structure design, and traceability. However, very few studies consider the storage efficiency problem and the present study proposes a novel data deduplication scheme based on ciphertext-policy ABE with convergent encryption and block-level data. The scheme can be deployed in third-party semi-trusted environments, and not only provides flexible, fine-grained access control over encrypted data, but also allows for the in-line elimination of redundancies in order to save cloud storage space. The experimental results show that the proposed scheme has an acceptable computational overhead and provides a promising solution for real-world data cloud storage and access scenarios.
{"title":"A novel data deduplication scheme for encrypted cloud databases","authors":"Jung-Shian Li, I. Liu, Chao-Yuan Lee, Chu-Fen Li, Chuan-Gang Liu","doi":"10.3966/160792642020072104020","DOIUrl":"https://doi.org/10.3966/160792642020072104020","url":null,"abstract":"As the demand for data sharing and complex access-control policies continues to grow, traditional encryption mechanisms, which are generally established using a Public Key Infrastructure, face the problem of massive processing overheads and huge network bandwidth consumption. Attribute-Based Encryption (ABE) schemes have been proposed as a potential means of addressing these issues and have attracted great attention in recent years. Most previous studies on ABE focus on issues such as the revocation mechanism, multi-authority, the access structure design, and traceability. However, very few studies consider the storage efficiency problem and the present study proposes a novel data deduplication scheme based on ciphertext-policy ABE with convergent encryption and block-level data. The scheme can be deployed in third-party semi-trusted environments, and not only provides flexible, fine-grained access control over encrypted data, but also allows for the in-line elimination of redundancies in order to save cloud storage space. The experimental results show that the proposed scheme has an acceptable computational overhead and provides a promising solution for real-world data cloud storage and access scenarios.","PeriodicalId":50172,"journal":{"name":"Journal of Internet Technology","volume":"21 1","pages":"1115-1125"},"PeriodicalIF":1.6,"publicationDate":"2020-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"41925885","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：