NHPCC

Hefei, China
Hefei, China

Time filter

Source Type

Shi R.-H.,NHPCC | Shi R.-H.,Anhui Science and Technology University | Huang L.-S.,NHPCC | Huang L.-S.,Suzhou Institute for Advanced Study | And 3 more authors.
Quantum Information Processing | Year: 2011

We present a scheme for asymmetric multi-party quantum state sharing of an arbitrary m-qubit state with n agents. The sender Alice first shares m - 1 Bell states and one n + 1-particle Greenberger-Horne-Zeilinger state with n agents, where the agent Bob, who is designated to recover the original m-qubit state, just keeps m particles and other agents (all controllers) n - 1 particles, that is, each controller only holds one particle in hand. Subsequently, Alice performs m Bell-basis measurements on her 2m particles and each controller only need take a single-particle measurement on his particle with the basis X. Finally, Bob can recover the original m-qubit state with the corresponding local unitary operations according to Alice and all controllers' measurement results. Its intrinsic efficiency for qubits approaches 100%, and the total efficiency really approaches the maximal value, which is higher than those of the known symmetric schemes. © 2010 Springer Science+Business Media, LLC.


Shi R.-H.,NHPCC | Shi R.-H.,Anhui Science and Technology University | Huang L.-S.,NHPCC | Huang L.-S.,Suzhou Institute for Advanced Study | And 3 more authors.
Quantum Information Processing | Year: 2011

We present a newscheme for sharing an arbitrary two-qubit quantum state with n agents our scheme, the sender Alice first shares n Einsein-Podolsky-Rosen (EPR) pairs in Bell states with n agents. After setting up the secure quantum channel, Alice first applies (n ?2) Controlled-Not (CNOT) gate operations, and then performs two Bell-state measurements and (n ? 2) single-particle measurements (n <2) addition, all controllers only hold one particle in their hands, respectively, and thus they only need to perform a single-particle measurement on the respective particle with the basis {|0}, |1}}. Compared with other schemes with Bell states, our scheme needs less qubits as the quantum resources and exchanges less classical information, and thus obtains higher total efficiency. © Springer Science+Business Media, LLC 2010.


Shi R.-H.,NHPCC | Shi R.-H.,Anhui Science and Technology University | Huang L.-S.,NHPCC | Huang L.-S.,Suzhou Institute for Advanced Study | And 3 more authors.
Optics Communications | Year: 2010

We present an efficient scheme for sharing an arbitrary two-qubit quantum state with n agents. In this scheme, the sender Alice first prepares an n+2-particle GHZ state and introduces a Controlled-Not (CNOT) gate operation. Then, she utilizes the n+2-particle entangled state as the quantum resource. After setting up the quantum channel, she performs one Bell-state measurement and another single-particle measurement, rather than two Bell-state measurements. In addition, except that the designated recover of the quantum secret just keeps two particles, almost all agents only hold one particle in their hands respectively, and thus they only need to perform a single-particle measurement on the respective particle with the basis X. Compared with other schemes based on entanglement swapping, our scheme needs less qubits as the quantum resources and exchanges less classical information, and thus obtains higher communication efficiency. © 2010 Elsevier B.V. All rights reserved.


Shi R.-h.,NHPCC | Shi R.-h.,Anhui Science and Technology University | Huang L.-s.,NHPCC | Huang L.-s.,Suzhou Institute for Advanced Study | And 3 more authors.
Optics Communications | Year: 2010

We present a multiparty quantum secret sharing scheme and analyze its security. In this scheme, the sender Alice takes EPR pairs in Bell states as quantum resources. In order to obtain the shared key, all participants only need to perform Bell measurements, not to perform any local unitary operation. The total efficiency in this scheme approaches 100% as the classical information exchanged is not necessary except for the eavesdropping checks. © 2010 Elsevier B.V. All rights reserved.


Shi R.,NHPCC | Shi R.,Anhui Science and Technology University | Huang L.,NHPCC | Huang L.,Suzhou Institute for Advanced Study | And 3 more authors.
International Journal of Theoretical Physics | Year: 2011

We present an efficient symmetric scheme for five-party quantum state sharing of an arbitrary m-qubit state with 2m three-particle entangled states. The implementations of this scheme only need to exploit the CNOT gate operations and the single-particle measurements, instead of the three-particle GHZ-state measurements, which makes it more convenient in a practical application than some previous schemes. In addition, its total efficiency can approach the maximal value in theory. © 2011 Springer Science+Business Media, LLC.


Shi R.H.,NHPCC | Shi R.H.,Anhui Science and Technology University | Huang L.S.,NHPCC | Huang L.S.,Suzhou Institute for Advanced Study | And 3 more authors.
European Physical Journal D | Year: 2010

We present an asymmetric scheme for five-party quantum state sharing of an arbitrary m-qubit state with the maximally entangled states of two-particle and three-particle. It involves two-particle Bell-basis or three-particle GHZ-basis measurements, rather than five-particle entanglements and five-particle joint measurements, which makes it more convenient in a practical application than some previous schemes. In addition, except that the designated recover of the quantum secret just keeps m particles, other agents only hold one particle in their hands respectively, and thus they only need perform a single-particle measurement on the respective particle with the basis X. Its intrinsic efficiency for qubits approaches 100%, and the total efficiency really approaches the maximal value. © 2010 EDP Sciences, SIF, Springer-Verlag Berlin Heidelberg.


Chen Z.,NHPCC | Chen Z.,Suzhou Institute for Advanced Study | Huang L.,NHPCC | Huang L.,Suzhou Institute for Advanced Study | And 2 more authors.
Digital Investigation | Year: 2011

Linguistic steganography hides information in natural language texts. Because of the increasing in importance and quantity of natural language texts, linguistic steganography plays a more and more important role in Information Security (IS) area today. Substitution-based linguistic steganography is one of the most commonly used linguistic steganography methods, which is of considerable security and favorable simpleness. In this paper, we propose a straightforward method based on Relative Frequency Analysis (RFA), which makes use of the frequency characteristics of the testing texts (the texts being tested), to detect substitution-based linguistic steganography. We formally prove several properties about relative frequency which can be used in the detection process and propose a detection scheme. And then as an example, an existent synonym-substitution system T-Lex is examined and the detection experiment is carried out. In the experiment with pure literature texts, the accuracy, precision and recall of the detection are found to be as high as 98.64%, 97.77% and 99.55%, respectively, when the substitution count is 90, while in the experiment with balanced texts, the highest detection accuracy is 95%, which indicates that the detection scheme is promising. © 2011 Elsevier Ltd. All rights reserved.


Chen Z.,NHPCC | Chen Z.,Suzhou Institute for Advanced Study | Huang L.,NHPCC | Huang L.,Suzhou Institute for Advanced Study | And 4 more authors.
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | Year: 2011

Translation based steganography (TBS) is a kind of relatively new and secure linguistic steganography. It takes advantage of the "noise" created by automatic translation of natural language text to encode the secret information. Up to date, there is little research on the steganalysis against this kind of linguistic steganography. In this paper, a blind steganalytic method, which is named natural frequency zoned word distribution analysis (NFZ-WDA), is presented. This method has improved on a previously proposed linguistic steganalysis method based on word distribution which is targeted for the detection of linguistic steganography like nicetext and texto. The new method aims to detect the application of TBS and uses none of the related information about TBS, its only used resource is a word frequency dictionary obtained from a large corpus, or a so called natural frequency dictionary, so it is totally blind. To verify the effectiveness of NFZ-WDA, two experiments with two-class and multi-class SVM classifiers respectively are carried out. The experimental results show that the steganalytic method is pretty promising. © 2011 Springer-Verlag.


He L.-B.,NHPCC | Huang L.-S.,Suzhou Institute for Advanced Study | Yang W.,Suzhou Institute for Advanced Study | Xu R.,Suzhou Institute for Advanced Study | Han D.-Q.,Suzhou Institute for Advanced Study
Quantum Information Processing | Year: 2012

We investigate the quantum sealed-bid auction protocol proposed by Zhao et al. (Opt Commun 283:1394, 2010). It uses M groups n-particle GHZ states to represent bids and a post-confirmation mechanism to guarantee the honesty of the quantum sealed-bid auction. However, in our opinion the protocol still does not complete the task of a sealed-bid auction fairly. It is shown that a large group of dishonest bidders can collude to obtain all the other one's secret bids before the opening phase of the auction with a probability polynomially close to one. Moreover, a simple feasible improvement of the protocol is proposed. © Springer Science+Business Media, LLC 2011.


Dong F.,NHPCC | Huang L.,NHPCC | Yang W.,NHPCC | Zhu Y.,NHPCC | Wang J.,NHPCC
Proceedings - 2010 3rd IEEE International Conference on Computer Science and Information Technology, ICCSIT 2010 | Year: 2010

Trust and reputation systems are widely used in electronic commerce, social network, search engine, and so on. They have become a very important element in cyberspace. However the theoretical research actualities of this field are lagging behind applications. Various existing works are rarely relevant and without consensus. Aiming at the above problems, this paper proposes a general model for trust and reputation systems. The model mainly solves the following basic problems in this field: i) redefine the concepts of trust and reputation and discuss the relationship between them; ii) design and construction of the general model, especially the basic element of trust and reputation systems, and iii) the applications of the general model for trust and reputation systems. According to this work, this paper gets some key results of this field. These results will provide research foundations and framework for the future work. © 2010 IEEE.

Loading NHPCC collaborators
Loading NHPCC collaborators