Please wait a minute...

Journal of Beijing University of Posts and Telecommunications

  • EI核心期刊

Current Issue

    • A Survey of Random Oracle Model against Quantum Adversary
    • Journal of Beijing University of Posts and Telecommunications. 2024, 47(6): 1-10.
    • Abstract ( 133 )       
    • To investigate the security of cryptographic protocols against quantum adversary, researchers have extended classical random oracle models with the help of post-quantum cryptography and quantum cryptography into the quantum random oracle models. This paper summarizes the research progress across various random oracle models, categorizing their concepts, instantiation methods, and security proof techniques to systematically review random oracle models against quantum adversaries. It also offered security analyses of cryptographic protocols under different quantum random oracle models. A comparative study of quantum-accessible random oracle model, quantum random oracle model, and classical random oracle model is carried out to clarify the differences and relationships between various random oracle models. Furthermore, the paper points out future research directions and trends with the goal to address the threats posed by quantum computing.

    • Supplementary Material | Related Articles
    • Experimental System Research on Superconducting Qubits Based on Josephson Junctions
    • Journal of Beijing University of Posts and Telecommunications. 2024, 47(6): 11-17.
    • Abstract ( 203 )       
    • A single-chain twenty-qubit quantum chip was designedWe design a single chain twenty qubits chip by using frequency adjustable transmon structure. We performed basic characterization experiments on all qubits using a customized low-temperature environment control system and low-temperature coaxial cable components, which have attained chieving a maximum energy decoherence time T1 of 31.3 μs and a phase decoherence time T2* of 22.8 μs among all qubits. An average fidelity of 99.85% for of single-qubit gates was gained as determined by random benchmark testing. The two-qubit Controlled-ZZ gate calibration was also achieved, with a fidelity of 97.5% measured through quantum process tomography. Finally, we demonstrated a quantum dynamics simulation algorithm based on the operation of single-qubits gates and double-qubits gates, successfully observing the dynamical evolution of the Ising model.
    • Supplementary Material | Related Articles
    • Research Progress in Semi-Quantum Cryptographic Protocols
    • Journal of Beijing University of Posts and Telecommunications. 2024, 47(6): 18-23.
    • Abstract ( 137 )       
    • Quantum cryptography leverages physical principles such as quantum superposition and entanglement to achieve security levels beyond classical cryptography, attracting significant attention across various fields. Semi-quantum cryptography requires only one user to possess full quantum capability, while others need only perform basic quantum operations, reducing reliance on complex quantum devices for most users. This approach holds substantial research value and significance in theoretical exploration and practical applications. In order to realize the design of quantum cryptographic protocols with limited quantum resources, this study focuses on the development of semi-quantum cryptography, systematically reviewing the progress of semi-quantum key distribution, semi-quantum secure direct communication, semi-quantum secret sharing, semi-quantum privacy comparison, and semi-quantum secure multi-party summation. Furthermore, some open issues and future research directions in semi-quantum cryptographic protocols are discussed, aiming to provide references for scholars engaged in related research and promote the development and innovation of this field.
    • Supplementary Material | Related Articles
    • Mode-Pairing Quantum Key Distribution Protocol Based on Heralded Pair-Coherent Source
    • Journal of Beijing University of Posts and Telecommunications. 2024, 47(6): 24-29.
    • Abstract ( 116 )       
    • The key rate of mode-pairing quantum key distribution is limited because of using weak coherent sources as signal light sources, characterized by a limited single photon component. To address this problem, mode-pairing quantum key distribution based on heralded pair-coherent source is proposed, the heralded pair-coherent source is used as the signal light source in mode-pairing quantum key distribution. Due to the higher proportion of single photons in the heralded pair-coherent source, the performance of mode-pairing quantum key distribution is significantly improved. The numerical simulation is carried out in the cases of asymptotic and infinite decoy states. The result shows that the proposed protocol outperforms the mode-pairing quantum key distribution based on the weak coherent source, achieving not only a higher key rate but also a longer communication distance. The proposed protocol demonstrates a significant advantage in terms of the key rate when the transmission distance exceeds 400 km.
    • Supplementary Material | Related Articles
    • A Superdense Coding Quantum Voting Protocol Based on Three-Particle Entangled States
    • Journal of Beijing University of Posts and Telecommunications. 2024, 47(6): 30-37.
    • Abstract ( 84 )       
    • In order to achieve secure quantum voting, a novel superdense coding quantum voting protocol is proposed, which is based on three-particle entangled states and aims to ensure the legitimacy, anonymity, verifiability, and irreducibility of the voting process. This protocol utilizes three-particle entangled states as quantum resources, requiring only single-particle operations and Bell-basis measurements, making it easy to utilize existing quantum information processing technologies to achieve efficient quantum voting. Finally, simulation experiments were conducted by using IBM’s Quantum Computing Software Development Kit to verify the feasibility of the proposed protocol.
    • Supplementary Material | Related Articles
    • Application of Quantum Approximate Optimization Algorithm in Network Coverage and Capacity Optimization
    • Journal of Beijing University of Posts and Telecommunications. 2024, 47(6): 38-43.
    • Abstract ( 128 )       
    • Wireless Network coverage and capacity optimization are typically multivariable combinatorial optimization problems, and traditional exact or heuristic methods are often constrained by time complexity or accuracy during the solving process. To address this issue, a solution is proposed using the Quantum Approximate Optimization Algorithm. The network coverage and capacity optimization problem are first transformed into the maximum independent set problem, and a mathematical model is constructed to encode the true solution of the maximum independent set problem into the ground state of a target Hamiltonian. A parameterized quantum circuit is then used to approximately obtain the target ground state. Simulation results demonstrate that solving the maximum independent set problem using quantum approximate optimization algorithm yields an exact or quasi-optimal solution within the number of polynomial iteration steps, showcasing quantum advantage.
    • Supplementary Material | Related Articles
    • Quantum Algorithms for Finding Linear Structures of Vector-valued Functions
    • Journal of Beijing University of Posts and Telecommunications. 2024, 47(6): 44-49.
    • Abstract ( 97 )       
    • To solve the generalized Bernstein-Vazirani algorithm for the linear structure of  vector-valued functions, this paper studied the feasibility of using the Bernstein-Vazirani algorithm to solve such quantum algorithms. Firstly, according to the characteristics of single period and single coset, the correctness of solving the original Simon’s problem by applying the Bernstein-Vazirani algorithm is re-proved. Secondly, extended Simon’s problems such as multiple weak periods and multiple cosets are analyzed, and the feasibility of using the Bernstein-Vazirani algorithm to solve the extended Simon’s problems is proved. Finally, it is demonstrated that by the Bernstein-Vazirani algorithm, it is possible with great probability to determine whether there is a linear structure for a vector-valued function.
    • Supplementary Material | Related Articles
    • Secure Two-Party Line Segment Intersection Protocol Based on Quantum Homomorphic Encryption
    • Journal of Beijing University of Posts and Telecommunications. 2024, 47(6): 50-56.
    • Abstract ( 21 )       
    • The secure two-party line segment intersection is an important branch of computational geometry in multi-party safe computation, with high research and practical value as it can be extended to applications such as privacy computation for polygon area and convex hull intersection. In classical computation, various solutions have been proposed based on the principles of computational complexity, yet they are unable to withstand potential quantum attacks in the future. To address the issue, a secure two-party line segment intersection protocol based on quantum homomorphic encryption is proposed. In this protocol, the computation process is completed by a semi-trusted third-party computing center. Throughout the entire protocol, the privacy of the two-party line segments is protected. Finally, the protocol was applied to specific instances and security analysis was conducted against external and internal attacks. Experimental results demonstrated the security and reliability of the protocol.
    • Supplementary Material | Related Articles
    • Target Localization Based on Quantum Illumination and Its Performance Analysis
    • Journal of Beijing University of Posts and Telecommunications. 2024, 47(6): 57-62.
    • Abstract ( 101 )       
    • To solve the challenges of passive target detection and nagivation localization with enhanced precision and multi-dimensionality, this study constructed a single-station quantum illumination model that employs quantum squeezing and entanglement-sensing devices for time delay and azimuth angles. An in-deep investigation has been conducted into the estimation methods for precise time delay and azimuth angle measurement of quantum illumination signals, and the potential of quantum positioning based on time-differences and azimuth observations has been explored. Taking the task of planar target localization of a LiDAR system as an example, we investigate the influence of transmission coefficient and squeezing factor on spatial target localization accuracy. The results reveal the quantum superiority in target spatial localization tasks.
    • Supplementary Material | Related Articles
    • Quantum Sealed-Bid Auction Protocol Based on Homomorphic Message Authentication
    • Journal of Beijing University of Posts and Telecommunications. 2024, 47(6): 63-68.
    • Abstract ( 108 )       
    • During the sealed auction process, collusion attacks are prone to occur, and the privacy information of bidders needs to be protected. To address this issue, a quantum sealed-bid auction protocol based on quantum homomorphic message authentication is proposed. This protocol introduces a semi-honest third party with certain malicious behavior as the intermediary and verifier, which is responsible not only for transmitting information between the bidders and the auctioneer, but also for verifying the auction results to ensure fairness and impartiality. In the protocol, before sending a bid, the bidder needs to first send the encrypted bid commitment to the third party, which will process it and then send it to the auctioneer. The auctioneer who receives the information will verify the identities of the bidders, confirm the source of the information, decrypt the information, and finally use the results to determine whether someone has tampered with the bid during the process. The experimental results reveal that the application of quantum homomorphic message authentication scheme and the introduction of a semi-honest third party in the auction process can not only avoid collusive attacks, but also effectively protect the privacy of bidders.
    • Supplementary Material | Related Articles
    • Low Earth Orbit Satellite Internet: from Satellite-Ground Convergence to Communication, Navigation and Sensing Integration
    • Journal of Beijing University of Posts and Telecommunications. 2024, 47(6): 69-98.
    • Abstract ( 611 )       
    • Leveraging vast orbital resources and reduced satellite manufacturing and launch costs, the low-orbit satellite Internet has entered a stage of vibrant development, In this paper, centered on the two important trends of satellite-terrestrial convergence and the integration of communication, navigation and remote sensing, we propose a satellite-terrestrial converged network architecture from the perspectives of access, transport , and core networks. Subsequently, we carefully analyze solutions of direct-to-handset satellite communication or typical applications of space-ground convergence, and put forth the pivotal technologies for direct-to-handset satellite communications towards the 6th generation of mobile communication network. Finally, a comprehensive discussion on the network architecture, key technologies, and potential application scenarios regarding with the integration of low-orbit satellite communication, navigation, and remote sensing is presented.
    • Supplementary Material | Related Articles
    • OTSM Time-Frequency Synchronization Algorithm for LEO Satellite Communications
    • Journal of Beijing University of Posts and Telecommunications. 2024, 47(6): 99-104.
    • Abstract ( 164 )       
    • In order to address with the complex channel environment in low earth orbit satellite communication networks and eliminate the interference caused by time offset and carrier frequency offset, a time-frequency synchronization algorithm oriented to orthogonal time sequence multiplexing (OTSM) modulation technology is proposed. The time synchronization algorithm based on two-dimensional search uses the periodicity of the pilot signal in the delay-time domain to search pilot sequence in the delay and time dimensions to estimate the time offset of the received signal. The frequency synchronization algorithm based on the two-dimensional correlation function estimates the carrier frequency offset of the received signal by calculating the phase of the two-dimensional correlation function value of the pilot sequence. The simulation results show that the proposed time-frequency synchronization algorithm achieves good bit error rate performance in the satellite-ground scenario.
    • Supplementary Material | Related Articles
    • QoS Balancing and Interference Suppression for LEO Beam-hopping Satellite Networks
    • Journal of Beijing University of Posts and Telecommunications. 2024, 47(6): 105-110.
    • Abstract ( 168 )       
    • To address the problems of quality of service imbalance and inter-satellite interference, a low earth orbit beam-hopping satellite network is proposed, it can enhance the quality of service through inter-satellite quality of service balancing and interference suppression. Cells with different types of services have varying priority levels, and each cell should be allocated at least one-time slot in a beam-hopping time window. Therefore, a cell quality equalization algorithm to cluster inter-satellite cells is proposed. Since multiple satellites share the spectrum, severe inter-satellite interference diminishes cells' quality of service. Therefore, a dynamic interference suppression algorithm is introduced. Simulation results show that compared to the maximum elevation angle algorithm, the cell quality equalization algorithm reduces the inter-satellite quality of service disparity by 70% and achieves quality of service balancing. Compared to scenarios without interference suppression, the dynamic interference suppression algorithm ensures that the inter-satellite interference is always below the interference threshold, therefore improving the quality of service levels.
    • Supplementary Material | Related Articles
    • A Lightweight and Controllable Routing Mechanism for Satellite Network
    • Journal of Beijing University of Posts and Telecommunications. 2024, 47(6): 111-117.
    • Abstract ( 77 )       
    • In order to carry highly reliable and low-latency industrial control business flows on resource-constrained and weak-performance satellite networks, an "avoidance" lightweight and highly controllable intersatellite segment routing selection mechanism called avoidance segment routing is proposed. This mechanism uses snapshots or intersatellite routing protocols to obtain entire network topology information and calculates the high-priority path according to the distribution characteristics of risk nodes in shortest first paths. Finally, segment routing technology over IPv6 is used to accurately specify the path. In view of the limited intersatellite bandwidth, a lightweight segment routing header compression algorithm adapted to different topological characteristics is also proposed. By performing binary comparison with the original SPF path and expanding the search range of the connected path, a simpler node stack is achieved. Experimental results show that the average compression rate of SRH of AVSR can reach 55%, with memory overhead below 3.5MB.
    • Supplementary Material | Related Articles
    • A Low-Overhead User Location Management Scheme in Low Earth Orbit Satellite Networks
    • Journal of Beijing University of Posts and Telecommunications. 2024, 47(6): 118-124.
    • Abstract ( 22 )       
    • To reduce the signalling overhead of location management caused by the dual mobility of satellite beam cells and users in low earth orbit satellite networks, a user location management scheme based on an earth-fixed tracking area list is designed. By utilizing the Markov chain to analyze the user location management states and by introducing stochastic geometry theory to estimate the number of paging satellites, a closed-form solution for the signalling overhead of location management in low earth orbit satellite networks is derived. Simulation results show that the proposed location management scheme reduces the overall signalling overhead by 93% compared to the mobile tracking area-based location management method, by 78% compared to movement threshold-based location management method, respectively, with an estimation error for signalling overhead below 1%.
    • Supplementary Material | Related Articles