Pub Date : 1900-01-01DOI: 10.1109/ICCNC.2017.7876128
Minkeun Ha, Daeyoung Kim
A significant number of promising wireless sensor applications for the Internet of Things (IoT) are becoming a reality. Most of these applications require a variety of heterogeneous and geographical sensor data to be delivered to users such as mobile devices, vehicles, and cloud systems for big data analysis to extract maximum value from the physical world. Data caching of popular data items in a network can significantly improve efficiency and reliability of content delivery by contributing the reduction of data access delay, bandwidth usage, and packet losses in resource-limited low-rate wireless sensor networks. In this paper, we propose an efficient cache placement protocol (BCDA) that minimizes data access cost and guarantees cache consistency in a lightweight manner. The BCDA decides where to store a copy of data content in a network using a distributed approach according to clients' access patterns, memory capacity, data size, and so on. To evaluate the feasibility and effectiveness, we implemented the BCDA in ns-2 and compared its performance with existing caching strategies. The simulation results highlight that the BCDA significantly reduces data access cost with minimizing cache management cost.
{"title":"On-demand cache placement protocol for content delivery sensor networks","authors":"Minkeun Ha, Daeyoung Kim","doi":"10.1109/ICCNC.2017.7876128","DOIUrl":"https://doi.org/10.1109/ICCNC.2017.7876128","url":null,"abstract":"A significant number of promising wireless sensor applications for the Internet of Things (IoT) are becoming a reality. Most of these applications require a variety of heterogeneous and geographical sensor data to be delivered to users such as mobile devices, vehicles, and cloud systems for big data analysis to extract maximum value from the physical world. Data caching of popular data items in a network can significantly improve efficiency and reliability of content delivery by contributing the reduction of data access delay, bandwidth usage, and packet losses in resource-limited low-rate wireless sensor networks. In this paper, we propose an efficient cache placement protocol (BCDA) that minimizes data access cost and guarantees cache consistency in a lightweight manner. The BCDA decides where to store a copy of data content in a network using a distributed approach according to clients' access patterns, memory capacity, data size, and so on. To evaluate the feasibility and effectiveness, we implemented the BCDA in ns-2 and compared its performance with existing caching strategies. The simulation results highlight that the BCDA significantly reduces data access cost with minimizing cache management cost.","PeriodicalId":135028,"journal":{"name":"2017 International Conference on Computing, Networking and Communications (ICNC)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134092227","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 : 1900-01-01DOI: 10.1109/ICCNC.2017.7876169
M. Azab, J. Fortes
SDN networks rely mainly on a set of software defined modules, running on generic hardware platforms, and managed by a central SDN controller. The tight coupling and lack of isolation between the controller and the underlying host limit the controller resilience against host-based attacks and failures. That controller is a single point of failure and a target for attackers. “Linux-containers” is a successful thin virtualization technique that enables encapsulated, host-isolated execution-environments for running applications. In this paper we present PAFR, a controller sandboxing mechanism based on Linux-containers. PAFR enables controller/host isolation, plug-and-play operation, failure-and-attack-resilient execution, and fast recovery. PAFR employs and manages live remote checkpointing and migration between different hosts to evade failures and attacks. Experiments and simulations show that the frequent employment of PAFR's live-migration minimizes the chance of successful attack/failure with limited to no impact on network performance.
{"title":"Towards proactive SDN-controller attack and failure resilience","authors":"M. Azab, J. Fortes","doi":"10.1109/ICCNC.2017.7876169","DOIUrl":"https://doi.org/10.1109/ICCNC.2017.7876169","url":null,"abstract":"SDN networks rely mainly on a set of software defined modules, running on generic hardware platforms, and managed by a central SDN controller. The tight coupling and lack of isolation between the controller and the underlying host limit the controller resilience against host-based attacks and failures. That controller is a single point of failure and a target for attackers. “Linux-containers” is a successful thin virtualization technique that enables encapsulated, host-isolated execution-environments for running applications. In this paper we present PAFR, a controller sandboxing mechanism based on Linux-containers. PAFR enables controller/host isolation, plug-and-play operation, failure-and-attack-resilient execution, and fast recovery. PAFR employs and manages live remote checkpointing and migration between different hosts to evade failures and attacks. Experiments and simulations show that the frequent employment of PAFR's live-migration minimizes the chance of successful attack/failure with limited to no impact on network performance.","PeriodicalId":135028,"journal":{"name":"2017 International Conference on Computing, Networking and Communications (ICNC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130335810","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 : 1900-01-01DOI: 10.1109/ICCNC.2017.7876203
Dai Suzuki, Satoshi Imai, T. Katagiri
Network Functions Virtualization (NFV) is a technology for running software-based functions on commodity hardware, which can lead to cost savings and flexible functionality. However, due to the software processing of network functions, the performance of Virtualized Network Functions (VNFs) is considerably degraded in relation to the types of VNFs and the configuration of VNF applications. Therefore, for a practical NFV system, grasping the accurate workload of VNF applications and managing the VNF performance are important. This paper focuses on analysis of a virtual firewall as a representative VNF. We first reveal new insights about the performance characteristics of the virtual firewall through preliminary experiments. Furthermore, we propose a method for estimating the hidden workload of the virtual firewall by using the number of rules in an Access Control List (ACL) and the traffic volume for each rule. Finally, we show the effectiveness of the proposed methods.
{"title":"A new index of hidden workload for firewall rule processing on virtual machine","authors":"Dai Suzuki, Satoshi Imai, T. Katagiri","doi":"10.1109/ICCNC.2017.7876203","DOIUrl":"https://doi.org/10.1109/ICCNC.2017.7876203","url":null,"abstract":"Network Functions Virtualization (NFV) is a technology for running software-based functions on commodity hardware, which can lead to cost savings and flexible functionality. However, due to the software processing of network functions, the performance of Virtualized Network Functions (VNFs) is considerably degraded in relation to the types of VNFs and the configuration of VNF applications. Therefore, for a practical NFV system, grasping the accurate workload of VNF applications and managing the VNF performance are important. This paper focuses on analysis of a virtual firewall as a representative VNF. We first reveal new insights about the performance characteristics of the virtual firewall through preliminary experiments. Furthermore, we propose a method for estimating the hidden workload of the virtual firewall by using the number of rules in an Access Control List (ACL) and the traffic volume for each rule. Finally, we show the effectiveness of the proposed methods.","PeriodicalId":135028,"journal":{"name":"2017 International Conference on Computing, Networking and Communications (ICNC)","volume":"294 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115703247","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 : 1900-01-01DOI: 10.1109/ICCNC.2017.7876097
Chia-Lin Tsai, Pei-Rong Li, Kai-Ten Feng
To alleviate greenhouse effect, high network energy efficiency (EE) has increasingly become an important research target in wireless communication systems. In this paper, the investigation for resource blocks (RBs) and transmit power allocation to mitigate co-tier interference in small cell networks is provided. In view of the drawbacks for considerable computational loadings and the acquisition for global channel information under centralized control, this paper proposes a framework based on a cooperative game to distributively perform resource allocation with only limited information. Moreover, the outage probability analyses for both perfect and imperfect channel state information at the transmitter (CSIT) are discussed in this paper. Furthermore, a regret-based learning algorithm for the proposed outage-based cooperative resource competition game (OCRC) to reach the correlated equilibrium (CE) is adapted. Simulation results verify the convergence in proposed OCRC scheme. Additionally, the proposed OCRC scheme can maintain and provide better EE performance compared to equal power allocation (EPA) scheme with imperfect CSIT.
{"title":"Outage-based cooperative resource competition game in LTE-A small cell networks","authors":"Chia-Lin Tsai, Pei-Rong Li, Kai-Ten Feng","doi":"10.1109/ICCNC.2017.7876097","DOIUrl":"https://doi.org/10.1109/ICCNC.2017.7876097","url":null,"abstract":"To alleviate greenhouse effect, high network energy efficiency (EE) has increasingly become an important research target in wireless communication systems. In this paper, the investigation for resource blocks (RBs) and transmit power allocation to mitigate co-tier interference in small cell networks is provided. In view of the drawbacks for considerable computational loadings and the acquisition for global channel information under centralized control, this paper proposes a framework based on a cooperative game to distributively perform resource allocation with only limited information. Moreover, the outage probability analyses for both perfect and imperfect channel state information at the transmitter (CSIT) are discussed in this paper. Furthermore, a regret-based learning algorithm for the proposed outage-based cooperative resource competition game (OCRC) to reach the correlated equilibrium (CE) is adapted. Simulation results verify the convergence in proposed OCRC scheme. Additionally, the proposed OCRC scheme can maintain and provide better EE performance compared to equal power allocation (EPA) scheme with imperfect CSIT.","PeriodicalId":135028,"journal":{"name":"2017 International Conference on Computing, Networking and Communications (ICNC)","volume":"89 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114561971","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 : 1900-01-01DOI: 10.1109/ICCNC.2017.7876124
P. Sadhukhan, K. Dahal, Zeeshan Pervez
Among the various indoor localization systems, received signal strength (RSS) based fingerprinting localization provides most cost-effective solution as it uses the existing wireless network infrastructure. The positioning accuracy of such localization systems can be improved by incorporating huge number of training data, which in turn, increases the searching overhead of such localization systems. Several clustering strategies for fingerprinting localization have been proposed in literature in order to reduce the searching overhead. On the other hand, placement strategy of beacon nodes within the field of localization has significant influence on the performances of clustering strategies for fingerprinting localization. Two important factors associated with some beacon placement strategy are the degree of beacon coverage and the distribution of beacon nodes. In this paper, we present an optimal beacon placement strategy that meets a k-coverage visibility requirement for beacons at every point within the field of localization. Next, we demonstrate the impact of beacon coverage on the performance of several clustering strategies suitable for a large-scale fingerprinting localization system.
{"title":"Impact of beacon coverage on clustering strategies for fingerprinting localization system","authors":"P. Sadhukhan, K. Dahal, Zeeshan Pervez","doi":"10.1109/ICCNC.2017.7876124","DOIUrl":"https://doi.org/10.1109/ICCNC.2017.7876124","url":null,"abstract":"Among the various indoor localization systems, received signal strength (RSS) based fingerprinting localization provides most cost-effective solution as it uses the existing wireless network infrastructure. The positioning accuracy of such localization systems can be improved by incorporating huge number of training data, which in turn, increases the searching overhead of such localization systems. Several clustering strategies for fingerprinting localization have been proposed in literature in order to reduce the searching overhead. On the other hand, placement strategy of beacon nodes within the field of localization has significant influence on the performances of clustering strategies for fingerprinting localization. Two important factors associated with some beacon placement strategy are the degree of beacon coverage and the distribution of beacon nodes. In this paper, we present an optimal beacon placement strategy that meets a k-coverage visibility requirement for beacons at every point within the field of localization. Next, we demonstrate the impact of beacon coverage on the performance of several clustering strategies suitable for a large-scale fingerprinting localization system.","PeriodicalId":135028,"journal":{"name":"2017 International Conference on Computing, Networking and Communications (ICNC)","volume":"370 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115784477","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 : 1900-01-01DOI: 10.1109/ICCNC.2017.7876095
Yubing Jian, U. Moravapalle, Chao-Fang Shih, Raghupathy Sivakumar
LTE in Unlicensed band (LTE-U) has gained intensive attention recently due to its capability to offload mobile data to unlicensed bands. In order to use unlicensed band, LTE-U has to coexist with WiFi - another wireless technology that operates in unlicensed bands. This coexistence is riddled with several challenges as these technologies use different core networks, backhauls and deployment plans. Within this broad paradigm, we present Duet, a Medium Access Control (MAC) layer solution that enables both LTE-U and WiFi nodes to operate fairly and efficiently, with the following properties: (1) no changes in WiFi framework, (2) high performance of LTE-U and WiFi networks within static and dynamic load scenarios, and (3) robustness to fully and partially connected networks. Using ns-3, we simulate Duet in various scenarios and show that Duet can improve the overall network throughput by up to 74%.
LTE in unlicensing band (LTE- u)由于能够将移动数据卸载到非授权频段而受到了广泛关注。为了使用未授权频段，LTE-U必须与另一种在未授权频段上运行的无线技术WiFi共存。由于这些技术使用不同的核心网络、回程和部署计划，这种共存充满了一些挑战。在这个广泛的范例中，我们提出了Duet，一种介质访问控制(MAC)层解决方案，使LTE-U和WiFi节点能够公平有效地运行，具有以下特性:(1)WiFi框架没有变化，(2)LTE-U和WiFi网络在静态和动态负载场景下的高性能，以及(3)对完全和部分连接网络的鲁棒性。使用ns-3，我们在各种场景中模拟了Duet，并表明Duet可以将整体网络吞吐量提高高达74%。
{"title":"Duet: An adaptive algorithm for the coexistence of LTE-U and WiFi in Unlicensed spectrum","authors":"Yubing Jian, U. Moravapalle, Chao-Fang Shih, Raghupathy Sivakumar","doi":"10.1109/ICCNC.2017.7876095","DOIUrl":"https://doi.org/10.1109/ICCNC.2017.7876095","url":null,"abstract":"LTE in Unlicensed band (LTE-U) has gained intensive attention recently due to its capability to offload mobile data to unlicensed bands. In order to use unlicensed band, LTE-U has to coexist with WiFi - another wireless technology that operates in unlicensed bands. This coexistence is riddled with several challenges as these technologies use different core networks, backhauls and deployment plans. Within this broad paradigm, we present Duet, a Medium Access Control (MAC) layer solution that enables both LTE-U and WiFi nodes to operate fairly and efficiently, with the following properties: (1) no changes in WiFi framework, (2) high performance of LTE-U and WiFi networks within static and dynamic load scenarios, and (3) robustness to fully and partially connected networks. Using ns-3, we simulate Duet in various scenarios and show that Duet can improve the overall network throughput by up to 74%.","PeriodicalId":135028,"journal":{"name":"2017 International Conference on Computing, Networking and Communications (ICNC)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125067836","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 : 1900-01-01DOI: 10.1109/ICCNC.2017.7876174
Jianbin Chuan, Li Wang, Shuangshuang Ma
Distributed cache at mobile user devices and small base stations (SBSs) can improve the efficiency and reduce the delay for content dissemination in heterogeneous cellular networks (HetNets). One major challenge lies in the limited storage capacity of the participating mobile devices and SBSs. This paper investigates the design of an effective distributed content cache policy with heterogeneity (DCP-H) based on erasure code in terms of SBSs and mobile devices by considering sociality characteristics and physical communication conditions. The key feature of our proposed scheme lies in the PageRank algorithm based design, in which the transmit power and delivery delay is optimized through optimizing the cache states of content items to maximize cache hit ratio. Numerical results demonstrate the performance and advantage of our proposed scheme.
{"title":"Distributed cache for efficient content sharing in heterogeneous networks","authors":"Jianbin Chuan, Li Wang, Shuangshuang Ma","doi":"10.1109/ICCNC.2017.7876174","DOIUrl":"https://doi.org/10.1109/ICCNC.2017.7876174","url":null,"abstract":"Distributed cache at mobile user devices and small base stations (SBSs) can improve the efficiency and reduce the delay for content dissemination in heterogeneous cellular networks (HetNets). One major challenge lies in the limited storage capacity of the participating mobile devices and SBSs. This paper investigates the design of an effective distributed content cache policy with heterogeneity (DCP-H) based on erasure code in terms of SBSs and mobile devices by considering sociality characteristics and physical communication conditions. The key feature of our proposed scheme lies in the PageRank algorithm based design, in which the transmit power and delivery delay is optimized through optimizing the cache states of content items to maximize cache hit ratio. Numerical results demonstrate the performance and advantage of our proposed scheme.","PeriodicalId":135028,"journal":{"name":"2017 International Conference on Computing, Networking and Communications (ICNC)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125595503","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 : 1900-01-01DOI: 10.1109/ICCNC.2017.7876159
Mohsen Karimzadeh Kiskani, H. Sadjadpour
A decentralized coded caching technique is introduced for wireless ad hoc networks in which all the existing contents are randomly combined and cached. The scaling behavior of the network is studied in terms of both capacity and security. Proactive and reactive routing techniques for coded caching are presented and the scaling capacity of the network for each case is derived. It has been shown that by using reactive routing, any content can be retrieved by selecting a random path while providing asymptotic optimum solution. The proposed coded caching significantly simplifies the routing protocol in cached networks. We further prove that asymptotic perfect secrecy can be achieved using proposed coded caching scheme.
{"title":"Secure coded caching in wireless ad hoc networks","authors":"Mohsen Karimzadeh Kiskani, H. Sadjadpour","doi":"10.1109/ICCNC.2017.7876159","DOIUrl":"https://doi.org/10.1109/ICCNC.2017.7876159","url":null,"abstract":"A decentralized coded caching technique is introduced for wireless ad hoc networks in which all the existing contents are randomly combined and cached. The scaling behavior of the network is studied in terms of both capacity and security. Proactive and reactive routing techniques for coded caching are presented and the scaling capacity of the network for each case is derived. It has been shown that by using reactive routing, any content can be retrieved by selecting a random path while providing asymptotic optimum solution. The proposed coded caching significantly simplifies the routing protocol in cached networks. We further prove that asymptotic perfect secrecy can be achieved using proposed coded caching scheme.","PeriodicalId":135028,"journal":{"name":"2017 International Conference on Computing, Networking and Communications (ICNC)","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125783631","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 : 1900-01-01DOI: 10.1109/ICCNC.2017.7876152
Tianlong Song, Yuan Liang, Tongtong Li
This paper considers a game between a power-limited authorized user and a power-limited jammer, who operate independently over the same AWGN channel consisting of multiple bands. We explore the possibility for the authorized user or the jammer to randomly utilize part (or all) of the available spectrum and/or apply nonuniform power allocation. It is found that: either for the authorized user to maximize its capacity, or for the jammer to minimize the capacity of the authorized user, the best strategy for both of them is to distribute the transmission power or jamming power uniformly over all the available spectrum. The minimax capacity can be calculated based on the channel bandwidth and the signal to jamming and noise ratio, and it matches with the Shannon channel capacity formula. Numerical results are provided to illustrate the theoretical analysis.
{"title":"Physical layer security of multiband communications under hostile jamming","authors":"Tianlong Song, Yuan Liang, Tongtong Li","doi":"10.1109/ICCNC.2017.7876152","DOIUrl":"https://doi.org/10.1109/ICCNC.2017.7876152","url":null,"abstract":"This paper considers a game between a power-limited authorized user and a power-limited jammer, who operate independently over the same AWGN channel consisting of multiple bands. We explore the possibility for the authorized user or the jammer to randomly utilize part (or all) of the available spectrum and/or apply nonuniform power allocation. It is found that: either for the authorized user to maximize its capacity, or for the jammer to minimize the capacity of the authorized user, the best strategy for both of them is to distribute the transmission power or jamming power uniformly over all the available spectrum. The minimax capacity can be calculated based on the channel bandwidth and the signal to jamming and noise ratio, and it matches with the Shannon channel capacity formula. Numerical results are provided to illustrate the theoretical analysis.","PeriodicalId":135028,"journal":{"name":"2017 International Conference on Computing, Networking and Communications (ICNC)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121924777","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 : 1900-01-01DOI: 10.1109/ICCNC.2017.7876114
Linxi Zhang, Nan Zhao, Changxing Pei, Long Wang
Quantum cryptography is believed to be unbreakable in theory because of the laws of quantum mechanics. Numerous experiments have demonstrated the feasibility of quantum cryptography and a complete proof of the unconditional security of some main schemes. However, in practice all devices need trusting by each other firstly during the process of quantum key distribution(QKD). For identifying the reliability, we propose a quantum bit commitment protocol that can be regarded as the primitive of authentication protocol in QKD networks. In this protocol we complete bit commitment merely by one agent, and prove the security of the schemes. Compared with other protocols, our schemes have less requirement for additional hardware and lower complexity in implementation.
{"title":"A novel single agent quantum bit commitment scheme","authors":"Linxi Zhang, Nan Zhao, Changxing Pei, Long Wang","doi":"10.1109/ICCNC.2017.7876114","DOIUrl":"https://doi.org/10.1109/ICCNC.2017.7876114","url":null,"abstract":"Quantum cryptography is believed to be unbreakable in theory because of the laws of quantum mechanics. Numerous experiments have demonstrated the feasibility of quantum cryptography and a complete proof of the unconditional security of some main schemes. However, in practice all devices need trusting by each other firstly during the process of quantum key distribution(QKD). For identifying the reliability, we propose a quantum bit commitment protocol that can be regarded as the primitive of authentication protocol in QKD networks. In this protocol we complete bit commitment merely by one agent, and prove the security of the schemes. Compared with other protocols, our schemes have less requirement for additional hardware and lower complexity in implementation.","PeriodicalId":135028,"journal":{"name":"2017 International Conference on Computing, Networking and Communications (ICNC)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121352510","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
扫码关注我们
求助内容：
应助结果提醒方式：