IEEE Transactions on Network and Service Management最新文献_第10页

Intelligent Extra Resource Allocation for Cooperative Awareness Message Broadcasting in Cellular-V2X Networks

IF 4.7 2区计算机科学

IEEE Transactions on Network and Service Management Pub Date : 2024-11-11 DOI: 10.1109/TNSM.2024.3496394

Soyi Jung;Jae-Hyun Kim;Joongheon Kim

{"title":"Intelligent Extra Resource Allocation for Cooperative Awareness Message Broadcasting in Cellular-V2X Networks","authors":"Soyi Jung;Jae-Hyun Kim;Joongheon Kim","doi":"10.1109/TNSM.2024.3496394","DOIUrl":"https://doi.org/10.1109/TNSM.2024.3496394","url":null,"abstract":"According to recent advances in cellular vehicle-to-everything (cellular-V2X) communication networks, vehicle-to-vehicle (V2V) networks can be performed without infrastructure support. The corresponding wireless standard has been actively studied by the 3rd generation partnership project (3GPP) and has been proposed to realize V2V communications via sidelink interfaces. This standard specifically introduces cellular-V2X Mode 4, where individual vehicles access wireless resources in a distributed manner by using sensing-based semi-persistent scheduling (SPS) for avoiding collisions in cooperative awareness messages (CAMs). However, the legacy SPS scheme is able to be challenged by resource scheduling collisions, which obviously degrade performance. To tackle this problem, this paper proposes intelligent adaptive and additive extra resource allocation strategy that responds in real time to estimate traffic density fluctuations, aiming to decrease resource collisions as well as improve utilization performance. Moreover, our additional intelligent solution, which is fundamentally inspired by Lyapunov optimization-based drift-plus-penalty framework, dynamically controls the number of resources to minimize transmission outage probability subject to resource constraints. The corresponding data-intensive performance analysis results verify that the proposed algorithm is able to improve performance compared to the other benchmarks.","PeriodicalId":13423,"journal":{"name":"IEEE Transactions on Network and Service Management","volume":"22 2","pages":"1677-1689"},"PeriodicalIF":4.7,"publicationDate":"2024-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143860979","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

FeD-TST: Federated Temporal Sparse Transformers for QoS Prediction in Dynamic IoT Networks FeD-TST：用于动态物联网网络 QoS 预测的联合时空稀疏变换器

IF 4.7 2区计算机科学

IEEE Transactions on Network and Service Management Pub Date : 2024-11-07 DOI: 10.1109/TNSM.2024.3493758

Aroosa Hameed;John Violos;Nina Santi;Aris Leivadeas;Nathalie Mitton

{"title":"FeD-TST: Federated Temporal Sparse Transformers for QoS Prediction in Dynamic IoT Networks","authors":"Aroosa Hameed;John Violos;Nina Santi;Aris Leivadeas;Nathalie Mitton","doi":"10.1109/TNSM.2024.3493758","DOIUrl":"https://doi.org/10.1109/TNSM.2024.3493758","url":null,"abstract":"Internet of Things (IoT) applications generate tremendous amounts of data streams which are characterized by varying Quality of Service (QoS) indicators. These indicators need to be accurately estimated in order to appropriately schedule the computational and communication resources of the access and Edge networks. Nonetheless, such types of IoT data may be produced at irregular time instances, while suffering from varying network conditions and from the mobility patterns of the edge devices. At the same time, the multipurpose nature of IoT networks may facilitate the co-existence of diverse applications, which however may need to be analyzed separately for confidentiality reasons. Hence, in this paper, we aim to forecast time series data of key QoS metrics, such as throughput, delay, packet delivery and loss ratio, under different network configuration settings. Additionally, to secure data ownership while performing the QoS forecasting, we propose the FeDerated Temporal Sparse Transformer (FeD-TST) framework, which allows local clients to train their local models with their own QoS dataset for each network configuration; subsequently, an associated global model can be updated through the aggregation of the local models. In particular, three IoT applications are deployed in a real testbed under eight different network configurations with varying parameters including the mobility of the gateways, the transmission power and the channel frequency. The results obtained indicate that our proposed approach is more accurate than the identified state-of-the-art solutions.","PeriodicalId":13423,"journal":{"name":"IEEE Transactions on Network and Service Management","volume":"22 2","pages":"1055-1069"},"PeriodicalIF":4.7,"publicationDate":"2024-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143860835","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Adaptive Scheduling of Shared Grant-Free Resources for Heterogeneous Massive Machine Type Communication in 5G and Beyond Networks

IF 4.7 2区计算机科学

IEEE Transactions on Network and Service Management Pub Date : 2024-11-06 DOI: 10.1109/TNSM.2024.3493015

Yukti Kaura;Brejesh Lall;Ranjan K. Mallik;Amit Singhal

{"title":"Adaptive Scheduling of Shared Grant-Free Resources for Heterogeneous Massive Machine Type Communication in 5G and Beyond Networks","authors":"Yukti Kaura;Brejesh Lall;Ranjan K. Mallik;Amit Singhal","doi":"10.1109/TNSM.2024.3493015","DOIUrl":"https://doi.org/10.1109/TNSM.2024.3493015","url":null,"abstract":"Massive machine-type communication (mMTC) has been identified as a key service type in fifth-generation new radio (5G NR) communication systems. The third-generation partnership (3GPP) project, starting with 5G, has introduced grant-free (GF) or configured grant (CG) scheduling for uplink traffic with small data packets to reduce signaling and latency overheads as compared to prevalent grant-based (GB) schemes. However, when heterogeneous MTC devices compete for pre-configured, shared GF resources, the access results in collisions. No standardized methods exist for ensuring priority-based access in the shared GF scheduling scheme. In this work, we introduce novel methods which utilize both heuristic and multi-objective deep reinforcement learning (DRL) techniques for priority-enabled GF access. The proposed methods adaptively partition GF bandwidth resources per allocation interval for scheduling configured grants to heterogeneous MTC device groups in a way which improves their probability of successful transmission, thereby resulting in a lower average age of information and packet drop rate and simultaneously ensuring fairness. Through extensive simulations set in the context of cyber-physical systems (CPS) with diverse quality-of-service (QoS) requirements across various 5G NR numerology schemes, we exemplify that our proposed approach provides significantly better performance and resource utilization than conventional schemes.","PeriodicalId":13423,"journal":{"name":"IEEE Transactions on Network and Service Management","volume":"22 2","pages":"1188-1204"},"PeriodicalIF":4.7,"publicationDate":"2024-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143860850","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

A Lightweight Physical Layer Authentication-Based Blockchain Consensus Mechanism for Edge Networks

IF 4.7 2区计算机科学

IEEE Transactions on Network and Service Management Pub Date : 2024-11-06 DOI: 10.1109/TNSM.2024.3492234

C. Venkatesan;S. Jeevanantham;B. Rebekka

{"title":"A Lightweight Physical Layer Authentication-Based Blockchain Consensus Mechanism for Edge Networks","authors":"C. Venkatesan;S. Jeevanantham;B. Rebekka","doi":"10.1109/TNSM.2024.3492234","DOIUrl":"https://doi.org/10.1109/TNSM.2024.3492234","url":null,"abstract":"With the surging magnification of IoT applications, the low latency and security are the major challenges. To counteract these challenges, the integration of blockchain in edge network is mandated to offer reduced network overhead, transparency, decentralization and fault tolerance. The respective network nodes are capable of collaborating effectively through blockchain consensus mechanism. However, the major bottleneck is the complexity of consensus mechanism. Hence, to perform efficient realization of blockchain in edge network, we propose an exclusive idea of integrating Physical Layer Authentication (PLA) with consensus to put forth Proof-of-Physical-Layer-Authentication (PoPLA) consensus mechanism. Also, we propose a Byzantine Likelihood Filtering (BLF) approach to deliver Byzantine tolerance with reduced communication complexity. The experimental evaluation of PoPLA is performed on Long Range (LoRa) Wide Area Network (WAN). The PoPLA reduces the mining time by 76.25%, 42.13% and 30.05% in comparison with Proof of Work (PoW), Practical Byzantine Fault Tolerance (PBFT) and RAFT respectively. The BLF enables PoPLA to outperform PBFT by reducing communication complexity from <inline-formula> <tex-math>$O(N^{2})$ </tex-math></inline-formula> to O(N) while increasing Byzantine Fault Tolerance (BFT) level from 33% to 50% faulty nodes. The cryptanalysis showcases that the PoPLA is resistant to security attacks in blockchain network at edge.","PeriodicalId":13423,"journal":{"name":"IEEE Transactions on Network and Service Management","volume":"22 2","pages":"1594-1607"},"PeriodicalIF":4.7,"publicationDate":"2024-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143871108","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

QoE-Oriented Dependent Task Scheduling Under Multi-Dimensional QoS Constraints Over Distributed Networks

IF 4.7 2区计算机科学

IEEE Transactions on Network and Service Management Pub Date : 2024-11-05 DOI: 10.1109/TNSM.2024.3491432

Xuwei Fan;Zhipeng Cheng;Ning Chen;Lianfen Huang;Xianbin Wang

{"title":"QoE-Oriented Dependent Task Scheduling Under Multi-Dimensional QoS Constraints Over Distributed Networks","authors":"Xuwei Fan;Zhipeng Cheng;Ning Chen;Lianfen Huang;Xianbin Wang","doi":"10.1109/TNSM.2024.3491432","DOIUrl":"https://doi.org/10.1109/TNSM.2024.3491432","url":null,"abstract":"Task scheduling as an effective strategy can improve application performance on computing resource-limited devices over distributed networks. However, existing evaluation mechanisms for application completion fail to depict the complexity of diverse applications and time-varying networks, which involve dependencies among tasks, computing resource requirements, multi-dimensional quality of service (QoS) constraints, and limited contact duration among devices. Furthermore, traditional QoS-oriented task scheduling strategies struggle to meet the performance requirements without considering differences in satisfaction and acceptance of the application, leading to application failures and resource wastage. To tackle these issues, a quality of experience (QoE) cost model is designed to evaluate application completion, depicting the relationship among application satisfaction, communications, and computing resources over the time-varying distributed networks. Specifically, considering the sensitivity and preference of QoS, we model the different dimensional QoS degradation cost functions for dependent tasks, which are then integrated into the QoE cost model. Based on the QoE model, the dependent task scheduling problem is formulated as the minimization of overall QoE cost, aiming to improve the application performance over the time-varying distributed networks, which is proven Np-hard. Moreover, a heuristic Hierarchical Multi-queue Task Scheduling (HMTS) algorithm is proposed to address the QoE-oriented task scheduling problem among multiple dependent tasks, which utilizes hierarchical multiple queues to determine the optimal task execution order and location according to different dimensional QoS priorities. Finally, extensive experiments demonstrate that the proposed algorithm can significantly improve the satisfaction of applications.","PeriodicalId":13423,"journal":{"name":"IEEE Transactions on Network and Service Management","volume":"22 1","pages":"516-531"},"PeriodicalIF":4.7,"publicationDate":"2024-11-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143621964","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Unsupervised Machine Learning for Cybersecurity Anomaly Detection in Traditional and Software-Defined Networking Environments 用于传统和软件定义网络环境中网络安全异常检测的无监督机器学习

IF 4.7 2区计算机科学

IEEE Transactions on Network and Service Management Pub Date : 2024-11-04 DOI: 10.1109/TNSM.2024.3490181

Curtis Rookard;Anahita Khojandi

{"title":"Unsupervised Machine Learning for Cybersecurity Anomaly Detection in Traditional and Software-Defined Networking Environments","authors":"Curtis Rookard;Anahita Khojandi","doi":"10.1109/TNSM.2024.3490181","DOIUrl":"https://doi.org/10.1109/TNSM.2024.3490181","url":null,"abstract":"Cybersecurity has become a field of increasing importance within the past years, with the National Academy of Engineering most recently designating securing cyberspace as one of the fourteen Grand Challenges in Engineering in the 21st Century. Henceforth, it is imperative to design a robust anomaly detection and response approach that can identify and mitigate anomalous Internet traffic. In this study, we present several unsupervised/semi-supervised machine learning models to combat prolific anomalous data on a computer network. Specifically, we employ five unsupervised machine learning models, including a Generative Adversarial Network (GAN), Deep Belief Network (DBN), Restricted Boltzmann Machine (RBM), One-Class Support Vector Machine (OCSVM), and Isolation Forest (I-Forest). We use these models separately and, when applicable, combined together to examine their anomaly detection performance on three prominent traditional networking datasets, namely the KDD-Cup 99, NSL-KDD, and CIC-IDS2017 dataset, and implement these models within a software-defined networking and industrial Internet-of-Things environment using the DNP3 intrusion detection dataset. Furthermore, we investigate the generalizability of the models across the two datasets. Our results suggest I-Forest and DBN overall perform better than other models in traditional and software-defined networking environments; our GAN manages to outperform some benchmark models on the CIC-IDS2017 dataset.","PeriodicalId":13423,"journal":{"name":"IEEE Transactions on Network and Service Management","volume":"22 2","pages":"1129-1144"},"PeriodicalIF":4.7,"publicationDate":"2024-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143860851","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Interval Mean Estimation Under (ε,δ)-Local Differential Privacy

IF 4.7 2区计算机科学

IEEE Transactions on Network and Service Management Pub Date : 2024-11-04 DOI: 10.1109/TNSM.2024.3490555

Junming Zhang;Jingru Wang;Shigong Long;Yanen Li;Lun Wang

{"title":"Interval Mean Estimation Under (ε,δ)-Local Differential Privacy","authors":"Junming Zhang;Jingru Wang;Shigong Long;Yanen Li;Lun Wang","doi":"10.1109/TNSM.2024.3490555","DOIUrl":"https://doi.org/10.1109/TNSM.2024.3490555","url":null,"abstract":"Local differential privacy (LDP) techniques obviate the need for trust in the data collector, as they provide robust privacy guarantees against untrusted data managers while simultaneously preserving the accuracy of statistical information derived from the privatized data. As a result, these methods have garnered considerable interest and research efforts. In particular, <inline-formula> <tex-math>$(varepsilon,delta)$ </tex-math></inline-formula>-LDP schemes have been utilized across a range of statistical tasks. Nonetheless, existing <inline-formula> <tex-math>$(varepsilon,delta)$ </tex-math></inline-formula>-LDP mechanisms for mean estimation suffer from challenges such as elevated estimation errors and diminished data utility. To address this problem, we propose two novel <inline-formula> <tex-math>$(varepsilon,delta)$ </tex-math></inline-formula>-LDP algorithms for mean estimation. Specifically, we design a one-dimensional piecewise mean estimation algorithm, which perturbs the input data into intervals, thereby reducing noise addition and enhancing both accuracy and efficiency. Building on this foundation, we extend our approach to multi-dimensional data, resulting in a multi-dimensional piecewise mean estimation algorithm. Furthermore, we conduct a theoretical analysis to derive both the variance and error bounds for the proposed algorithms. Extensive experiments conducted on real datasets demonstrate the high practicality of our algorithms for data statistical tasks, showing significant improvements in data utility.","PeriodicalId":13423,"journal":{"name":"IEEE Transactions on Network and Service Management","volume":"22 2","pages":"2074-2086"},"PeriodicalIF":4.7,"publicationDate":"2024-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143860834","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Constellation Configuration Optimization Method for User Distribution Characteristics of LEO Satellite Networks

IF 4.7 2区计算机科学

IEEE Transactions on Network and Service Management Pub Date : 2024-11-04 DOI: 10.1109/TNSM.2024.3489625

Meng Sun;Tao Zhang;Liang Liu

{"title":"Constellation Configuration Optimization Method for User Distribution Characteristics of LEO Satellite Networks","authors":"Meng Sun;Tao Zhang;Liang Liu","doi":"10.1109/TNSM.2024.3489625","DOIUrl":"https://doi.org/10.1109/TNSM.2024.3489625","url":null,"abstract":"Low-Earth-Orbit (LEO) satellite networks are a hotspot in the communication industry as they can provide global high-capacity and low-latency communication services. However, the constellation system’s high construction cost and limited resources like computation and storage, coupled with the uneven distribution of ground communication users, make it essential to optimize the constellation configuration to match the uneven communication needs of different regions. This paper focuses on the Walker-Delta configuration constellation and uses a global approximate equal-area partition method to establish the terrestrial communication population distribution model. A constellation configuration optimization method is proposed to match the uneven distribution of global communication users. This paper mathematically characterizes the relationship between the change rule of the constellation’s coverage with latitude and the orbital parameters to obtain the model of the visible satellite number for ground users at any latitude under any constellation configuration. The terrestrial communication population distribution model is constructed based on global population data, and the Spearman correlation coefficient (SCC) is used to measure the match between the constellation coverage performance and the global communication user distribution. With the constellation coverage model, this paper optimizes the constellation configuration. Compared with the core layer of Starlink phase I, the SCC of the optimized constellation proposed in this paper is improved by 29.5%. A program simulation is carried out, and the results indicate that the network access capacity of the optimized constellation is improved by 12.6% compared to the Starlink phase I. The load balancing degree is improved by 25.9%, and the packet loss rate is reduced by 66.6%.","PeriodicalId":13423,"journal":{"name":"IEEE Transactions on Network and Service Management","volume":"22 2","pages":"1232-1246"},"PeriodicalIF":4.7,"publicationDate":"2024-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143860778","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Performance Modeling of IoT-Cloud Gateway Under Diverse Traffic Characteristics

IF 4.7 2区计算机科学

IEEE Transactions on Network and Service Management Pub Date : 2024-11-04 DOI: 10.1109/TNSM.2024.3489598

Shachi Sharma;Prakash Datt Bhatt

{"title":"Performance Modeling of IoT-Cloud Gateway Under Diverse Traffic Characteristics","authors":"Shachi Sharma;Prakash Datt Bhatt","doi":"10.1109/TNSM.2024.3489598","DOIUrl":"https://doi.org/10.1109/TNSM.2024.3489598","url":null,"abstract":"The presence of diverse traffic types is well-established in IoT networks. Various probability distributions have been found to describe packets inter-arrival time contrasting with the familiar exponential distribution in traditional networks. These findings suggest the need to develop appropriate traffic models for performance analysis of IoT network systems. An essential component in IoT network is gateway as it provides connectivity to the core Internet. The IoT gateway also performs functions such as protocol translation and traffic aggregation. Therefore, efficient design of the IoT gateway is necessary for better network management. The paper presents a new analytical model, N-Gamma/M/1, for analyzing the performance of IoT gateway. The equivalence of N-Gamma/M/1 and Gamma/M/1 models is proved mathematically. Additionally, an in-depth performance evaluation of the IoT gateway under various arrival patterns is conducted through simulation. The numerical analysis of the proposed N-Gamma/M/1 model emphasizes the need for more buffers at the gateway when traffic from input devices has varying values of gamma distribution parameters. It is also noted that the IoT gateway experiences a longer mean queue length resulting in higher mean waiting time and packet loss when inter-arrival time distribution of packets follows generalized Pareto, Weibull and lognormal distributions with different parameter values. This makes the task of IoT network management challenging. Adaptive and intelligent resource allocation policies along with dynamic congestion control algorithms may provide a solution to minimize packet loss and ensure quality of service.","PeriodicalId":13423,"journal":{"name":"IEEE Transactions on Network and Service Management","volume":"22 1","pages":"691-701"},"PeriodicalIF":4.7,"publicationDate":"2024-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143621595","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

FHE-Based Publicly Verifiable Sealed-Bid Auction Protocol Atop Cross-Blockchain

IF 4.7 2区计算机科学

IEEE Transactions on Network and Service Management Pub Date : 2024-10-30 DOI: 10.1109/TNSM.2024.3488090

Bo Yang;Liquan Chen;Jiaorui Shen;Huaqun Wang;Yang Ma

{"title":"FHE-Based Publicly Verifiable Sealed-Bid Auction Protocol Atop Cross-Blockchain","authors":"Bo Yang;Liquan Chen;Jiaorui Shen;Huaqun Wang;Yang Ma","doi":"10.1109/TNSM.2024.3488090","DOIUrl":"https://doi.org/10.1109/TNSM.2024.3488090","url":null,"abstract":"Online auctions, which are widely used on Internet advertising platforms, reduce the participation costs for buyers and sellers, and promote the flow of tens of billions of dollars in the global economy. However, Internet advertising platforms tend to be monopolistic and adopt a sealed bidding model. Therefore, when price is the sole determinant of the winner, how to publicly verify the correctness of auction results without disclosing bidding information has become a challenge. To address these issues, we propose a fully homomorphic encryption (FHE)-based sealed-bid auction protocol with public verifiability atop cross-blockchain. Through an approximate comparison algorithm, the proof of the winner consists of <inline-formula> <tex-math>${m} ,, -1$ </tex-math></inline-formula> (or 1) homomorphic ciphertexts, significantly reducing communication costs, where m represents the number of bidders. Thus, anyone can check the winner’s proof and complete the public verification of correctness. Moreover, this paper designs a cross-blockchain auction system model, breaking the monopoly of platforms, and proposes a distributed private key sharing method, which realizes the auditing function of the relay chain. Finally, we formalize the security model, and verify the correctness, public verifiability and privacy of our scheme. The off-chain time overhead and on-chain gas consumption demonstrate the strong practicability of our protocol in large-scale auctions.","PeriodicalId":13423,"journal":{"name":"IEEE Transactions on Network and Service Management","volume":"22 1","pages":"832-845"},"PeriodicalIF":4.7,"publicationDate":"2024-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143621752","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0