Fractal Uniform Circular Arrays Based Multi-Orbital-Angular-Momentum-Mode Multiplexing Vortex Radio MIMO

A radio wave driven by Orbital angular momentum(OAM) is called a vortex radio and has a helical wavefront. The differential helical wavefronts of several vortex radios are closely related to their topological charges or mode numbers. In physics, two or more radio waves with different mode numbers are orthogonal to their azimuth angles. With the development of radio communication technologies, some researchers have been exploring the OAM-based multi-mode multiplexing(multi-OAM-mode multiplexing) technologies in order to enhance the channel spectrum efficiency(SE) of a radio communication system by using the orthogonal properties of vortex radios. After reviewing the reported researches of OAM-based radio communication, we find that some breakthroughs have been made in the combination of OAM and traditional Multi-Input-Multi-Output(MIMO). However, the existing technology is not sufficient to support OAM-based MIMO system to achieve maximum the channel SE. To maximize the spectrum efficiency of OAM-based MIMO system, we present a reused multi-OAM-mode multiplexing vortex radio(RMMVR) MIMO system, which is based on fractal uniform cir-cular arrays(UCAs). The scheme described in this study can effectively combine multiOAM-mode multiplexing with MIMO spatial multiplexing. First, we present the generation of RMMVR MIMO signals. Second, under line-of-sight(LOS) propagation conditions, we derive the channels of the RMMVR MIMO system. Third, we separate the RMMVR MIMO signals using an orthogonal separation method based on full azimuth sampling. Finally, we introduce the method for calculating the channel capacity of the RMMVR MIMO system. Theoretical analysis shows that the scheme proposed in this study is feasible. Moreover, the simulation results show that spatial and mode diversity are obtained by exploiting fractal UCAs. However, to enhance the channel SE of RMMVR MIMO system, an interference cancellation method needs to be introduced for zero-mode vortex radios, and some methods of multi-OAM-mode beams convergence and mode power optimization strategy should be introduced in the future.

Exact Decoding Probability of Random Linear Network Coding for Combinatorial Networks

Combinatorial networks are widely applied in many practical scenarios. In this paper, we compute the closed-form probability expressions of successful decoding at a sink and at all sinks in the multicast scenario, in which one source sends messages to k destinations through m relays using random linear network coding over a Galois field. The formulation at a （all） sink（s） represents the impact of major parameters, i.e., the size of field, the number of relays （and sinks） and provides theoretical groundings to numerical results in the literature. Such condition maps to the receivers＇ capability to decode the original information and its mathematical characterization is helpful to design the coding. In addition, numerical results show that, under a fixed exact decoding probability, the required field size can be minimized.

ARTIFICIAL INTELLIGENCE(AI)-DRIVEN SPECTRUM MANAGEMENT

Recent advances in communication and networking technologies are leading to a plethora of novel wireless services that range from unmanned aerial vehicle(UAV)communication to smart cognitive networks and massive Internet of Things(IoT)systems.Enabling these emerging applications over the fifth generation(5G)of wireless cellular systems requires meeting numerous challenges pertaining to spectrum sharing and management.In fact,most 5G applications will be highly reliant on intelligent spectrum management techniques,which should adapt to dynamic network environments while also guaranteeing high reliability and high quality-of-experience(QoE).

Verifiable searchable symmetric encryption for conjunctive keyword queries in cloud storage

Searchable symmetric encryption(SSE)has been introduced for secure outsourcing the encrypted database to cloud storage,while maintaining searchable features.Of various SSE schemes,most of them assume the server is honest but curious,while the server may be trustless in the real world.Considering a malicious server not honestly performing the queries,verifiable SSE(VSSE)schemes are constructed to ensure the verifiability of the search results.However,existing VSSE constructions only focus on single-keyword search or incur heavy computational cost during verification.To address this challenge,we present an efficient VSSE scheme,built on OXT protocol(Cash et al.,CRYPTO 2013),for conjunctive keyword queries with sublinear search overhead.The proposed VSSE scheme is based on a privacy-preserving hash-based accumulator,by leveraging a well-established cryptographic primitive,Symmetric Hidden Vector Encryption(SHVE).Our VSSE scheme enables both correctness and completeness verifiability for the result without pairing operations,thus greatly reducing the computational cost in the verification process.Besides,the proposed VSSE scheme can still provide a proof when the search result is empty.Finally,the security analysis and experimental evaluation are given to demonstrate the security and practicality of the proposed scheme.

Factoring larger integers with fewer qubits via quantum annealing with optimized parameters

RSA cryptography is based on the difficulty of factoring large integers, which is an NP-hard(and hence intractable) problem for a classical computer. However, Shor's algorithm shows that its complexity is polynomial for a quantum computer, although technical difficulties mean that practical quantum computers that can tackle integer factorizations of meaningful size are still a long way away. Recently, Jiang et al. proposed a transformation that maps the integer factorization problem onto the quadratic unconstrained binary optimization(QUBO) model. They tested their algorithm on a D-Wave 2000 Q quantum annealing machine, raising the record for a quantum factorized integer to 376289 with only 94 qubits. In this study, we optimize the problem Hamiltonian to reduce the number of qubits involved in the final Hamiltonian while maintaining the QUBO coefficients in a reasonable range, enabling the improved algorithm to factorize larger integers with fewer qubits. Tests of our improved algorithm using D-Wave's hybrid quantum/classical simulator qbsolv confirmed that performance was improved, and we were able to factorize 1005973, a new record for quantum factorized integers, with only 89 qubits. In addition, our improved algorithm can tolerate more errors than the original one. Factoring 1005973 using Shor's algorithm would require about 41 universal qubits,which current universal quantum computers cannot reach with acceptable accuracy. In theory, the latest IBM Q System OneTM(Jan. 2019) can only factor up to 10-bit integers, while the D-Wave have a thousand-fold advantage on the factoring scale. This shows that quantum annealing machines, such as those by D-Wave, may be close to cracking practical RSA codes, while universal quantum-circuit-based computers may be many years away from attacking RSA.

Secure searchable encryption:a survey

Cloud computing facilitates convenient and on-demand network access to a centralized pool of resources.Currently,many users prefer to outsource data to the cloud in order to mitigate the burden of local storage.However,storing sensitive data on remote servers poses privacy challenges and is currently a source of concern.SE(Searchable Encryption)is a positive way to protect users sensitive data,while preserving search ability on the server side.SE allows the server to search encrypted data without leaking information in plaintext data.The two main branches of SE are SSE(Searchable Symmetric Encryption)and PEKS(Public key Encryption with Keyword Search).SSE allows only private key holders to produce ciphertexts and to create trapdoors for search,whereas PEKS enables a number of users who know the public key to produce ciphertexts but allows only the private key holder to create trapdoors.This article surveys the two main techniques of SE:SSE and PEKS.Different SE schemes are categorized and compared in terms of functionality,efficiency,and security.Moreover,we point out some valuable directions for future work on SE schemes.