An arbitrated quantum signature scheme without using entangled states is *** the scheme,by employing a classical hash function and random numbers,the secret keys of signer and receiver can be *** is shown that the pro...
详细信息
An arbitrated quantum signature scheme without using entangled states is *** the scheme,by employing a classical hash function and random numbers,the secret keys of signer and receiver can be *** is shown that the proposed scheme is secure against several well-known ***,it can stand against the receiver’s disavowal ***,compared with previous relevant arbitrated quantum signature schemes,the scheme proposed has the advantage of less transmission complexity.
In a recent paper [Yan F L et al. ***. 25(2008)1187], a quantum secret sharing the protocol between multiparty and multiparty with single photons and unitary transformations was presented. We analyze the security of...
详细信息
In a recent paper [Yan F L et al. ***. 25(2008)1187], a quantum secret sharing the protocol between multiparty and multiparty with single photons and unitary transformations was presented. We analyze the security of the protocol and find that a dishonest participant can eavesdrop the key by using a special attack. Finally, we give a description of this strategy and put forward an improved version of this protocol which can stand against this kind of attack.
Recently,a genuine five-qubit entangled state has been achieved by Brown et al.[***.A 38(2005)1119].Later it was indicated that this state can be used for quantum teleportation and quantum state *** we build a quantum...
详细信息
Recently,a genuine five-qubit entangled state has been achieved by Brown et al.[***.A 38(2005)1119].Later it was indicated that this state can be used for quantum teleportation and quantum state *** we build a quantum secure direct communication protocol with this state,and prove that it is secure in ideal *** the protocol,the sender performs unitary transformations to encode a secret message on his/her particles and sends them to the *** receiver then performs projective determinate measurement to decode the secret message ***,this protocol utilizes superdense coding to achieve a high intrinsic efficiency and source capacity.
In a recent paper [C.H. Hong et al., Opt. Commun. 283 (2010) 2644], a n-user quantum key distribution protocol with n quantum channels was presented. By analyzing its security, it is shown that this protocol is insecu...
详细信息
With the popularity of mobile smart devices and functional diversification, the infection ways of mobile smartphones worm also become diverse. In mobile networks, mobile devices are suffering from the threat of worms ...
详细信息
This paper discusses the price discrimination in wireless service allocation on the basis of game theory. The wireless service providers can supply the service with different prices. Two service price discrimination m...
详细信息
This work develops an equilibrium model for finding the optimal distribution strategy to maximize performance of key predistribution protocols in terms of cost, resilience, connectivity, and lifetime. As an essential ...
详细信息
This work develops an equilibrium model for finding the optimal distribution strategy to maximize performance of key predistribution protocols in terms of cost, resilience, connectivity, and lifetime. As an essential attribute of wireless sensor networks, heterogeneity and its impacts on random key predistribution protocols are first discussed. Using supernetworks theory, the optimal node deployment model is proposed and illustrated. In order to find the equilibrium performance of our model, all optimal performance functions are changed into variational inequalities so that this optimization problem can be solved. A small-scale example is presented to illustrate the applicability of our model.
In this paper, an efficient quantum anonymous ranking protocol with single particles is proposed. A semitrusted server is introduced to help multiple users achieve this secure task. At the end of the protocol, each us...
详细信息
In this paper, an efficient quantum anonymous ranking protocol with single particles is proposed. A semitrusted server is introduced to help multiple users achieve this secure task. At the end of the protocol, each user can obtain the rankings of his private data, and keep these data secret. The Chinese remainder theorem is utilized to reduce the level of signal particles and to improve the efficiency of the presented protocol. Meanwhile, a secret transmission order of the signal particles is used to keep the traveling particles secure. Finally, we discuss the security of this protocol and prove it to be secure against certain common attacks under ideal conditions.
In a recent paper [C.H. Hong et al., Opt. Commun. 283 (2010) 2644], a n-user quantum key distribution protocol with n quantum channels was presented. By analyzing its security, it is shown that this protocol is insecu...
详细信息
In a recent paper [C.H. Hong et al., Opt. Commun. 283 (2010) 2644], a n-user quantum key distribution protocol with n quantum channels was presented. By analyzing its security, it is shown that this protocol is insecure for Trent, a dishonest third party, who can steal the key without being detected by a special attack strategy. We give a description of this strategy and then put forward an improved protocol, which can stand against this attack. Furthermore, the improved protocol is feasible in the current technology conditions, because it is just required an incomplete Bell-state measurement in implementation of it.
A novel method, multiple classifier behavior-based data reduction and classification algorithm, called DRC, is proposed in this paper. It arrived at the transformation of the data-space by suing of the multiple classi...
详细信息
ISBN:
(纸本)1601320620
A novel method, multiple classifier behavior-based data reduction and classification algorithm, called DRC, is proposed in this paper. It arrived at the transformation of the data-space by suing of the multiple classifier behavior vector so that data-sets transform from the original spaces to the behavior spaces. It aims to find some more meaningful representatives to replace the original dataset via classifier behavior vector for further classification. Each representative is formed by its multiple classifier behavior and its neighborhood which satisfies a predefined threshold. Inspired by the spirits of data reduction and classifier selection methods, the proposed DRC not only reduces the cost but also uses the advantage of each single classifier to improve the classification accuracy to a certain extent. This is proved by real world applications such as toxicity prediction of chemical compounds in predictive toxicology.
暂无评论