Pub Date : 2024-06-26DOI: 10.26599/TST.2024.9010057
Xinyu Dou;Tengxiao Lyu;Xiaohan Ren;Dequn Liang
The Space-Air-Ground-Sea Integrated Networks (SAGSIN) will place higher requirements on both spectral efficiency and security for future maritime communications. To simultaneously address these two challenges, in this paper, a non-orthogonal modulation based multi-carrier differential chaos shift keying system (namely MCNO-DCSK) is proposed and demonstrated. The most remarkable feature of MCNO-DCSK is that the strict orthogonality between subcarriers is no longer required. In this way, frequency intervals between subcarriers can be much smaller than ever, which leads to a high spectral efficiency. Meanwhile, the frequency interval can be set more flexibly to make the symbol more difficult to be deciphered. Therefore, a high level of security can also be guaranteed. In this design, multiple modulated non-orthogonal subcarriers are sequentially delayed and directly superimposed in time domain to construct the MCNO-DCSK symbol. At the receiver, information bits are demodulated through solving a system of linear equations. The spectral efficiency, computational complexity, and security are analyzed, and the bit-error-rate expressions are derived. Moreover, as subcarriers are non-orthogonal and time delayed, the MCNO-DCSK will suffer severe interference over the multi-path channel. Therefore, the effect of the multi-path interference on the system performance is discussed, and a method to mitigate this interference is designed. Finally, simulation results are provided to verify the theoretical analysis and demonstrate the superiority of MCNO-DCSK.
{"title":"A Non-Orthogonal Modulation Based High Spectral Efficiency and High Security Multi-Carrier Differential Chaos Shift Keying for Maritime Communications","authors":"Xinyu Dou;Tengxiao Lyu;Xiaohan Ren;Dequn Liang","doi":"10.26599/TST.2024.9010057","DOIUrl":"https://doi.org/10.26599/TST.2024.9010057","url":null,"abstract":"The Space-Air-Ground-Sea Integrated Networks (SAGSIN) will place higher requirements on both spectral efficiency and security for future maritime communications. To simultaneously address these two challenges, in this paper, a non-orthogonal modulation based multi-carrier differential chaos shift keying system (namely MCNO-DCSK) is proposed and demonstrated. The most remarkable feature of MCNO-DCSK is that the strict orthogonality between subcarriers is no longer required. In this way, frequency intervals between subcarriers can be much smaller than ever, which leads to a high spectral efficiency. Meanwhile, the frequency interval can be set more flexibly to make the symbol more difficult to be deciphered. Therefore, a high level of security can also be guaranteed. In this design, multiple modulated non-orthogonal subcarriers are sequentially delayed and directly superimposed in time domain to construct the MCNO-DCSK symbol. At the receiver, information bits are demodulated through solving a system of linear equations. The spectral efficiency, computational complexity, and security are analyzed, and the bit-error-rate expressions are derived. Moreover, as subcarriers are non-orthogonal and time delayed, the MCNO-DCSK will suffer severe interference over the multi-path channel. Therefore, the effect of the multi-path interference on the system performance is discussed, and a method to mitigate this interference is designed. Finally, simulation results are provided to verify the theoretical analysis and demonstrate the superiority of MCNO-DCSK.","PeriodicalId":48690,"journal":{"name":"Tsinghua Science and Technology","volume":"30 3","pages":"1079-1095"},"PeriodicalIF":6.6,"publicationDate":"2024-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10574207","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142905729","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-06-26DOI: 10.26599/TST.2024.9010055
Yuanshuo Gang;Yuexia Zhang;Zhihai Zhuo
Space-Air-Ground integrated Vehicular Network (SAGVN) aims to achieve ubiquitous connectivity and provide abundant computational resources to enhance the performance and efficiency of the vehicular networks. Nonetheless, there are still challenges to overcome, including the scheduling of multilayered computational resources and the scarcity of spectrum resources. To address these problems, we propose a joint Task Offloading (TO) and Resource Allocation (RA) strategy in SAGVN (namely JTRSS). This strategy establishes an SAGVN model that incorporates air and space networks to expand the options for vehicular TO, and enhances the edge-computing resources of the system by deploying edge servers. To minimize the system average cost, we use the JTRSS algorithm to decompose the original problem into a number of subproblems. A maximum rate matching algorithm is used to address the channel allocation and the Lagrangian multiplier method is employed for computational RA. To acquire the optimal TO decision, a differential fusion cuckoo search algorithm is designed. Extensive simulation results demonstrate the significant superiority of the JTRSS algorithm in optimizing the system average cost.
{"title":"Joint Task Offloading and Resource Allocation Strategy for Space-Air-Ground Integrated Vehicular Networks","authors":"Yuanshuo Gang;Yuexia Zhang;Zhihai Zhuo","doi":"10.26599/TST.2024.9010055","DOIUrl":"https://doi.org/10.26599/TST.2024.9010055","url":null,"abstract":"Space-Air-Ground integrated Vehicular Network (SAGVN) aims to achieve ubiquitous connectivity and provide abundant computational resources to enhance the performance and efficiency of the vehicular networks. Nonetheless, there are still challenges to overcome, including the scheduling of multilayered computational resources and the scarcity of spectrum resources. To address these problems, we propose a joint Task Offloading (TO) and Resource Allocation (RA) strategy in SAGVN (namely JTRSS). This strategy establishes an SAGVN model that incorporates air and space networks to expand the options for vehicular TO, and enhances the edge-computing resources of the system by deploying edge servers. To minimize the system average cost, we use the JTRSS algorithm to decompose the original problem into a number of subproblems. A maximum rate matching algorithm is used to address the channel allocation and the Lagrangian multiplier method is employed for computational RA. To acquire the optimal TO decision, a differential fusion cuckoo search algorithm is designed. Extensive simulation results demonstrate the significant superiority of the JTRSS algorithm in optimizing the system average cost.","PeriodicalId":48690,"journal":{"name":"Tsinghua Science and Technology","volume":"30 3","pages":"1027-1043"},"PeriodicalIF":6.6,"publicationDate":"2024-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10574209","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142905924","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The diversified development of the service ecosystem, particularly the rapid growth of services like cloud and edge computing, has propelled the flourishing expansion of the service trading market. However, in the absence of appropriate pricing guidance, service providers often devise pricing strategies solely based on their own interests, potentially hindering the maximization of overall market profits. This challenge is even more severe in edge computing scenarios, as different edge service providers are dispersed across various regions and influenced by multiple factors, making it challenging to establish a unified pricing model. This paper introduces a multi-participant stochastic game model to formalize the pricing problem of multiple edge services. Subsequently, an incentive mechanism based on Pareto improvement is proposed to drive the game towards Pareto optimal direction, achieving optimal profits. Finally, an enhanced PSO algorithm was proposed by adaptively optimizing inertia factor across three stages. This optimization significantly improved the efficiency of solving the game model and analyzed equilibrium states under various evolutionary mechanisms. Experimental results demonstrate that the proposed pricing incentive mechanism promotes more effective and rational pricing allocations, while also demonstrating the effectiveness of our algorithm in resolving game problems.
{"title":"Maximizing Overall Service Profit: Multi-Edge Service Pricing as a Stochastic Game Model","authors":"Shengye Pang;Xinkui Zhao;Jiayin Luo;Jintao Chen;Fan Wang;Jianwei Yin","doi":"10.26599/TST.2024.9010050","DOIUrl":"https://doi.org/10.26599/TST.2024.9010050","url":null,"abstract":"The diversified development of the service ecosystem, particularly the rapid growth of services like cloud and edge computing, has propelled the flourishing expansion of the service trading market. However, in the absence of appropriate pricing guidance, service providers often devise pricing strategies solely based on their own interests, potentially hindering the maximization of overall market profits. This challenge is even more severe in edge computing scenarios, as different edge service providers are dispersed across various regions and influenced by multiple factors, making it challenging to establish a unified pricing model. This paper introduces a multi-participant stochastic game model to formalize the pricing problem of multiple edge services. Subsequently, an incentive mechanism based on Pareto improvement is proposed to drive the game towards Pareto optimal direction, achieving optimal profits. Finally, an enhanced PSO algorithm was proposed by adaptively optimizing inertia factor across three stages. This optimization significantly improved the efficiency of solving the game model and analyzed equilibrium states under various evolutionary mechanisms. Experimental results demonstrate that the proposed pricing incentive mechanism promotes more effective and rational pricing allocations, while also demonstrating the effectiveness of our algorithm in resolving game problems.","PeriodicalId":48690,"journal":{"name":"Tsinghua Science and Technology","volume":"29 6","pages":"1872-1889"},"PeriodicalIF":6.6,"publicationDate":"2024-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10566008","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141435459","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-06-20DOI: 10.26599/TST.2023.9010136
Mengqiu Zhang;Qiang Qu;Li Ning;Jianping Fan
With the widespread adoption of blockchain applications, the imperative for seamless data migration among decentralized applications has intensified. This necessity arises from various factors, including the depletion of blockchain disk space, transitions between blockchain systems, and specific requirements such as temporal data analysis. To meet these challenges and ensure the sustained functionality of applications, it is imperative to conduct time-aware cross-blockchain data migration. This process is designed to facilitate the smooth iteration of decentralized applications and the construction of a temporal index for historical data, all while preserving the integrity of the original data. In various application scenarios, this migration task may encompass the transfer of data between multiple blockchains, involving movements from one chain to another, from one chain to several chains, or from multiple chains to a single chain. However, the success of data migration hinges on the careful consideration of factors such as the reliability of the data source, data consistency, and migration efficiency. This paper introduces a time-aware cross-blockchain data migration approach tailored to accommodate diverse application scenarios, including migration between multiple chains. The proposed solution integrates a collective mechanism for controlling, executing, and storing procedures to address the complexities of data migration, incorporating elements such as transaction classification and matching. Extensive experiments have been conducted to validate the efficacy of the proposed approach.
{"title":"On Time-Aware Cross-Blockchain Data Migration","authors":"Mengqiu Zhang;Qiang Qu;Li Ning;Jianping Fan","doi":"10.26599/TST.2023.9010136","DOIUrl":"https://doi.org/10.26599/TST.2023.9010136","url":null,"abstract":"With the widespread adoption of blockchain applications, the imperative for seamless data migration among decentralized applications has intensified. This necessity arises from various factors, including the depletion of blockchain disk space, transitions between blockchain systems, and specific requirements such as temporal data analysis. To meet these challenges and ensure the sustained functionality of applications, it is imperative to conduct time-aware cross-blockchain data migration. This process is designed to facilitate the smooth iteration of decentralized applications and the construction of a temporal index for historical data, all while preserving the integrity of the original data. In various application scenarios, this migration task may encompass the transfer of data between multiple blockchains, involving movements from one chain to another, from one chain to several chains, or from multiple chains to a single chain. However, the success of data migration hinges on the careful consideration of factors such as the reliability of the data source, data consistency, and migration efficiency. This paper introduces a time-aware cross-blockchain data migration approach tailored to accommodate diverse application scenarios, including migration between multiple chains. The proposed solution integrates a collective mechanism for controlling, executing, and storing procedures to address the complexities of data migration, incorporating elements such as transaction classification and matching. Extensive experiments have been conducted to validate the efficacy of the proposed approach.","PeriodicalId":48690,"journal":{"name":"Tsinghua Science and Technology","volume":"29 6","pages":"1810-1820"},"PeriodicalIF":6.6,"publicationDate":"2024-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10566005","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141435220","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In the critical field of electrical grid maintenance, ensuring the integrity of power line insulators is a primary concern. This study introduces an innovative approach for monitoring the condition of insulators using aerial surveillance via drone-mounted cameras. The proposed method is a composite deep learning framework that integrates the “You Only Look Once” version 3 (YOLO3) model with deep convolutional generative adversarial networks (DCGAN) and super-resolution generative adversarial networks (SRGAN). The YOLO3 model excels in rapidly and accurately detecting insulators, a vital step in assessing their health. Its effectiveness in distinguishing insulators against complex backgrounds enables prompt detection of defects, essential for proactive maintenance. This rapid detection is enhanced by DCGAN's precise classification and SRGAN's image quality improvement, addressing challenges posed by low-resolution drone imagery. The framework's performance was evaluated using metrics such as sensitivity, specificity, accuracy, localization accuracy, damage sensitivity, and false alarm rate. Results show that the SRGAN+DCGAN+YOLO3 model significantly outperforms existing methods, with a sensitivity of 98%, specificity of 94%, an overall accuracy of 95.6%, localization accuracy of 90%, damage sensitivity of 92%, and a reduced false alarm rate of 8%. This advanced hybrid approach not only improves the detection and classification of insulator conditions but also contributes substantially to the maintenance and health of power line insulators, thus ensuring the reliability of the electrical power grid.
{"title":"Enhancing Power Line Insulator Health Monitoring with a Hybrid Generative Adversarial Network and YOLO3 Solution","authors":"Ramakrishna Akella;Sravan Kumar Gunturi;Dipu Sarkar","doi":"10.26599/TST.2023.9010137","DOIUrl":"https://doi.org/10.26599/TST.2023.9010137","url":null,"abstract":"In the critical field of electrical grid maintenance, ensuring the integrity of power line insulators is a primary concern. This study introduces an innovative approach for monitoring the condition of insulators using aerial surveillance via drone-mounted cameras. The proposed method is a composite deep learning framework that integrates the “You Only Look Once” version 3 (YOLO3) model with deep convolutional generative adversarial networks (DCGAN) and super-resolution generative adversarial networks (SRGAN). The YOLO3 model excels in rapidly and accurately detecting insulators, a vital step in assessing their health. Its effectiveness in distinguishing insulators against complex backgrounds enables prompt detection of defects, essential for proactive maintenance. This rapid detection is enhanced by DCGAN's precise classification and SRGAN's image quality improvement, addressing challenges posed by low-resolution drone imagery. The framework's performance was evaluated using metrics such as sensitivity, specificity, accuracy, localization accuracy, damage sensitivity, and false alarm rate. Results show that the SRGAN+DCGAN+YOLO3 model significantly outperforms existing methods, with a sensitivity of 98%, specificity of 94%, an overall accuracy of 95.6%, localization accuracy of 90%, damage sensitivity of 92%, and a reduced false alarm rate of 8%. This advanced hybrid approach not only improves the detection and classification of insulator conditions but also contributes substantially to the maintenance and health of power line insulators, thus ensuring the reliability of the electrical power grid.","PeriodicalId":48690,"journal":{"name":"Tsinghua Science and Technology","volume":"29 6","pages":"1796-1809"},"PeriodicalIF":6.6,"publicationDate":"2024-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10566001","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141435221","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-06-20DOI: 10.26599/TST.2023.9010083
Xiujun Wang;Lei Mo;Xiao Zheng;Zhe Dang
Continuously publishing histograms in data streams is crucial to many real-time applications, as it provides not only critical statistical information, but also reduces privacy leaking risk. As the importance of elements usually decreases over time in data streams, in this paper we model a data stream by a sequence of weighted sliding windows, and then study how to publish histograms over these windows continuously. The existing literature can hardly solve this problem in a real-time way, because they need to buffer all elements in each sliding window, resulting in high computational overhead and prohibitive storage burden. In this paper, we overcome this drawback by proposing an online algorithm denoted by Efficient Streaming Histogram Publishing (ESHP) to continuously publish histograms over weighted sliding windows. Specifically, our method first creates a novel sketching structure, called Approximate-Estimate Sketch (AESketch), to maintain the counting information of each histogram interval at every time instance; then, it creates histograms that satisfy the differential privacy requirement by smartly adding appropriate noise values into the sketching structure. Extensive experimental results and rigorous theoretical analysis demonstrate that the ESHP method can offer equivalent data utility with significantly lower computational overhead and storage costs when compared to other existing methods.
{"title":"Streaming Histogram Publication Over Weighted Sliding Windows Under Differential Privacy","authors":"Xiujun Wang;Lei Mo;Xiao Zheng;Zhe Dang","doi":"10.26599/TST.2023.9010083","DOIUrl":"https://doi.org/10.26599/TST.2023.9010083","url":null,"abstract":"Continuously publishing histograms in data streams is crucial to many real-time applications, as it provides not only critical statistical information, but also reduces privacy leaking risk. As the importance of elements usually decreases over time in data streams, in this paper we model a data stream by a sequence of weighted sliding windows, and then study how to publish histograms over these windows continuously. The existing literature can hardly solve this problem in a real-time way, because they need to buffer all elements in each sliding window, resulting in high computational overhead and prohibitive storage burden. In this paper, we overcome this drawback by proposing an online algorithm denoted by Efficient Streaming Histogram Publishing (ESHP) to continuously publish histograms over weighted sliding windows. Specifically, our method first creates a novel sketching structure, called Approximate-Estimate Sketch (AESketch), to maintain the counting information of each histogram interval at every time instance; then, it creates histograms that satisfy the differential privacy requirement by smartly adding appropriate noise values into the sketching structure. Extensive experimental results and rigorous theoretical analysis demonstrate that the ESHP method can offer equivalent data utility with significantly lower computational overhead and storage costs when compared to other existing methods.","PeriodicalId":48690,"journal":{"name":"Tsinghua Science and Technology","volume":"29 6","pages":"1674-1693"},"PeriodicalIF":6.6,"publicationDate":"2024-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10566026","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141435222","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-06-20DOI: 10.26599/TST.2023.9010124
Libo Yang;Bin Ma;Long Yuan;Bingxiang Wu
With the development of society, the power system plays an important role in the global energy structure. However, facing increasing energy demand and environmental pressure, improving power system efficiency, reducing costs, and ensuring reliability and safety have become key issues. The Internet of Things (IoT) power electronics technology, as one of the research hotspots, integrates IoT and power electronics technology to achieve intelligent and optimized control of power systems through sensors, communication, and control technologies. In order to meet current and future needs, it is necessary to optimize the operation and management of power systems using IoT power electronics technology. By analyzing the application of Internet of Things power electronics technology and the optimal dispatch of power systems, support vector machine algorithms are used to analyze and process equipment data, and perform data monitoring and anomaly detection to promote energy waste reduction and energy saving, and then start from operation and maintenance respectively. Comparative simulation experiments were conducted in five aspects: efficiency, effectiveness of power load prediction and optimization control, effectiveness of intelligent monitoring, operating costs, and data security. The experimental results show that the operation and maintenance efficiency of the power system using IoT power electronics technology has been improved to only 18 h for equipment fault handling. The accuracy of load forecasting optimization control based on IoT power electronics technology reaches 94%. The fault detection accuracy of intelligent monitoring of power equipment based on the power electronics technology of the Internet of Things has reached 96%. At the same time, the Internet of Things power electronics technology was used to improve the power operation mode, so as to promote the monthly electricity sales revenue of 2.77 million RMB. In addition, the effectiveness of IoT power electronics technology in power data security management has reached 95%. In summary, IoT power electronics technology can improve the stability, reliability, and security of power systems, reduce costs, improve efficiency and management level, and has broad application and promotion prospects.
{"title":"Effective Application of IoT Power Electronics Technology and Power System Optimization Control","authors":"Libo Yang;Bin Ma;Long Yuan;Bingxiang Wu","doi":"10.26599/TST.2023.9010124","DOIUrl":"https://doi.org/10.26599/TST.2023.9010124","url":null,"abstract":"With the development of society, the power system plays an important role in the global energy structure. However, facing increasing energy demand and environmental pressure, improving power system efficiency, reducing costs, and ensuring reliability and safety have become key issues. The Internet of Things (IoT) power electronics technology, as one of the research hotspots, integrates IoT and power electronics technology to achieve intelligent and optimized control of power systems through sensors, communication, and control technologies. In order to meet current and future needs, it is necessary to optimize the operation and management of power systems using IoT power electronics technology. By analyzing the application of Internet of Things power electronics technology and the optimal dispatch of power systems, support vector machine algorithms are used to analyze and process equipment data, and perform data monitoring and anomaly detection to promote energy waste reduction and energy saving, and then start from operation and maintenance respectively. Comparative simulation experiments were conducted in five aspects: efficiency, effectiveness of power load prediction and optimization control, effectiveness of intelligent monitoring, operating costs, and data security. The experimental results show that the operation and maintenance efficiency of the power system using IoT power electronics technology has been improved to only 18 h for equipment fault handling. The accuracy of load forecasting optimization control based on IoT power electronics technology reaches 94%. The fault detection accuracy of intelligent monitoring of power equipment based on the power electronics technology of the Internet of Things has reached 96%. At the same time, the Internet of Things power electronics technology was used to improve the power operation mode, so as to promote the monthly electricity sales revenue of 2.77 million RMB. In addition, the effectiveness of IoT power electronics technology in power data security management has reached 95%. In summary, IoT power electronics technology can improve the stability, reliability, and security of power systems, reduce costs, improve efficiency and management level, and has broad application and promotion prospects.","PeriodicalId":48690,"journal":{"name":"Tsinghua Science and Technology","volume":"29 6","pages":"1763-1775"},"PeriodicalIF":6.6,"publicationDate":"2024-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10565997","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141435315","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
A Zero-Knowledge Proof (ZKP) protocol allows a participant to prove the knowledge of some secret without revealing any information about it. While such protocols are typically executed by computers, there exists a line of research proposing physical instances of ZKP protocols. Up to now, many card-based ZKP protocols for pen-and-pencil puzzles, like Sudoku, have been designed. Those games, mostly edited by Nikoli, have simple rules, yet designing them in card-based ZKP protocols is non-trivial. In this work, we propose a card-based ZKP protocol for Usowan, a Nikoli game. In Usowan, for each room of a puzzle instance, there is exactly one piece of false information. The goal of the game is to detect this wrong data amongst the correct data and also to satisfy the other rules. Designing a card-based ZKP protocol to deal with the property of detecting a liar has never been done. In some sense, we propose a physical ZKP for hiding of a liar. This work extends a previous paper appearing in Ref. [1]. In this extension, we propose two other protocols, for Herugolf and Five Cells. The puzzles are specifically chosen because each of those three puzzles shares a common constraint, connectivity. However, showing the connected configuration cannot be done with generic approach and brings new construction to the existing connectivity ZKP protocol. Indeed, in Herugolf, the connectivity is handled with a given length of cell which is decremental (i.e., the length of each connected cell decreases by one at each step). For Five Cells, there is an additional step in the setup allowing to encode all the information needed to ensure a valid ZKP protocol.
{"title":"ZKP Protocols for Usowan, Herugolf, and Five Cells","authors":"Daiki Miyahara;Léo Robert;Pascal Lafourcade;Takaaki Mizuki","doi":"10.26599/TST.2023.9010153","DOIUrl":"https://doi.org/10.26599/TST.2023.9010153","url":null,"abstract":"A Zero-Knowledge Proof (ZKP) protocol allows a participant to prove the knowledge of some secret without revealing any information about it. While such protocols are typically executed by computers, there exists a line of research proposing physical instances of ZKP protocols. Up to now, many card-based ZKP protocols for pen-and-pencil puzzles, like Sudoku, have been designed. Those games, mostly edited by Nikoli, have simple rules, yet designing them in card-based ZKP protocols is non-trivial. In this work, we propose a card-based ZKP protocol for Usowan, a Nikoli game. In Usowan, for each room of a puzzle instance, there is exactly one piece of false information. The goal of the game is to detect this wrong data amongst the correct data and also to satisfy the other rules. Designing a card-based ZKP protocol to deal with the property of detecting a liar has never been done. In some sense, we propose a physical ZKP for hiding of a liar. This work extends a previous paper appearing in Ref. [1]. In this extension, we propose two other protocols, for Herugolf and Five Cells. The puzzles are specifically chosen because each of those three puzzles shares a common constraint, connectivity. However, showing the connected configuration cannot be done with generic approach and brings new construction to the existing connectivity ZKP protocol. Indeed, in Herugolf, the connectivity is handled with a given length of cell which is decremental (i.e., the length of each connected cell decreases by one at each step). For Five Cells, there is an additional step in the setup allowing to encode all the information needed to ensure a valid ZKP protocol.","PeriodicalId":48690,"journal":{"name":"Tsinghua Science and Technology","volume":"29 6","pages":"1651-1666"},"PeriodicalIF":6.6,"publicationDate":"2024-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10566027","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141435250","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-06-20DOI: 10.26599/TST.2023.9010102
Nikolay Bazhenov;Manat Mustafa;Anvar Nurakunov
The theory of numberings studies uniform computations for families of mathematical objects. In this area, computability-theoretic properties of at most countable families of sets $mathcal{S}$ are typically classified via the corresponding Rogers upper semilattices. In most cases, a Rogers semilattice cannot be a lattice. Working within the framework of Formal Concept Analysis, we develop two new approaches to the classification of families $mathcal{S}$ . Similarly to the classical theory of numberings, each of the approaches assigns to a family $mathcal{S}$ its own concept lattice. The first approach captures the cardinality of a family $mathcal{S}$ : if $mathcal{S}$ contains more than 2 elements, then the corresponding concept lattice FC 1 ( $mathcal{S}$ ) is a modular lattice of height 3, such that the number of its atoms to the cardinality of $mathcal{S}$ . Our second approach gives a much richer environment. We prove that for any countable poset $P$ , there exists a family $mathcal{S}$ such that the induced concept lattice FC2 ( $mathcal{S}$ ) is isomorphic to the Dedekind-MacNeille completion of $P$ . We also establish connections with the class of enumerative lattices introduced by Hoyrup and Rojas in their studies of algorithmic randomness. We show that every lattice FC2 ( $mathcal{S}$ ) is anti-isomorphic to an enumerative lattice. In addition, every enumerative lattice is anti-isomorphic to a sublattice of the lattice FC2 ( $mathcal{S}$ ) for some family $mathcal{S}$ .
{"title":"On Concept Lattices for Numberings","authors":"Nikolay Bazhenov;Manat Mustafa;Anvar Nurakunov","doi":"10.26599/TST.2023.9010102","DOIUrl":"https://doi.org/10.26599/TST.2023.9010102","url":null,"abstract":"The theory of numberings studies uniform computations for families of mathematical objects. In this area, computability-theoretic properties of at most countable families of sets \u0000<tex>$mathcal{S}$</tex>\u0000 are typically classified via the corresponding Rogers upper semilattices. In most cases, a Rogers semilattice cannot be a lattice. Working within the framework of Formal Concept Analysis, we develop two new approaches to the classification of families \u0000<tex>$mathcal{S}$</tex>\u0000. Similarly to the classical theory of numberings, each of the approaches assigns to a family \u0000<tex>$mathcal{S}$</tex>\u0000 its own concept lattice. The first approach captures the cardinality of a family \u0000<tex>$mathcal{S}$</tex>\u0000: if \u0000<tex>$mathcal{S}$</tex>\u0000 contains more than 2 elements, then the corresponding concept lattice FC\u0000<inf>1</inf>\u0000(\u0000<tex>$mathcal{S}$</tex>\u0000) is a modular lattice of height 3, such that the number of its atoms to the cardinality of \u0000<tex>$mathcal{S}$</tex>\u0000. Our second approach gives a much richer environment. We prove that for any countable poset \u0000<tex>$P$</tex>\u0000, there exists a family \u0000<tex>$mathcal{S}$</tex>\u0000 such that the induced concept lattice FC2 (\u0000<tex>$mathcal{S}$</tex>\u0000) is isomorphic to the Dedekind-MacNeille completion of \u0000<tex>$P$</tex>\u0000. We also establish connections with the class of enumerative lattices introduced by Hoyrup and Rojas in their studies of algorithmic randomness. We show that every lattice FC2 (\u0000<tex>$mathcal{S}$</tex>\u0000) is anti-isomorphic to an enumerative lattice. In addition, every enumerative lattice is anti-isomorphic to a sublattice of the lattice FC2 (\u0000<tex>$mathcal{S}$</tex>\u0000) for some family \u0000<tex>$mathcal{S}$</tex>\u0000.","PeriodicalId":48690,"journal":{"name":"Tsinghua Science and Technology","volume":"29 6","pages":"1642-1650"},"PeriodicalIF":6.6,"publicationDate":"2024-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10566025","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141435499","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：