Nearly universal and efficient quantum secure multi-party computation protocol

Universality is an important property in software and hardware design. This paper concentrates on the universality of quantum secure multi-party computation (SMC) protocol. First of all, an in-depth study of universality has been onducted, and then a nearly universal protocol is proposed by using the Greenberger-Horne-Zeilinger (GHZ)-like state and stabilizer formalism. The protocol can resolve the quantum SMC problem which can be deduced as modulo subtraction, and the steps are simple and effective. Secondly, three quantum SMC protocols based on the proposed universal protocol: Quantum private comparison (QPC) protocol, quantum millionaire (QM) protocol, and quantum multi-party summation (QMS) protocol are presented. These protocols are given as examples to explain universality. Thirdly, analyses of the example protocols are shown. Concretely, the correctness, fairness, and efficiency are confirmed. And the proposed universal protocol meets security from the perspective of preventing inside attacks and outside attacks. Finally, the experimental results of the example protocols on the International Business Machines (IBM) quantum platform are consistent with the theoretical results. Our research indicates that our protocol is universal to a certain degree and easy to perform.     

LB-AGR: level-based adaptive geo-routing for underwater sensor network简

Underwater sensor network（UWSN） adopts acoustic communication with more energy-consumption and longer propagation-delay, which bring great challenges to protocol design. In this paper, we proposed level-based adaptive geo-routing（LB-AGR） protocol. LB-AGR divides traffics into four categories, and routes different types of traffic in accordance with different decisions. Packets upstream to the sink are forwarded unicast to the best next-hop instead of broadcasting to all neighbor nodes as in present UWSN routing protocols. LB-AGR defines an integrated forwarding factor for each candidate node based on available energy, density, location, and level-difference between neighbor nodes, which is used to determine the best next-hop among multiple qualified candidates. Through simulation experiments, we show the promising performance of LB-AGR.     

Semi-quantum protocol for cardinalities of private setintersection and union based on GHZ states

In modern society, it is necessary to perform some secure computations for private sets between different entities. For instance, two merchants desire to calculate the number of common customers and the total number of users without disclosing their own privacy. In order to solve the referred problem, a semi-quantum protocol for private computation of cardinalities of set based on Greenberger-Horne-Zeilinger (GHZ) states is proposed for the first time in this paper, where all the parties just perform single-particle measurement if necessary. With the assistance of semi-honest third party (TP), two semi-quantum participants can simultaneously obtain intersection cardinality and union cardinality. Furthermore, security analysis shows that the presented protocol can stand against some well-known quantum attacks, such as intercept measure resend attack, entangle measure attack. Compared with the existing quantum protocols of Private Set Intersection Cardinality (PSI-CA) and Private Set Union Cardinality (PSU-CA), the complicated oracle operations and powerful quantum capacities are not required in the proposed protocol. Therefore, it seems more appropriate to implement this protocol with current technology.     

A new privacy-preserving Euclid-distance protocol and its applications in WSNs

Recently, privacy concerns become an increasingly critical issue. Secure multi-party computation plays an important role in privacy-preserving. Secure multi-party computational geometry is a new field of secure multi-party computation. In this paper, we devote to investigating the solutions to some secure geometric problems in a cooperative environment. The problem is collaboratively computing the Euclid-distance between two private vectors without disclosing the private input to each other. A general privacy-preserving Euclid-distance protocol is firstly presented as a building block and is proved to be secure and efficient in the comparison with the previous methods. And we proposed a new protocol for the application in Wireless Sensor Networks (WSNs), based on the novel Euclid-distance protocol and Density-Based Clustering Protocol (DBCP), so that the nodes from two sides can compute cooperatively to divide them into clusters without disclosing their location information to the opposite side.     

Identifying file-sharing P2P traffic based on traffic characteristics

This article focuses on identifying file-sharing peer-to-peer （P2P） （such as BitTorrent （BT）） traffic at the borders of a stub network. By analyzing protocols and traffic of applications, it is found that file-sharing P2P traffic of a single user differs greatly from traditional and other P2P （such as QQ） applications＇ traffic in the distribution of involved remote hosts and remote ports. Therefore, a method based on discreteness of remote hosts （RHD） and discreteness of remote ports （RPD） is proposed to identify BT-like traffic. This method only relies on flow information of each user host in a stub network, and no packet payload needs to be monitored. At intervals, instant RHD for concurrent transmission control protocol and user datagram protocol flows for each host are calculated respectively through grouping flows by the stub network that the remote host of each flow belongs to. On given conditions, instant RPD are calculated through grouping flows by the remote port to amend instant RHD. Whether a host has been using a BT-like application or not can be deduced from instant RHD or average RHD for a period of time. The proposed method based on traffic characteristics is more suitable for identifying protean file-sharing P2P traffic than content-based methods Experimental results show that this method is effective with high accuracy.     

Data-flow in mobile edge computing networks: end-to-end performance analysis using stochastic network calculus

Mobile edge computing (MEC) networks can provide a variety of services for different applications. End-to-end performance analysis of these services serves as a benchmark for the efficient planning of network resource allocation and routing strategies. In this paper, a performance analysis framework is proposed for the end-to-end data-flows in MEC networks based on stochastic network calculus (SNC). Due to the random nature of routing in MEC networks, probability parameters are introduced in the proposed analysis model to characterize this randomness into the derived expressions. Taking actual communication scenarios into consideration, the end-to-end performance of three network data-flows is analyzed, namely, voice over Internet protocol (VoIP), video, and file transfer protocol (FTP). These network data-flows adopt the preemptive priority scheduling scheme. Based on the arrival processes of these three data-flows, the effect of interference on their performances and the service capacity of each node in the MEC networks, closed-form expressions are derived for showing the relationship between delay, backlog upper bounds, and violation probability of the data-flows. Analytical and simulation results show that delay and backlog performances of the data-flows are influenced by the number of hops in the network and the random probability parameters of interference-flow (IF).     

Interleaving scheme for multicarrier CDMA system

In MultiCarrier Code-Division Multiple-Access (MC-CDMA) system,the received signals scattered in the frequency domain are combined to get frequency diversity gain.However,the frequency diversity gain is limited because of correlation between subcarriers.A novel interleaving scheme for MC-CDMA system is proposed in this paper.A circular shifting register is introduced into each subcarrier branch to decrease the correlation between subcarriers.By using interleaving,frequency diversity gain of system is increased.System structure and model with interleaver are discussed.In the case of multiple users,Parallel Interference Cancellation (PIC) technique is also introduced.Computer simulations demonstrate the performance of proposed scheme,and the performance comparison of MC-CDMA with interleaver and conventional MC-CDMA system is shown as well.     

An Arrangement of Channels and Transceivers in Optical Packet Switching Networks

Based on a media access and control（MAC）protocol,an arrangement of channels and transceivers in optical packet switching dense wavelength division multiplexing（DWDM）networks is proposed in this paper.In order to reduce the cost of nodes,fixed transmitters and receivers are used instead of tunable transmitters and receivers.Two fixed transmitters and many fixed receivers are used in each node in the scheme.The average waiting delay of this scheme is analyzed through mathematics and computer simulation.The result shows that the property of the scheme is almost the same as using tunable transmitter and receiver.Furthermore,if the tuning time of tunable transmitters is taken into account,the performance of the tunable transmitter scheme is poor than this scheme at the average waiting delay and throughput of the network.     

Network Protocol Recognition Based on Convolutional Neural Network

How to correctly acquire the appropriate features is a primary problem in network protocol recognition field.Aiming to avoid the trouble of artificially extracting features in traditional methods and improve recognition accuracy,a network protocol recognition method based on Convolutional Neural Network(CNN)is proposed.The method utilizes deep learning technique,and it processes network flows automatically.Firstly,normalization is performed on the intercepted network flows and they are mapped into two-dimensional matrix which will be used as the input of CNN.Then,an improved classification model named Ptr CNN is built,which can automatically extract the appropriate features of network protocols.Finally,the classification model is trained to recognize the network protocols.The proposed approach is compared with several machine learning methods.Experimental results show that the tailored CNN can not only improve protocol recognition accuracy but also ensure the fast convergence of classification model and reduce the classification time.     

Improved Clustering and Resource Allocation for Ultra-Dense Networks

To reduce the interference among small cells of Ultra-Dense Networks(UDN),an improved Clustering-Assisted Resource Allocation(CARA)scheme is proposed in this paper.The proposed scheme is divided into three steps.First,an Interference-Limited Clustering Algorithm(ILCA)based on interference graph corresponding to the interference relationship between Femtocell Base Stations(FBSs),is proposed to group FBSs into disjoint clusters,in which a pre-threshold is set to constrain the sum of interference in each cluster,and a Cluster Head(CH)is selected for each cluster.Then,CH performs a twostage sub-channel allocation within its associated cluster,where the first stage assigns one sub-channel to each user of the cluster and the second stage assigns a second sub-channel to some users.Finally,a power allocation method is designed to maximize throughput for a given clustering and sub-channel configuration.Simulation results indicate that the proposed scheme distributes FBSs into each cluster more evenly,and significantly improves the system throughput compared with the existing schemes in the same scenario.     

软交换机的关键技术研究与设计

探讨了软交换中多协议导致的复杂性,研究了协议组内及协议组间的协议关系处理,设计了通用PDU,考虑了软交换的可扩展性,可用性方面的问题.借鉴SIP-T协议的机制,在通用PDU中广泛采用信息翻译和信息封装共存的方式,实现了系统的高效性和信息的完整性.揭示了协议关系分类和协议分组对软交换设计的必要性和有效性.最后利用UML对软交换进行了设计.     

软交换下用于协议适配的统一消息的设计

软交换是一代网络的核心,协议适配是软交换的重要功能,下一代网络的重要目标之一就是实现网络融合。在分析软交换体系结构的基础上,提出软交换中协议适配的方法,设计了一个适用于目前网络上存在的所有呼叫控制协议的统一格式消息集,并描述了消息的结构,讨论了统一格式消息与SIP和ISUP之间的映射流程。以该方法为基础所实现的软交换具有较高的性能和可扩展性。     

基于ZXSS10 SS1b软交换的SIP终端会话设计

软交换技术是现代交换技术中一个重要的分支,其开放的体系结构支持多种信令协议,而SIP协议是其中重要协议之一,主要用于实现实时会话通信。通过对软交换体系结构的介绍以及软交换中SIP协议的应用分析,利用中兴公司的ZXSS10 SS1b软交换控制设备实现了在实验室条件下的SIP终端会话设计,给出了具体的设计过程及实验结果,为高校通信与电子信息类专业建设现代通信实验室、开设相关实验提供了有效方案。     

一种基于HIT-TENA的资源快速接入工具

针对目前国内靶场各试验设备存在的重用性和互操作性差、资源接入困难等问题,设计了一种基于HIT-TENA的资源快速接入工具,实现资源设备的标准化快速接入。通过对靶场领域现有设备常用接口协议的分析,设计了一种通用的协议模板实现对各种接口协议的描述,在此基础上提出了协议数据到对象模型的转换方法。在HIT-TENA体系结构下,开发了通用协议转换组件,实现了外部设备到HIT-TENA的快速接入,对于加速试验系统构建速度、提高试验系统可靠性具有重要意义。     

飞信协议识别与多元通联关系提取方法

针对飞信协议尚未公开与复杂互联网环境带来的飞信各类应用相关协议识别困难以及单包通联关系缺失等问题,基于SIP协议的基本框架,从文本聊天、文件传输以及音/视频通信三方面解析了飞信常用业务的协议交互过程;提出了端口与正则表达式相结合的飞信协议识别方法和基于会话还原的飞信通联关系提取方法,能够从大量混杂的数据包中快速定位飞信业务报文,获得飞信多种通信行为的通联关系。实验结果证明了本文方法的有效性。     

基于软交换技术的计费系统的设计与实现

软交换是下一代网络中的核心设备,首先介绍了软交换计费的功能要求,然后提出了一个软交换计费系统的模型,此模型主要采取RADIUS协议进行认证计费,介绍了RADIUS协议的数据包格式、认证流程以及他在软交换环境中的工作流程。介绍了此计费系统的设计方法,详细介绍了软交换平台和软电话的设计、RADIUS服务器的设计和数据库的设计。最后对软交换平台的软件实现、数据库的实现、RADIUS服务器的实现进行了详细介绍。     

软交换技术浅析

网络结构及其协议是最为重要的组网技术，软交换网络结构的重要特点是其明确的功能分层。本文给出了软交换网络的分层结构。并介绍了软交换的核心协议。     

Attacks and improvements on the RFID authentication protocols based on matrix

Most of the Radio Frequency IDentification (RFID) authentication protocols, proposed to preserve security and privacy, are analysed to show that they can not provide security against some passive or active attacks. In this paper, the security of two matrix-based protocols, proposed by Karthikeyan and Nesterenko (KN protocol) and Ramachandra et al. (RRS protocol) that conform to Electronic Product Code Class-1 Generation-2 (EPC Class-1 Gen-2) standard, are investigated. Using the linear relationship of multiplication of matrix and vector, we point out that both protocols can not provide scalability, and they are vulnerable to passive impersonation attack. In addition, both protocols are totally insecure if the adversary can compromise one tag to extract the secrets. A modified lightweight matrix-based authentication protocol is presented, which can resist mainly common attacks on an RFID authentication system including eavesdropping, relay attack, desynchronization attack, impersonation attack and tag tracking attack. The new protocol also has the desirable scalability property and can keep secure under compromising attack.     

下一代网络中的软交换技术

随着社会信息化程度进一步深入,一种比现有通信网络性能更优越的称之为下一代网络(NGN)的新型电信网络开始进入人们视野,随着其商用进程的加快,已成为近年来业内的焦点话题。作为NGN的核心技术,软交换技术也越来越多地受到人们关注。文中简述下一代网络产生的背景,从软交换的定义出发,对软交换技术中涉及的网络体系总体结构、分层内容、协议和标准等主要内容做比较详细的分析和介绍,探讨软交换技术的应用,指出软交换技术所面临的若干问题。     

SIP和H.323协议互通的研究

下一代网络是当前的研究热点,H.323和SIP是VoIP网络的两大主流技术,基于它们的网络间互联互通是一个亟需解决的问题。文章从协议角度提供一个从SIP网络到H.323网络的互通单元(IWF),重点介绍互通单元的结构和功能模型。通过对H.323与SIP协议的分析比较,指出互通过程中需要处理的主要问题,实现网络寻址、地址转换和消息映射的基本方法,最后给出实现互通最典型的通信流程,为实现基于软交换的下一代网络提供参考。