Pub Date : 2021-10-01DOI: 10.1109/NaNA53684.2021.00042
Jiaqing Bai, Ji He, Xiaohong Jiang, Lijun Chen
Covert communication aims to hide the very existence of wireless transmissions which provides a strong security guarantee for wireless networks. This article considers a dual-hop covert communication system with outdated channel state information (CSI). The source transmits the message to the destination via a relay, while the relay wants to transmit its message to the destination and hide the communication process. Under this consideration, we conduct the covert performance analysis of the concerned system under the rate-control scheme. Specially, we derive the closed-forms of the minimum detection error probability (DEP) at the source and the effective covert rate (ECR) at the relay. Further, we study the ECR maximization problem under the DEP constraint. Finally, we provide extensive numerical results to illustrate the achievable covert performance with the outdated CSI. The results indicate that the larger the CSI feedback delay is, the more beneficial it is to the detective, but it is not conducive for the relay to conduct the covert communication.
{"title":"Performance Analysis for Dual-Hop Covert Communication System with Outdated CSI","authors":"Jiaqing Bai, Ji He, Xiaohong Jiang, Lijun Chen","doi":"10.1109/NaNA53684.2021.00042","DOIUrl":"https://doi.org/10.1109/NaNA53684.2021.00042","url":null,"abstract":"Covert communication aims to hide the very existence of wireless transmissions which provides a strong security guarantee for wireless networks. This article considers a dual-hop covert communication system with outdated channel state information (CSI). The source transmits the message to the destination via a relay, while the relay wants to transmit its message to the destination and hide the communication process. Under this consideration, we conduct the covert performance analysis of the concerned system under the rate-control scheme. Specially, we derive the closed-forms of the minimum detection error probability (DEP) at the source and the effective covert rate (ECR) at the relay. Further, we study the ECR maximization problem under the DEP constraint. Finally, we provide extensive numerical results to illustrate the achievable covert performance with the outdated CSI. The results indicate that the larger the CSI feedback delay is, the more beneficial it is to the detective, but it is not conducive for the relay to conduct the covert communication.","PeriodicalId":414672,"journal":{"name":"2021 International Conference on Networking and Network Applications (NaNA)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125662756","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
With the development of image processing technology, the forgers usually use median filtering to make their fakes appear more realistic because median filtering is a non-linear digital filtering technique which can preserve edges and smooth regions within an image. Therefore, the use of median forensics technology to identify the authenticity of images and ensure the security of image data has attracted everyone’s attention. However, how to effectively detect the median filter of high JPEG compressed small-size images is still a challenge in median filter forensics. In this paper, we proposed a framework based on deep residual learning to address this challenge. Specifically, a new convolutional neural network called MFFNet was constructed. In the first step, in order to extract the features left by the median filter, we innovatively designed a preprocessing layer containing various residuals to capture different median filter artifacts. Then, we elaborately designed a MFFNet to self-learn rich hierarchical features left in the highly JPEG compressed image for further classification. In order to prevent the over-fitting problem of the deep network, we adopted a series of enhancement schemes in the training stage to enrich the diversity of training data and obtain a more generateable and stable median filter detector. A large number of experimental results on the composite database show that the proposed framework significantly improves the detection performance compared to the latest methods for detecting highly small size image with JPEG compression.
{"title":"An Improved Method of Median Filtering Forensics for Enhanced Image Security Detection","authors":"Kaijun Wu, Wanli Dong, Yunfei Cao, Xue Wang, Qi Zhao","doi":"10.1109/NaNA53684.2021.00060","DOIUrl":"https://doi.org/10.1109/NaNA53684.2021.00060","url":null,"abstract":"With the development of image processing technology, the forgers usually use median filtering to make their fakes appear more realistic because median filtering is a non-linear digital filtering technique which can preserve edges and smooth regions within an image. Therefore, the use of median forensics technology to identify the authenticity of images and ensure the security of image data has attracted everyone’s attention. However, how to effectively detect the median filter of high JPEG compressed small-size images is still a challenge in median filter forensics. In this paper, we proposed a framework based on deep residual learning to address this challenge. Specifically, a new convolutional neural network called MFFNet was constructed. In the first step, in order to extract the features left by the median filter, we innovatively designed a preprocessing layer containing various residuals to capture different median filter artifacts. Then, we elaborately designed a MFFNet to self-learn rich hierarchical features left in the highly JPEG compressed image for further classification. In order to prevent the over-fitting problem of the deep network, we adopted a series of enhancement schemes in the training stage to enrich the diversity of training data and obtain a more generateable and stable median filter detector. A large number of experimental results on the composite database show that the proposed framework significantly improves the detection performance compared to the latest methods for detecting highly small size image with JPEG compression.","PeriodicalId":414672,"journal":{"name":"2021 International Conference on Networking and Network Applications (NaNA)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126762655","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-10-01DOI: 10.1109/NaNA53684.2021.00073
Rui Li, Zilan Yang
The k-center problem is a famous NP complete problem in combinatorial optimization. Under the traditional distance, there is a 2-approximation algorithm for the center problem, and the partition from the center satisfies the internal connectivity. However, under the modular distance, the partition obtained by the traditional center algorithm may not satisfy the internal connectivity. Therefore, this paper proposes the problem of balanced and connected center under modular distance, and designs a nearest neighbor algorithm. Finally, an example is given to prove the correctness of the algorithm.
{"title":"The Nearest Neighbor Algorithm for Balanced and Connected k-Center Problem under Modular Distance","authors":"Rui Li, Zilan Yang","doi":"10.1109/NaNA53684.2021.00073","DOIUrl":"https://doi.org/10.1109/NaNA53684.2021.00073","url":null,"abstract":"The k-center problem is a famous NP complete problem in combinatorial optimization. Under the traditional distance, there is a 2-approximation algorithm for the center problem, and the partition from the center satisfies the internal connectivity. However, under the modular distance, the partition obtained by the traditional center algorithm may not satisfy the internal connectivity. Therefore, this paper proposes the problem of balanced and connected center under modular distance, and designs a nearest neighbor algorithm. Finally, an example is given to prove the correctness of the algorithm.","PeriodicalId":414672,"journal":{"name":"2021 International Conference on Networking and Network Applications (NaNA)","volume":"142 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115411270","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-10-01DOI: 10.1109/NaNA53684.2021.00058
Fang Ren, Mingyu Yu, Haiyan Xiu, W. Hou
This paper proposes a new symmetric information hiding scheme, aiming to increase the degree of disguise and the security. This scheme utilizes the randomness of the image cover itself to generate the secret key which has high randomness, so as to improve the effect of disguise of stego-objects and the security of information hiding scheme. In addition, this paper also proposes a new randomness test method, which can give more accurate quantitative test results and is suitable for testing the randomness of the cover. Experimental studies show that the new information hiding method can improve the degree of disguise of the stego-object and the security of the steganographic algorithm, and enhance the robustness of the information hiding to some extent.
{"title":"A New Symmetric Information Hiding Scheme Based on Cover Randomness","authors":"Fang Ren, Mingyu Yu, Haiyan Xiu, W. Hou","doi":"10.1109/NaNA53684.2021.00058","DOIUrl":"https://doi.org/10.1109/NaNA53684.2021.00058","url":null,"abstract":"This paper proposes a new symmetric information hiding scheme, aiming to increase the degree of disguise and the security. This scheme utilizes the randomness of the image cover itself to generate the secret key which has high randomness, so as to improve the effect of disguise of stego-objects and the security of information hiding scheme. In addition, this paper also proposes a new randomness test method, which can give more accurate quantitative test results and is suitable for testing the randomness of the cover. Experimental studies show that the new information hiding method can improve the degree of disguise of the stego-object and the security of the steganographic algorithm, and enhance the robustness of the information hiding to some extent.","PeriodicalId":414672,"journal":{"name":"2021 International Conference on Networking and Network Applications (NaNA)","volume":"527 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123091292","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-10-01DOI: 10.1109/NaNA53684.2021.00030
Yuanhang He, Lei Chen, Yi-Tao Ni, Yuyao Wang, Jiangtao Li, Yufeng Li
In the response to COVID-19, the big data can achieve a new data application mode with reduced manpower and material costs, which will help the government understand the supply and demand status of medical supplies and make precise decisions to ensure the supply of materials and prevent the spread of the epidemic. However, in the medical big data solution based on cloud computing, the user data storage and computing process are all carried out in the cloud, the risk of medical data is increasingly exposed, and the privacy protection of medical data is worrying. Edge computing makes data privacy protection more operational. Because the data collection and calculation are based on the local, and no longer need to be transmitted to the cloud, some important information, especially sensitive information, cannot be transmitted through the network, effectively solving the problem of user privacy leakage and data security. Function encryption provides data with a very flexible method that meets data confidentiality and effective access control. So based on function encryption, this paper proposes a privacy protection scheme under the edge computing paradigm, introduce the data interaction process for the scheme and demonstrates the privacy protection ability and computing efficiency of the scheme in the main scenario of smart medical care.
{"title":"Privacy protection scheme for edge computing based on function encryption","authors":"Yuanhang He, Lei Chen, Yi-Tao Ni, Yuyao Wang, Jiangtao Li, Yufeng Li","doi":"10.1109/NaNA53684.2021.00030","DOIUrl":"https://doi.org/10.1109/NaNA53684.2021.00030","url":null,"abstract":"In the response to COVID-19, the big data can achieve a new data application mode with reduced manpower and material costs, which will help the government understand the supply and demand status of medical supplies and make precise decisions to ensure the supply of materials and prevent the spread of the epidemic. However, in the medical big data solution based on cloud computing, the user data storage and computing process are all carried out in the cloud, the risk of medical data is increasingly exposed, and the privacy protection of medical data is worrying. Edge computing makes data privacy protection more operational. Because the data collection and calculation are based on the local, and no longer need to be transmitted to the cloud, some important information, especially sensitive information, cannot be transmitted through the network, effectively solving the problem of user privacy leakage and data security. Function encryption provides data with a very flexible method that meets data confidentiality and effective access control. So based on function encryption, this paper proposes a privacy protection scheme under the edge computing paradigm, introduce the data interaction process for the scheme and demonstrates the privacy protection ability and computing efficiency of the scheme in the main scenario of smart medical care.","PeriodicalId":414672,"journal":{"name":"2021 International Conference on Networking and Network Applications (NaNA)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116357827","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-10-01DOI: 10.1109/NaNA53684.2021.00091
Ruiyang Qin, Bowen Deng, Lele Zheng, Xutong Mu
In recent years, Internet of Things (IoT) networks have been received much attention due to their intelligence and automation. Numerous devices are deployed in the networks, and many applications are willing to obtain the distribution of IoT devices in one range for data analysis. However, some distributions of IoT devices include sensitive information which may disclose the privacy of their owners. And most IoT devices cannot afford heavy computation because of their low computing power and limited storage capacity. In this paper, we propose a privacy-preserving and efficient scheme that satisfies local differential privacy and supports O(1) -time-complexity range counting query which can find the number of IoT devices in a range. It also allows IoT devices to join or exit dynamically. Finally, theoretical analysis proves that our scheme satisfies local differential privacy, and our experiments show that our range counting query scheme can get the microsecond level.
{"title":"Privacy-Preserving and Efficient Range Counting in IoT Networks","authors":"Ruiyang Qin, Bowen Deng, Lele Zheng, Xutong Mu","doi":"10.1109/NaNA53684.2021.00091","DOIUrl":"https://doi.org/10.1109/NaNA53684.2021.00091","url":null,"abstract":"In recent years, Internet of Things (IoT) networks have been received much attention due to their intelligence and automation. Numerous devices are deployed in the networks, and many applications are willing to obtain the distribution of IoT devices in one range for data analysis. However, some distributions of IoT devices include sensitive information which may disclose the privacy of their owners. And most IoT devices cannot afford heavy computation because of their low computing power and limited storage capacity. In this paper, we propose a privacy-preserving and efficient scheme that satisfies local differential privacy and supports O(1) -time-complexity range counting query which can find the number of IoT devices in a range. It also allows IoT devices to join or exit dynamically. Finally, theoretical analysis proves that our scheme satisfies local differential privacy, and our experiments show that our range counting query scheme can get the microsecond level.","PeriodicalId":414672,"journal":{"name":"2021 International Conference on Networking and Network Applications (NaNA)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115806374","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-10-01DOI: 10.1109/NaNA53684.2021.00064
Jianxin Ji, Chunli Xia, Tong Zhang, Yichuan Wang, Sheng Liu
Vulnerability detection plays an important role in topology network security. Topology network application scope, users, and transmit the data type of the change, the increasing of the existing vulnerability detection in the process of diversification of data transmission, positioning fuzzy vulnerability detection, error messages are not clear, it is difficult to positioning and eliminate network fault in time. For this, put forward topology network multiplexer output port complex data mutation vulnerability detection. Based on topology network multiplexer output port complex data priority extraction, according to build complex data mutation scanning module and loopholes in the database are defined in the holes details to complete the multiplexer output port complex data mutation detection process. Simulation experiments show that the topology of the network multiplexer output port complex data mutation vulnerability detecting system that can effectively save the data in time. Make vulnerability detection accuracy greatly improved, provides the stability and security of the topology network security.
{"title":"Research on A Vulnerability Detection Technology for Network Topology Security","authors":"Jianxin Ji, Chunli Xia, Tong Zhang, Yichuan Wang, Sheng Liu","doi":"10.1109/NaNA53684.2021.00064","DOIUrl":"https://doi.org/10.1109/NaNA53684.2021.00064","url":null,"abstract":"Vulnerability detection plays an important role in topology network security. Topology network application scope, users, and transmit the data type of the change, the increasing of the existing vulnerability detection in the process of diversification of data transmission, positioning fuzzy vulnerability detection, error messages are not clear, it is difficult to positioning and eliminate network fault in time. For this, put forward topology network multiplexer output port complex data mutation vulnerability detection. Based on topology network multiplexer output port complex data priority extraction, according to build complex data mutation scanning module and loopholes in the database are defined in the holes details to complete the multiplexer output port complex data mutation detection process. Simulation experiments show that the topology of the network multiplexer output port complex data mutation vulnerability detecting system that can effectively save the data in time. Make vulnerability detection accuracy greatly improved, provides the stability and security of the topology network security.","PeriodicalId":414672,"journal":{"name":"2021 International Conference on Networking and Network Applications (NaNA)","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116263322","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-10-01DOI: 10.1109/NaNA53684.2021.00022
M. Umar, Xuening Liao, Jiawang Chen
Although wireless body network (WBAN) plays a vital role in revolutionizing healthcare delivery, it has also brought security concerns due to the sensitive nature of the patients’ biomedical data being measured by the sensors in the network. Thus, authentication is essential for the safety of the patients in WBAN. Recently, Koya and Deepthi proposed an anonymous hybrid authentication scheme using a physiological signal to fix the security limitations of the existing anonymous authentication approaches in WBAN. However, their scheme lacks forward secrecy and requires that additional sensing hardware be attached to each sensor in WBAN, which is not only cost-prohibitive, but can lead to compatibility issues with legacy systems. To overcome these limitations, we propose an improved anonymous hybrid authentication scheme using physical layer (PHY) channel characteristics. The key idea in the proposed scheme is to replace the physiological signal used in the Koya and Deepthi scheme with a received signal strength (RSS) information already available in the wearable devices in WBAN as an identity identifier. We conduct security analysis to show the security strength of our approach and performance analysis to prove its computational efficiency. Moreover, we conduct experiments on human volunteers in indoor and outdoor locations to show the robustness of the proposed approach. The results demonstrate that our scheme can provide anonymous authentication and identify 90% of attack attempts in WBAN with less computation cost and without any additional sensing hardware.
{"title":"Improved Anonymous Hybrid Authentication Scheme for Body Area Network Utilizing Channel Characteristics","authors":"M. Umar, Xuening Liao, Jiawang Chen","doi":"10.1109/NaNA53684.2021.00022","DOIUrl":"https://doi.org/10.1109/NaNA53684.2021.00022","url":null,"abstract":"Although wireless body network (WBAN) plays a vital role in revolutionizing healthcare delivery, it has also brought security concerns due to the sensitive nature of the patients’ biomedical data being measured by the sensors in the network. Thus, authentication is essential for the safety of the patients in WBAN. Recently, Koya and Deepthi proposed an anonymous hybrid authentication scheme using a physiological signal to fix the security limitations of the existing anonymous authentication approaches in WBAN. However, their scheme lacks forward secrecy and requires that additional sensing hardware be attached to each sensor in WBAN, which is not only cost-prohibitive, but can lead to compatibility issues with legacy systems. To overcome these limitations, we propose an improved anonymous hybrid authentication scheme using physical layer (PHY) channel characteristics. The key idea in the proposed scheme is to replace the physiological signal used in the Koya and Deepthi scheme with a received signal strength (RSS) information already available in the wearable devices in WBAN as an identity identifier. We conduct security analysis to show the security strength of our approach and performance analysis to prove its computational efficiency. Moreover, we conduct experiments on human volunteers in indoor and outdoor locations to show the robustness of the proposed approach. The results demonstrate that our scheme can provide anonymous authentication and identify 90% of attack attempts in WBAN with less computation cost and without any additional sensing hardware.","PeriodicalId":414672,"journal":{"name":"2021 International Conference on Networking and Network Applications (NaNA)","volume":"119 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123470310","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-10-01DOI: 10.1109/NaNA53684.2021.00055
Xu An Wang, Yunxuan Su, Jindan Zhang
Cloud-based storage systems are the norm in our interconnected society, although there remain a number of research and operational challenges relating to the security of such systems. One ongoing research challenge is the design of efficient and secure query authentication mechanism for cloud-based storage systems, in the sense that data users can verify the authenticity and integrity of the retrieved data from the cloud servers. In 2017, Chandrasekhar and Singhal proposed a query authentication protocol for cloud-based storage systems, designed with efficiency and scalability in mind [IEEE Transactions on Services Computing, 10(4):520-533]. In this comment, we demonstrate that their protocol is not secure as claimed, due to weaknesses in two core building blocks of the protocol, namely: the double-trapdoor variant and the multi-trapdoor variant of the trapdoor hash function. By revealing this weakness, we hope future protocol designers can avoid similar mistake in their work.
基于云的存储系统是我们这个互联社会的常态，尽管在这类系统的安全性方面仍存在许多研究和操作挑战。一个正在进行的研究挑战是为基于云的存储系统设计高效和安全的查询认证机制，从某种意义上说，数据用户可以验证从云服务器检索数据的真实性和完整性。2017年，Chandrasekhar和Singhal提出了一种基于云存储系统的查询认证协议，该协议考虑了效率和可扩展性[IEEE Transactions on Services Computing, 10(4):520-533]。在这篇评论中，我们证明了他们的协议并不像声称的那样安全，因为协议的两个核心构建块存在弱点，即:双trapdoor变体和trapdoor哈希函数的多trapdoor变体。通过揭示这个弱点，我们希望未来的协议设计者可以在他们的工作中避免类似的错误。
{"title":"Cryptanalysis of Double-trapdoor Hash Function and Multi-Trapdoor Hash Function Schemes","authors":"Xu An Wang, Yunxuan Su, Jindan Zhang","doi":"10.1109/NaNA53684.2021.00055","DOIUrl":"https://doi.org/10.1109/NaNA53684.2021.00055","url":null,"abstract":"Cloud-based storage systems are the norm in our interconnected society, although there remain a number of research and operational challenges relating to the security of such systems. One ongoing research challenge is the design of efficient and secure query authentication mechanism for cloud-based storage systems, in the sense that data users can verify the authenticity and integrity of the retrieved data from the cloud servers. In 2017, Chandrasekhar and Singhal proposed a query authentication protocol for cloud-based storage systems, designed with efficiency and scalability in mind [IEEE Transactions on Services Computing, 10(4):520-533]. In this comment, we demonstrate that their protocol is not secure as claimed, due to weaknesses in two core building blocks of the protocol, namely: the double-trapdoor variant and the multi-trapdoor variant of the trapdoor hash function. By revealing this weakness, we hope future protocol designers can avoid similar mistake in their work.","PeriodicalId":414672,"journal":{"name":"2021 International Conference on Networking and Network Applications (NaNA)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116770142","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-10-01DOI: 10.1109/NaNA53684.2021.00014
Yanwen Liu, Wei Su, Lizhuang Tan
Deadline-aware Transport Protocol (DTP) is a new QUIC-based transmission protocol that provides deliver-before-deadline service. Single-path DTP is not conducive to flow fairness and does not make full use of bandwidth. Compared with single-path DTP, the decision space and the solving difficulty of multipath DTP (MPDTP) scheduling are larger. In this paper, we propose a near-optimal scheduling algorithm Tetris for MPDTP. Tetris is a block scheduler based on stream characteristics at the transmission layer. We have verified its feasibility on the simulator under the deployed heterogeneous path of different network environment. The results show that our scheduling algorithm allows data blocks to be delivered before the delivery time as much as possible. The transmission completion time has been increased by 19.53% on average, and the transmission delay of all blocks have been reduced by 11.27%.
{"title":"Tetris: Near-optimal Scheduling for Multi-path Deadline-aware Transport Protocol","authors":"Yanwen Liu, Wei Su, Lizhuang Tan","doi":"10.1109/NaNA53684.2021.00014","DOIUrl":"https://doi.org/10.1109/NaNA53684.2021.00014","url":null,"abstract":"Deadline-aware Transport Protocol (DTP) is a new QUIC-based transmission protocol that provides deliver-before-deadline service. Single-path DTP is not conducive to flow fairness and does not make full use of bandwidth. Compared with single-path DTP, the decision space and the solving difficulty of multipath DTP (MPDTP) scheduling are larger. In this paper, we propose a near-optimal scheduling algorithm Tetris for MPDTP. Tetris is a block scheduler based on stream characteristics at the transmission layer. We have verified its feasibility on the simulator under the deployed heterogeneous path of different network environment. The results show that our scheduling algorithm allows data blocks to be delivered before the delivery time as much as possible. The transmission completion time has been increased by 19.53% on average, and the transmission delay of all blocks have been reduced by 11.27%.","PeriodicalId":414672,"journal":{"name":"2021 International Conference on Networking and Network Applications (NaNA)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127626886","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：