DoSGuard: Mitigating Denial-of-Service Attacks in Software-Defined Networks.

Software-defined networking (SDN) is a new networking paradigm that realizes the fast management and optimal configuration of network resources by decoupling control logic and forwarding functions. However, centralized network architecture brings new security problems, and denial-of-service (DoS) attacks are among the most critical threats. Due to the lack of an effective message-verification mechanism in SDN, attackers can easily launch a DoS attack by faking the source address information.

Sound Can Help Us See More Clearly.

In the field of video action classification, existing network frameworks often only use video frames as input. When the object involved in the action does not appear in a prominent position in the video frame, the network cannot accurately classify it. We introduce a new neural network structure that uses sound to assist in processing such tasks.

A Multi-User Public Key Encryption with Multi-Keyword Search out of Bilinear Pairings.

Internet of Things (IoT) and cloud computing are adopted widely in daily life and industrial production. Sensors of IoT equipment gather personal, sensitive and important data, which is stored in a cloud server. The cloud helps users to save cost and collaborate.

Cache-Based Privacy Preserving Solution for Location and Content Protection in Location-Based Services.

Location-Based Services (LBSs) are playing an increasingly important role in people's daily activities nowadays. While enjoying the convenience provided by LBSs, users may lose privacy since they report their personal information to the untrusted LBS server. Although many approaches have been proposed to preserve users' privacy, most of them just focus on the user's location privacy, but do not consider the query privacy.

Robust Multiple Servers Architecture Based Authentication Scheme Preserving Anonymity.

Recently, many dynamic ID based remote user authentication schemes using smart card have been proposed to improve the security in multiple servers architecture authentication systems. In 2017, Kumari and Om proposed an anonymous multi-server authenticated key agreement scheme, which is believed to be secure against a range of network attacks. Nevertheless, in this paper we reanalyze the security of their scheme, and show that the scheme is vulnerable to impersonation attack and server spoofing attack launched by any adversary without knowing any secret information of the victim users.

Message Integration Authentication in the Internet-of-Things via Lattice-Based Batch Signatures.

The internet-of-things (also known as IoT) connects a large number of information-sensing devices to the Internet to collect all kinds of information needed in real time. The reliability of the source of a large number of accessed information tests the processing speed of signatures. Batch signature allows a signer to sign a group of messages at one time, and signatures' verification can be completed individually and independently.

Practical passive decoy state measurement-device-independent quantum key distribution with unstable sources.

Measurement-device-independent quantum key distribution (MDI-QKD) with the active decoy state method can remove all detector loopholes, and resist the imperfections of sources. But it may lead to side channel attacks and break the security of QKD system. In this paper, we apply the passive decoy state method to the MDI-QKD based on polarization encoding mode.

Bounds for coherence of quantum superpositions in high dimension.

Quantum coherence plays a major role in the promotion for quantum information processing and designing quantum technology. Since coherence is rooted in superposition principle, it is vital to understand the coherence change with respect to superpositions. Here we study the bounds for coherence of quantum superpositions in high dimension.

Round-robin differential-phase-shift quantum key distribution with a passive decoy state method.

Recently, a new type of protocol named Round-robin differential-phase-shift quantum key distribution (RRDPS QKD) was proposed, where the security can be guaranteed without monitoring conventional signal disturbances. The active decoy state method can be used in this protocol to overcome the imperfections of the source. But, it may lead to side channel attacks and break the security of QKD systems.

Locally indistinguishable orthogonal product bases in arbitrary bipartite quantum system.

As we know, unextendible product basis (UPB) is an incomplete basis whose members cannot be perfectly distinguished by local operations and classical communication. However, very little is known about those incomplete and locally indistinguishable product bases that are not UPBs. In this paper, we first construct a series of orthogonal product bases that are completable but not locally distinguishable in a general m ⊗ n (m ≥ 3 and n ≥ 3) quantum system.

Entanglement as a resource to distinguish orthogonal product states.

It is known that there are many sets of orthogonal product states which cannot be distinguished perfectly by local operations and classical communication (LOCC). However, these discussions have left the following open question: What entanglement resources are necessary and/or sufficient for this task to be possible with LOCC? In m ⊗ n, certain classes of unextendible product bases (UPB) which can be distinguished perfectly using entanglement as a resource, had been presented in 2008. In this paper, we present protocols which use entanglement more efficiently than teleportation to distinguish some classes of orthogonal product states in m ⊗ n, which are not UPB.

General existence of locally distinguishable maximally entangled states only with two-way classical communication.

It is known that there exist two locally operational settings, local operations with one-way and two-way classical communication. And recently, some sets of maximally entangled states have been built in specific dimensional quantum systems, which can be locally distinguished only with two-way classical communication. In this paper, we show the existence of such sets is general, through constructing such sets in all the remaining quantum systems.

Minimal number of runs and the sequential scheme for local discrimination between special unitary operations.

It has been shown that any two different multipartite unitary operations are perfectly distinguishable by local operations and classical communication with a finite number of runs. Meanwhile, two open questions were left. One is how to determine the minimal number of runs needed for the local discrimination, and the other is whether a perfect local discrimination can be achieved by merely a sequential scheme.

Multipartite entanglement indicators based on monogamy relations of n-qubit symmetric states.

Constructed from Bai-Xu-Wang-class monogamy relations, multipartite entanglement indicators can detect the entanglement not stored in pairs of the focus particle and the other subset of particles. We investigate the k-partite entanglement indicators related to the αth power of entanglement of formation (αEoF) for k ≤ n, αϵ and n-qubit symmetric states. We then show that (1) The indicator based on αEoF is a monotonically increasing function of k.

Quantum secret sharing via local operations and classical communication.

We investigate the distinguishability of orthogonal multipartite entangled states in d-qudit system by restricted local operations and classical communication. According to these properties, we propose a standard (2, n)-threshold quantum secret sharing scheme (called LOCC-QSS scheme), which solves the open question in [Rahaman et al., Phys.

Linear monogamy of entanglement in three-qubit systems.

For any three-qubit quantum systems ABC, Oliveira et al. numerically found that both the concurrence and the entanglement of formation (EoF) obey the linear monogamy relations in pure states. They also conjectured that the linear monogamy relations can be saturated when the focus qubit A is maximally entangled with the joint qubits BC.

Security of Semi-Device-Independent Random Number Expansion Protocols.

Semi-device-independent random number expansion (SDI-RNE) protocols require some truly random numbers to generate fresh ones, with making no assumptions on the internal working of quantum devices except for the dimension of the Hilbert space. The generated randomness is certified by non-classical correlation in the prepare-and-measure test. Until now, the analytical relations between the amount of the generated randomness and the degree of non-classical correlation, which are crucial for evaluating the security of SDI-RNE protocols, are not clear under both the ideal condition and the practical one.

Finite-key security analyses on passive decoy-state QKD protocols with different unstable sources.

In quantum communication, passive decoy-state QKD protocols can eliminate many side channels, but the protocols without any finite-key analyses are not suitable for in practice. The finite-key securities of passive decoy-state (PDS) QKD protocols with two different unstable sources, type-II parametric down-convention (PDC) and phase randomized weak coherent pulses (WCPs), are analyzed in our paper. According to the PDS QKD protocols, we establish an optimizing programming respectively and obtain the lower bounds of finite-key rates.

Characterizing unextendible product bases in qutrit-ququad system.

Unextendible product bases (UPBs) play an important role in quantum information theory. However, very little is known about UPBs in Hilbert space of local dimension more than three. In this paper, we study the UPBs in qutrit-ququad system and find that there only exist six, seven and eight-state UPBs.

A novel authentication scheme using self-certified public keys for telecare medical information systems.

Telecare medical information systems (TMIS), with the explosive growth of communication technology and physiological monitoring devices, are applied increasingly to enable and support healthcare delivery services. In order to safeguard patients' privacy and tackle the illegal access, authentication schemes for TMIS have been investigated and designed by many researchers. Many of them are promising for adoption in practice, nevertheless, they still have security flaws.

An improved biometrics-based authentication scheme for telecare medical information systems.

Telecare medical information system (TMIS) offers healthcare delivery services and patients can acquire their desired medical services conveniently through public networks. The protection of patients' privacy and data confidentiality are significant. Very recently, Mishra et al.

Practical quantum private query of blocks based on unbalanced-state Bennett-Brassard-1984 quantum-key-distribution protocol.

Until now, the only kind of practical quantum private query (QPQ), quantum-key-distribution (QKD)-based QPQ, focuses on the retrieval of a single bit. In fact, meaningful message is generally composed of multiple adjacent bits (i.e.

Secure privacy-preserving biometric authentication scheme for telecare medicine information systems.

Healthcare delivery services via telecare medicine information systems (TMIS) can help patients to obtain their desired telemedicine services conveniently. However, information security and privacy protection are important issues and crucial challenges in healthcare information systems, where only authorized patients and doctors can employ telecare medicine facilities and access electronic medical records. Therefore, a secure authentication scheme is urgently required to achieve the goals of entity authentication, data confidentiality and privacy protection.

Privacy-preserving self-helped medical diagnosis scheme based on secure two-party computation in wireless sensor networks.

With the continuing growth of wireless sensor networks in pervasive medical care, people pay more and more attention to privacy in medical monitoring, diagnosis, treatment, and patient care. On one hand, we expect the public health institutions to provide us with better service. On the other hand, we would not like to leak our personal health information to them.

Two-cloud-servers-assisted secure outsourcing multiparty computation.

We focus on how to securely outsource computation task to the cloud and propose a secure outsourcing multiparty computation protocol on lattice-based encrypted data in two-cloud-servers scenario. Our main idea is to transform the outsourced data respectively encrypted by different users' public keys to the ones that are encrypted by the same two private keys of the two assisted servers so that it is feasible to operate on the transformed ciphertexts to compute an encrypted result following the function to be computed. In order to keep the privacy of the result, the two servers cooperatively produce a custom-made result for each user that is authorized to get the result so that all authorized users can recover the desired result while other unauthorized ones including the two servers cannot.