논문 상세보기

한국인터넷정보학회> KSII Transactions on Internet and Information Systems (TIIS)> Polymorphic Path Transferring for Secure Flow Delivery

KCI등재SCISCOUPUS

Polymorphic Path Transferring for Secure Flow Delivery

Rongbo Zhang , Xin Li , Yan Zhan
  • : 한국인터넷정보학회
  • : KSII Transactions on Internet and Information Systems (TIIS) 15권8호
  • : 연속간행물
  • : 2021년 08월
  • : 2805-2826(22pages)
KSII Transactions on Internet and Information Systems (TIIS)

DOI


목차

1. Introduction
2. Related Work
3. Problem Definition
4. Model Description and Solution
5. Critical Implementer Points
6. Performance evaluation
7. Conclusion
References

키워드 보기


초록 보기

In most cases, the routing policy of networks shows a preference for a static one-to-one mapping of communication pairs to routing paths, which offers adversaries a great advantage to conduct thorough reconnaissance and organize an effective attack in a stress-free manner. With the evolution of network intelligence, some flexible and adaptive routing policies have already proposed to intensify the network defender to turn the situation. Routing mutation is an effective strategy that can invalidate the unvarying nature of routing information that attackers have collected from exploiting the static configuration of the network. However, three constraints execute press on routing mutation deployment in practical: insufficient route mutation space, expensive control costs, and incompatibility. To enhance the availability of route mutation, we propose an OpenFlow-based route mutation technique called Polymorphic Path Transferring (PPT), which adopts a physical and virtual path segment mixed construction technique to enlarge the routing path space for elevating the security of communication. Based on the Markov Decision Process, with considering flows distribution in the network, the PPT adopts an evolution routing path scheduling algorithm with a segment path update strategy, which relieves the press on the overhead of control and incompatibility. Our analysis demonstrates that PPT can secure data delivery in the worst network environment while countering sophisticated attacks in an evasion-free manner (e.g., advanced persistent threat). Case study and experiment results show its effectiveness in proactively defending against targeted attacks and its advantage compared with previous route mutation methods.

UCI(KEPA)

간행물정보

  • : 공학분야  > 기타(공학)
  • : KCI등재
  • : SCI,SCOPUS
  • : 월간
  • : 1976-7277
  • : 2288-1468
  • : 학술지
  • : 연속간행물
  • : 2007-2021
  • : 2951


저작권 안내

한국학술정보㈜의 모든 학술 자료는 각 학회 및 기관과 저작권 계약을 통해 제공하고 있습니다.

이에 본 자료를 상업적 이용, 무단 배포 등 불법적으로 이용할 시에는 저작권법 및 관계법령에 따른 책임을 질 수 있습니다.

15권8호(2021년 08월) 수록논문
최근 권호 논문
| | | |

KCI등재 SCI SCOPUS

1Impact Force Reconstruction of Composite materials based on Improved Regularization Technology

저자 : Yajie Sun , Tao Yin , Jian Yang , Zhiyu Cai , Shaoen Wu

발행기관 : 한국인터넷정보학회 간행물 : KSII Transactions on Internet and Information Systems (TIIS) 15권 8호 발행 연도 : 2021 페이지 : pp. 2718-2731 (14 pages)

다운로드

(기관인증 필요)

초록보기

In the structural health monitoring of composite materials, in order to solve the ill-posed problem of impact force reconstruction, regularization techniques are often used to deal with it. Due to the poor convergence of the traditional Tikhonov regularization method, in order to accurately reconstruct the time history of the impact force, this paper improves Tikhonov regularization method and constructs homotopy function with strong convergence. Since the optimal regularization parameters need to be found in the homotopy function, the Newton downhill method is used to find the optimal parameters and the homotopy function can be calculated, which can accurately reconstruct the time history of the impact force. In order to verify the universality of the method in this paper, impact hammers of different materials were used in the experiment in this paper to study and compare the reconstruction effect of impact time history of different impact hammers.

KCI등재 SCI SCOPUS

2Integrated Media Platform-based Virtual Office Hours Implementation for Online Teaching in Post-COVID-19 Pandemic Era

저자 : Mingzi Chen , Xin Wei , Liang Zhou

발행기관 : 한국인터넷정보학회 간행물 : KSII Transactions on Internet and Information Systems (TIIS) 15권 8호 발행 연도 : 2021 페이지 : pp. 2732-2748 (17 pages)

다운로드

(기관인증 필요)

초록보기

In post-COVID-19 pandemic era, students' learning effects and experience may sharply decrease when teaching is transferred from offline to online. Several tools suitable for online teaching have been developed to guarantee and promote students' learning effects. However, they cannot fully consider teacher-student interaction in online teaching. To figure out this issue, this paper proposes integrated media platform-based virtual office hours implementation for online teaching. Specifically, an integrated media platform (IMP) is first constructed. Then, virtual office hours (VOH) is implemented based on the IMP, aiming at increasing student-teacher interactions. For evaluating the effectiveness of this scheme, 140 undergraduate students using IMP are divided into one control group and three experimental groups that respectively contain text, voice and video modes. The experiment results indicate that applying VOH in the IMP can improve students' online presence and test scores. Furthermore, students' participating modes during VOH implementation can largely affect their degree of presence, which can be well classified by using principal component analysis. The implication of this work is that IMP-based VOH is an effective and sustainable tool to be continuously implemented even when the COVID-19 pandemic period ends.

KCI등재 SCI SCOPUS

3Reflectance estimation for infrared and visible image fusion

저자 : Yan Gu , Feng Yang , Weijun Zhao , Yiliang Guo , Chaobo Min

발행기관 : 한국인터넷정보학회 간행물 : KSII Transactions on Internet and Information Systems (TIIS) 15권 8호 발행 연도 : 2021 페이지 : pp. 2749-2763 (15 pages)

다운로드

(기관인증 필요)

초록보기

The desirable result of infrared (IR) and visible (VIS) image fusion should have textural details from VIS images and salient targets from IR images. However, detail information in the dark regions of VIS image has low contrast and blurry edges, resulting in performance degradation in image fusion. To resolve the troubles of fuzzy details in dark regions of VIS image fusion, we have proposed a method of reflectance estimation for IR and VIS image fusion. In order to maintain and enhance details in these dark regions, dark region approximation (DRA) is pro-posed to optimize the Retinex model.With the improved Retinex model based on DRA, quasi-Newton method is adopted to estimate the reflectance of a VIS image. The final fusion out-come is obtained by fusing the DRA-based reflectance of VIS image with IR image. Our method could simultaneously retain the low visibility details in VIS images and the high con-trast targets in IR images. Experiment statistic shows that compared to some advanced ap-proaches, the proposed method has superiority on detail preservation and visual quality.

KCI등재 SCI SCOPUS

4A City-Level Boundary Nodes Identification Algorithm Based on Bidirectional Approaching

저자 : Zhiyuan Tao , Fenlin Liu , Yan Liu , Xiangyang Luo

발행기관 : 한국인터넷정보학회 간행물 : KSII Transactions on Internet and Information Systems (TIIS) 15권 8호 발행 연도 : 2021 페이지 : pp. 2764-2782 (19 pages)

다운로드

(기관인증 필요)

초록보기

Existing city-level boundary nodes identification methods need to locate all IP addresses on the path to differentiate which IP is the boundary node. However, these methods are susceptible to time-delay, the accuracy of location information and other factors, and the resource consumption of locating all IPes is tremendous. To improve the recognition rate and reduce the locating cost, this paper proposes an algorithm for city-level boundary node identification based on bidirectional approaching. Different from the existing methods based on time-delay information and location results, the proposed algorithm uses topological analysis to construct a set of candidate boundary nodes and then identifies the boundary nodes. The proposed algorithm can identify the boundary of the target city network without high-precision location information and dramatically reduces resource consumption compared with the traditional algorithm. Meanwhile, it can label some errors in the existing IP address database. Based on 45,182,326 measurement results from Zhengzhou, Chengdu and Hangzhou in China and New York, Los Angeles and Dallas in the United States, the experimental results show that: The algorithm can accurately identify the city boundary nodes using only 20.33% location resources, and more than 80.29% of the boundary nodes can be mined with a precision of more than 70.73%.

KCI등재 SCI SCOPUS

5A Dynamic Adjustment Method of Service Function Chain Resource Configuration

저자 : Xiaoyang Han , Xiangru Meng , Zhenhua Yu , Dong Zhai

발행기관 : 한국인터넷정보학회 간행물 : KSII Transactions on Internet and Information Systems (TIIS) 15권 8호 발행 연도 : 2021 페이지 : pp. 2783-2804 (22 pages)

다운로드

(기관인증 필요)

초록보기

In the network function virtualization environment, dynamic changes in network traffic will lead to the dynamic changes of service function chain resource demand, which entails timely dynamic adjustment of service function chain resource configuration. At present, most researches solve this problem through virtual network function migration and link rerouting, and there exist some problems such as long service interruption time, excessive network operation cost and high penalty. This paper proposes a dynamic adjustment method of service function chain resource configuration for the dynamic changes of network traffic. First, a dynamic adjustment request of service function chain is generated according to the prediction of network traffic. Second, a dynamic adjustment strategy of service function chain resource configuration is determined according to substrate network resources. Finally, the resource configuration of a service function chain is pre-adjusted according to the dynamic adjustment strategy. Virtual network functions combination and virtual machine reusing are fully considered in this process. The experimental results show that this method can reduce the influence of service function chain resource configuration dynamic adjustment on quality of service, reduce network operation cost and improve the revenue of service providers.

KCI등재 SCI SCOPUS

6Polymorphic Path Transferring for Secure Flow Delivery

저자 : Rongbo Zhang , Xin Li , Yan Zhan

발행기관 : 한국인터넷정보학회 간행물 : KSII Transactions on Internet and Information Systems (TIIS) 15권 8호 발행 연도 : 2021 페이지 : pp. 2805-2826 (22 pages)

다운로드

(기관인증 필요)

초록보기

In most cases, the routing policy of networks shows a preference for a static one-to-one mapping of communication pairs to routing paths, which offers adversaries a great advantage to conduct thorough reconnaissance and organize an effective attack in a stress-free manner. With the evolution of network intelligence, some flexible and adaptive routing policies have already proposed to intensify the network defender to turn the situation. Routing mutation is an effective strategy that can invalidate the unvarying nature of routing information that attackers have collected from exploiting the static configuration of the network. However, three constraints execute press on routing mutation deployment in practical: insufficient route mutation space, expensive control costs, and incompatibility. To enhance the availability of route mutation, we propose an OpenFlow-based route mutation technique called Polymorphic Path Transferring (PPT), which adopts a physical and virtual path segment mixed construction technique to enlarge the routing path space for elevating the security of communication. Based on the Markov Decision Process, with considering flows distribution in the network, the PPT adopts an evolution routing path scheduling algorithm with a segment path update strategy, which relieves the press on the overhead of control and incompatibility. Our analysis demonstrates that PPT can secure data delivery in the worst network environment while countering sophisticated attacks in an evasion-free manner (e.g., advanced persistent threat). Case study and experiment results show its effectiveness in proactively defending against targeted attacks and its advantage compared with previous route mutation methods.

KCI등재 SCI SCOPUS

7A Lightweight and Privacy-Preserving Answer Collection Scheme for Mobile Crowdsourcing

저자 : Yingling Dai , Jian Weng , Anjia Yang , Shui Yu , Robert H. Deng

발행기관 : 한국인터넷정보학회 간행물 : KSII Transactions on Internet and Information Systems (TIIS) 15권 8호 발행 연도 : 2021 페이지 : pp. 2827-2848 (22 pages)

다운로드

(기관인증 필요)

초록보기

Mobile Crowdsourcing (MCS) has become an emerging paradigm evolved from crowdsourcing by employing advanced features of mobile devices such as smartphones to perform more complicated, especially spatial tasks. One of the key procedures in MCS is to collect answers from mobile users (workers), which may face several security issues. First, authentication is required to ensure that answers are from authorized workers. In addition, MCS tasks are usually location-dependent, so the collected answers could disclose workers' location privacy, which may discourage workers to participate in the tasks. Finally, the overhead occurred by authentication and privacy protection should be minimized since mobile devices are resource-constrained. Considering all the above concerns, in this paper, we propose a lightweight and privacy-preserving answer collection scheme for MCS. In the proposed scheme, we achieve anonymous authentication based on traceable ring signature, which provides authentication, anonymity, as well as traceability by enabling malicious workers tracing. In order to balance user location privacy and data availability, we propose a new concept named current location privacy, which means the location of the worker cannot be disclosed to anyone until a specified time. Since the leakage of current location will seriously threaten workers' personal safety, causing such as absence or presence disclosure attacks, it is necessary to pay attention to the current location privacy of workers in MCS. We encrypt the collected answers based on timed-release encryption, ensuring the secure transmission and high availability of data, as well as preserving the current location privacy of workers. Finally, we analyze the security and performance of the proposed scheme. The experimental results show that the computation costs of a worker depend on the number of ring signature members, which indicates the flexibility for a worker to choose an appropriate size of the group under considerations of privacy and efficiency.

KCI등재 SCI SCOPUS

8UEPF:A blockchain based Uniform Encoding and Parsing Framework in multi-cloud environments

저자 : Dehao Tao , Zhen Yang , Xuanmei Qin , Qi Li , Yongfeng Huang , Yubo Luo

발행기관 : 한국인터넷정보학회 간행물 : KSII Transactions on Internet and Information Systems (TIIS) 15권 8호 발행 연도 : 2021 페이지 : pp. 2849-2864 (16 pages)

다운로드

(기관인증 필요)

초록보기

The emerging of cloud data sharing can create great values, especially in multi-cloud environments. However, “data island” between different cloud service providers (CSPs) has drawn trust problem in data sharing, causing contradictions with the increasing sharing need of cloud data users. And how to ensure the data value for both data owner and data user before sharing, is another challenge limiting massive data sharing in the multi-cloud environments. To solve the problems above, we propose a Uniform Encoding and Parsing Framework (UEPF) with blockchain to support trustworthy and valuable data sharing. We design namespace-based unique identifier pair to support data description corresponding with data in multi-cloud, and build a blockchain-based data encoding protocol to manage the metadata with identifier pair in the blockchain ledger. To share data in multi-cloud, we build a data parsing protocol with smart contract to query and get the sharing cloud data efficiently. We also build identifier updating protocol to satisfy the dynamicity of data, and data check protocol to ensure the validity of data. Theoretical analysis and experiment results show that UEPF is pretty efficient.

KCI등재 SCI SCOPUS

9Recoverable Private Key Scheme for Consortium Blockchain Based on Verifiable Secret Sharing

저자 : Guojia Li , Lin You , Gengran Hu , Liqin Hu

발행기관 : 한국인터넷정보학회 간행물 : KSII Transactions on Internet and Information Systems (TIIS) 15권 8호 발행 연도 : 2021 페이지 : pp. 2865-2878 (14 pages)

다운로드

(기관인증 필요)

초록보기

As a current popular technology, the blockchain has a serious issue: the private key cannot be retrieved due to force majeure. Since the outcome of the blockchain-based Bitcoin, there have been many occurrences of the users who lost or forgot their private keys and could not retrieve their token wallets, and it may cause the permanent loss of their corresponding blockchain accounts, resulting in irreparable losses for the users. We propose a recoverable private key scheme for consortium blockchain based on the verifiable secret sharing which can enable the user's private key in the consortium blockchain to be securely recovered through a verifiable secret sharing method. In our secret sharing scheme, users use the biometric keys to encrypt shares, and the preset committer peers in the consortium blockchain act as the participants to store the users' private key shares. Due to the particularity of the biometric key, only the user can complete the correct secret recovery. Our comparisons with the existing mnemonic systems or the multi-signature schemes have shown that our scheme can allow users to recover their private keys without storing the passwords accurately. Hence, our scheme can improve the account security and recoverability of the data-sharing systems across physical and virtual platforms that use blockchain technology.

KCI등재 SCI SCOPUS

10Cyclic Shift Based Tone Reservation PAPR Reduction Scheme with Embedding Side Information for FBMC-OQAM Systems

저자 : Yongpeng Shi , Yujie Xia , Ya Gao , Jianhua Cui

발행기관 : 한국인터넷정보학회 간행물 : KSII Transactions on Internet and Information Systems (TIIS) 15권 8호 발행 연도 : 2021 페이지 : pp. 2879-2899 (21 pages)

다운로드

(기관인증 필요)

초록보기

The tone reservation (TR) scheme is an attractive method to reduce peak-to-average power ratio (PAPR) in the filter bank multicarrier with offset quadrature amplitude modulation (FBMC-OQAM) systems. However, the high PAPR of FBMC signal will severely degrades system performance. To address this issue, a cyclic shift based TR (CS-TR) scheme with embedding side information (SI) is proposed to reduce the PAPR of FBMC signals. At the transmitter, four candidate signals are first generated based on cyclic shift of the output of inverse discrete Fourier transform (IDFT), and the SI of the selected signal with minimum peak power among the four candidate signals is embedded in sparse symbols with quadrature phase-shift keying constellation. Then, the TR weighted by optimal scaling factor is employed to further reduce PAPR of the selected signal. At the receiver, a reliable SI detector is presented by determining the phase rotation of SI embedding symbols, and the transmitted data blocks can be correctly demodulated according to the detected SI. Simulation results show that the proposed scheme significantly outperforms the existing TR schemes in both PAPR reduction and bit error rate (BER) performances. In addition, the proposed scheme with detected SI can achieve the same BER performance compared to the one with perfect SI.

123
권호별 보기
같은 권호 다른 논문
| | | | 다운로드

KCI등재SCISCOUPUS

1Impact Force Reconstruction of Composite materials based on Improved Regularization Technology

저자 : Yajie Sun , Tao Yin , Jian Yang , Zhiyu Cai , Shaoen Wu

발행기관 : 한국인터넷정보학회 간행물 : KSII Transactions on Internet and Information Systems (TIIS) 15권 8호 발행 연도 : 2021 페이지 : pp. 2718-2731 (14 pages)

다운로드

(기관인증 필요)

초록보기

In the structural health monitoring of composite materials, in order to solve the ill-posed problem of impact force reconstruction, regularization techniques are often used to deal with it. Due to the poor convergence of the traditional Tikhonov regularization method, in order to accurately reconstruct the time history of the impact force, this paper improves Tikhonov regularization method and constructs homotopy function with strong convergence. Since the optimal regularization parameters need to be found in the homotopy function, the Newton downhill method is used to find the optimal parameters and the homotopy function can be calculated, which can accurately reconstruct the time history of the impact force. In order to verify the universality of the method in this paper, impact hammers of different materials were used in the experiment in this paper to study and compare the reconstruction effect of impact time history of different impact hammers.

KCI등재SCISCOUPUS

2Integrated Media Platform-based Virtual Office Hours Implementation for Online Teaching in Post-COVID-19 Pandemic Era

저자 : Mingzi Chen , Xin Wei , Liang Zhou

발행기관 : 한국인터넷정보학회 간행물 : KSII Transactions on Internet and Information Systems (TIIS) 15권 8호 발행 연도 : 2021 페이지 : pp. 2732-2748 (17 pages)

다운로드

(기관인증 필요)

초록보기

In post-COVID-19 pandemic era, students' learning effects and experience may sharply decrease when teaching is transferred from offline to online. Several tools suitable for online teaching have been developed to guarantee and promote students' learning effects. However, they cannot fully consider teacher-student interaction in online teaching. To figure out this issue, this paper proposes integrated media platform-based virtual office hours implementation for online teaching. Specifically, an integrated media platform (IMP) is first constructed. Then, virtual office hours (VOH) is implemented based on the IMP, aiming at increasing student-teacher interactions. For evaluating the effectiveness of this scheme, 140 undergraduate students using IMP are divided into one control group and three experimental groups that respectively contain text, voice and video modes. The experiment results indicate that applying VOH in the IMP can improve students' online presence and test scores. Furthermore, students' participating modes during VOH implementation can largely affect their degree of presence, which can be well classified by using principal component analysis. The implication of this work is that IMP-based VOH is an effective and sustainable tool to be continuously implemented even when the COVID-19 pandemic period ends.

KCI등재SCISCOUPUS

3Reflectance estimation for infrared and visible image fusion

저자 : Yan Gu , Feng Yang , Weijun Zhao , Yiliang Guo , Chaobo Min

발행기관 : 한국인터넷정보학회 간행물 : KSII Transactions on Internet and Information Systems (TIIS) 15권 8호 발행 연도 : 2021 페이지 : pp. 2749-2763 (15 pages)

다운로드

(기관인증 필요)

초록보기

The desirable result of infrared (IR) and visible (VIS) image fusion should have textural details from VIS images and salient targets from IR images. However, detail information in the dark regions of VIS image has low contrast and blurry edges, resulting in performance degradation in image fusion. To resolve the troubles of fuzzy details in dark regions of VIS image fusion, we have proposed a method of reflectance estimation for IR and VIS image fusion. In order to maintain and enhance details in these dark regions, dark region approximation (DRA) is pro-posed to optimize the Retinex model.With the improved Retinex model based on DRA, quasi-Newton method is adopted to estimate the reflectance of a VIS image. The final fusion out-come is obtained by fusing the DRA-based reflectance of VIS image with IR image. Our method could simultaneously retain the low visibility details in VIS images and the high con-trast targets in IR images. Experiment statistic shows that compared to some advanced ap-proaches, the proposed method has superiority on detail preservation and visual quality.

KCI등재SCISCOUPUS

4A City-Level Boundary Nodes Identification Algorithm Based on Bidirectional Approaching

저자 : Zhiyuan Tao , Fenlin Liu , Yan Liu , Xiangyang Luo

발행기관 : 한국인터넷정보학회 간행물 : KSII Transactions on Internet and Information Systems (TIIS) 15권 8호 발행 연도 : 2021 페이지 : pp. 2764-2782 (19 pages)

다운로드

(기관인증 필요)

초록보기

Existing city-level boundary nodes identification methods need to locate all IP addresses on the path to differentiate which IP is the boundary node. However, these methods are susceptible to time-delay, the accuracy of location information and other factors, and the resource consumption of locating all IPes is tremendous. To improve the recognition rate and reduce the locating cost, this paper proposes an algorithm for city-level boundary node identification based on bidirectional approaching. Different from the existing methods based on time-delay information and location results, the proposed algorithm uses topological analysis to construct a set of candidate boundary nodes and then identifies the boundary nodes. The proposed algorithm can identify the boundary of the target city network without high-precision location information and dramatically reduces resource consumption compared with the traditional algorithm. Meanwhile, it can label some errors in the existing IP address database. Based on 45,182,326 measurement results from Zhengzhou, Chengdu and Hangzhou in China and New York, Los Angeles and Dallas in the United States, the experimental results show that: The algorithm can accurately identify the city boundary nodes using only 20.33% location resources, and more than 80.29% of the boundary nodes can be mined with a precision of more than 70.73%.

KCI등재SCISCOUPUS

5A Dynamic Adjustment Method of Service Function Chain Resource Configuration

저자 : Xiaoyang Han , Xiangru Meng , Zhenhua Yu , Dong Zhai

발행기관 : 한국인터넷정보학회 간행물 : KSII Transactions on Internet and Information Systems (TIIS) 15권 8호 발행 연도 : 2021 페이지 : pp. 2783-2804 (22 pages)

다운로드

(기관인증 필요)

초록보기

In the network function virtualization environment, dynamic changes in network traffic will lead to the dynamic changes of service function chain resource demand, which entails timely dynamic adjustment of service function chain resource configuration. At present, most researches solve this problem through virtual network function migration and link rerouting, and there exist some problems such as long service interruption time, excessive network operation cost and high penalty. This paper proposes a dynamic adjustment method of service function chain resource configuration for the dynamic changes of network traffic. First, a dynamic adjustment request of service function chain is generated according to the prediction of network traffic. Second, a dynamic adjustment strategy of service function chain resource configuration is determined according to substrate network resources. Finally, the resource configuration of a service function chain is pre-adjusted according to the dynamic adjustment strategy. Virtual network functions combination and virtual machine reusing are fully considered in this process. The experimental results show that this method can reduce the influence of service function chain resource configuration dynamic adjustment on quality of service, reduce network operation cost and improve the revenue of service providers.

KCI등재SCISCOUPUS

6Polymorphic Path Transferring for Secure Flow Delivery

저자 : Rongbo Zhang , Xin Li , Yan Zhan

발행기관 : 한국인터넷정보학회 간행물 : KSII Transactions on Internet and Information Systems (TIIS) 15권 8호 발행 연도 : 2021 페이지 : pp. 2805-2826 (22 pages)

다운로드

(기관인증 필요)

초록보기

In most cases, the routing policy of networks shows a preference for a static one-to-one mapping of communication pairs to routing paths, which offers adversaries a great advantage to conduct thorough reconnaissance and organize an effective attack in a stress-free manner. With the evolution of network intelligence, some flexible and adaptive routing policies have already proposed to intensify the network defender to turn the situation. Routing mutation is an effective strategy that can invalidate the unvarying nature of routing information that attackers have collected from exploiting the static configuration of the network. However, three constraints execute press on routing mutation deployment in practical: insufficient route mutation space, expensive control costs, and incompatibility. To enhance the availability of route mutation, we propose an OpenFlow-based route mutation technique called Polymorphic Path Transferring (PPT), which adopts a physical and virtual path segment mixed construction technique to enlarge the routing path space for elevating the security of communication. Based on the Markov Decision Process, with considering flows distribution in the network, the PPT adopts an evolution routing path scheduling algorithm with a segment path update strategy, which relieves the press on the overhead of control and incompatibility. Our analysis demonstrates that PPT can secure data delivery in the worst network environment while countering sophisticated attacks in an evasion-free manner (e.g., advanced persistent threat). Case study and experiment results show its effectiveness in proactively defending against targeted attacks and its advantage compared with previous route mutation methods.

KCI등재SCISCOUPUS

7A Lightweight and Privacy-Preserving Answer Collection Scheme for Mobile Crowdsourcing

저자 : Yingling Dai , Jian Weng , Anjia Yang , Shui Yu , Robert H. Deng

발행기관 : 한국인터넷정보학회 간행물 : KSII Transactions on Internet and Information Systems (TIIS) 15권 8호 발행 연도 : 2021 페이지 : pp. 2827-2848 (22 pages)

다운로드

(기관인증 필요)

초록보기

Mobile Crowdsourcing (MCS) has become an emerging paradigm evolved from crowdsourcing by employing advanced features of mobile devices such as smartphones to perform more complicated, especially spatial tasks. One of the key procedures in MCS is to collect answers from mobile users (workers), which may face several security issues. First, authentication is required to ensure that answers are from authorized workers. In addition, MCS tasks are usually location-dependent, so the collected answers could disclose workers' location privacy, which may discourage workers to participate in the tasks. Finally, the overhead occurred by authentication and privacy protection should be minimized since mobile devices are resource-constrained. Considering all the above concerns, in this paper, we propose a lightweight and privacy-preserving answer collection scheme for MCS. In the proposed scheme, we achieve anonymous authentication based on traceable ring signature, which provides authentication, anonymity, as well as traceability by enabling malicious workers tracing. In order to balance user location privacy and data availability, we propose a new concept named current location privacy, which means the location of the worker cannot be disclosed to anyone until a specified time. Since the leakage of current location will seriously threaten workers' personal safety, causing such as absence or presence disclosure attacks, it is necessary to pay attention to the current location privacy of workers in MCS. We encrypt the collected answers based on timed-release encryption, ensuring the secure transmission and high availability of data, as well as preserving the current location privacy of workers. Finally, we analyze the security and performance of the proposed scheme. The experimental results show that the computation costs of a worker depend on the number of ring signature members, which indicates the flexibility for a worker to choose an appropriate size of the group under considerations of privacy and efficiency.

KCI등재SCISCOUPUS

8UEPF:A blockchain based Uniform Encoding and Parsing Framework in multi-cloud environments

저자 : Dehao Tao , Zhen Yang , Xuanmei Qin , Qi Li , Yongfeng Huang , Yubo Luo

발행기관 : 한국인터넷정보학회 간행물 : KSII Transactions on Internet and Information Systems (TIIS) 15권 8호 발행 연도 : 2021 페이지 : pp. 2849-2864 (16 pages)

다운로드

(기관인증 필요)

초록보기

The emerging of cloud data sharing can create great values, especially in multi-cloud environments. However, “data island” between different cloud service providers (CSPs) has drawn trust problem in data sharing, causing contradictions with the increasing sharing need of cloud data users. And how to ensure the data value for both data owner and data user before sharing, is another challenge limiting massive data sharing in the multi-cloud environments. To solve the problems above, we propose a Uniform Encoding and Parsing Framework (UEPF) with blockchain to support trustworthy and valuable data sharing. We design namespace-based unique identifier pair to support data description corresponding with data in multi-cloud, and build a blockchain-based data encoding protocol to manage the metadata with identifier pair in the blockchain ledger. To share data in multi-cloud, we build a data parsing protocol with smart contract to query and get the sharing cloud data efficiently. We also build identifier updating protocol to satisfy the dynamicity of data, and data check protocol to ensure the validity of data. Theoretical analysis and experiment results show that UEPF is pretty efficient.

KCI등재SCISCOUPUS

9Recoverable Private Key Scheme for Consortium Blockchain Based on Verifiable Secret Sharing

저자 : Guojia Li , Lin You , Gengran Hu , Liqin Hu

발행기관 : 한국인터넷정보학회 간행물 : KSII Transactions on Internet and Information Systems (TIIS) 15권 8호 발행 연도 : 2021 페이지 : pp. 2865-2878 (14 pages)

다운로드

(기관인증 필요)

초록보기

As a current popular technology, the blockchain has a serious issue: the private key cannot be retrieved due to force majeure. Since the outcome of the blockchain-based Bitcoin, there have been many occurrences of the users who lost or forgot their private keys and could not retrieve their token wallets, and it may cause the permanent loss of their corresponding blockchain accounts, resulting in irreparable losses for the users. We propose a recoverable private key scheme for consortium blockchain based on the verifiable secret sharing which can enable the user's private key in the consortium blockchain to be securely recovered through a verifiable secret sharing method. In our secret sharing scheme, users use the biometric keys to encrypt shares, and the preset committer peers in the consortium blockchain act as the participants to store the users' private key shares. Due to the particularity of the biometric key, only the user can complete the correct secret recovery. Our comparisons with the existing mnemonic systems or the multi-signature schemes have shown that our scheme can allow users to recover their private keys without storing the passwords accurately. Hence, our scheme can improve the account security and recoverability of the data-sharing systems across physical and virtual platforms that use blockchain technology.

KCI등재SCISCOUPUS

10Cyclic Shift Based Tone Reservation PAPR Reduction Scheme with Embedding Side Information for FBMC-OQAM Systems

저자 : Yongpeng Shi , Yujie Xia , Ya Gao , Jianhua Cui

발행기관 : 한국인터넷정보학회 간행물 : KSII Transactions on Internet and Information Systems (TIIS) 15권 8호 발행 연도 : 2021 페이지 : pp. 2879-2899 (21 pages)

다운로드

(기관인증 필요)

초록보기

The tone reservation (TR) scheme is an attractive method to reduce peak-to-average power ratio (PAPR) in the filter bank multicarrier with offset quadrature amplitude modulation (FBMC-OQAM) systems. However, the high PAPR of FBMC signal will severely degrades system performance. To address this issue, a cyclic shift based TR (CS-TR) scheme with embedding side information (SI) is proposed to reduce the PAPR of FBMC signals. At the transmitter, four candidate signals are first generated based on cyclic shift of the output of inverse discrete Fourier transform (IDFT), and the SI of the selected signal with minimum peak power among the four candidate signals is embedded in sparse symbols with quadrature phase-shift keying constellation. Then, the TR weighted by optimal scaling factor is employed to further reduce PAPR of the selected signal. At the receiver, a reliable SI detector is presented by determining the phase rotation of SI embedding symbols, and the transmitted data blocks can be correctly demodulated according to the detected SI. Simulation results show that the proposed scheme significantly outperforms the existing TR schemes in both PAPR reduction and bit error rate (BER) performances. In addition, the proposed scheme with detected SI can achieve the same BER performance compared to the one with perfect SI.

123
발행기관 최신논문
자료제공: 네이버학술정보
발행기관 최신논문
자료제공: 네이버학술정보

내가 찾은 최근 검색어

최근 열람 자료

맞춤 논문

보관함

내 보관함
공유한 보관함

1:1문의

닫기