期刊文献+

A Novel Quantum Stegonagraphy Based on Brown States 被引量:1

下载PDF
导出
摘要 In this paper,a novel quantum steganography protocol based on Brown entangled states is proposed.The new protocol adopts the CNOT operation to achieve the transmission of secret information by the best use of the characteristics of entangled states.Comparing with the previous quantum steganography algorithms,the new protocol focuses on its anti-noise capability for the phase-flip noise,which proved its good security resisting on quantum noise.Furthermore,the covert communication of secret information in the quantum secure direct communication channel would not affect the normal information transmission process due to the new protocol’s good imperceptibility.If the number of Brown states transmitted in carrier protocol is many enough,the imperceptibility of the secret channel can be further enhanced.In aspect of capacity,the new protocol can further expand its capacity by combining with other quantum steganography protocols.Due to that the proposed protocol does not require the participation of the classic channel when it implements the transmission of secret information,any additional information leakage will not be caused for the new algorithm with good security.The detailed theoretical analysis proves that the new protocol can own good performance on imperceptibility,capacity and security.
出处 《Computers, Materials & Continua》 SCIE EI 2018年第7期47-59,共13页 计算机、材料和连续体(英文)
基金 This work was supported by the National Natural Science Foundation of China(No.61373131,61303039,61232016,61501247) the Six Talent Peaks Project of Jiangsu Province(Grant No.2015-XXRJ-013) Natural Science Foundation of Jiangsu Province(Grant No.BK20171458) the Natural Science Foundation of the Higher Education Institutions of Jiangsu Province(China under Grant No.16KJB520030) Sichuan Youth Science and Technique Foundation(No.2017JQ0048) NUIST Research Foundation for Talented Scholars(2015r014),PAPD and CICAEET funds.
  • 相关文献

参考文献1

二级参考文献27

  • 1Z. J. Fu, X. M. Sun, Q. Liu, L. Zhou, and J. G. Shu, "Achieving Efficient Cloud Search Services: MultJ-keyword Ranked Search over Encrypted Cloud Data Supporting Parallel Computing," IEICE Transactions on Communications, vol. E98-B, no. 1, pp.190-200, 2015.
  • 2S. D. Xie, Y. X. Wang, "Construction of Tree Net- work with Limited Delivery Latency in Homoge- neous Wireless Sensor Networks," Wireless Per- sonal Communications, 2014, 78(1): 231-246.
  • 3R Guo, J. Wang, B. Li, S. Y. Lee, "A Variable Threshold-value Authentication Architecture for Wireless Mesh Networks," Journal of Internet Technology, 2014, 15(6): 929-936.
  • 4T. H. Ma, J. J. Zhou, M. L. Tang, Y. Tian, A. AL- DHELAAN, M. AL-RODHAAN, and S. Y. LEE, "So- cial network and tag sources based augment- ing collaborative recommender system," IEICE transactions on Information and Systems, vol. E98-D, no.4, pp. 902-910, Apr. 2015.
  • 5B. Gu, V. S. Sheng, K. Y. Tay, W. Romano, and S. Li, "Incremental Support Vector Learning for Ordinal Regression," IEEE Transactions on Neu- ral Networks and Learning Systems, 2014, 26(7): 1403-1416.
  • 6Dublin City University and Ericsson, E-Stream Project, 2014. http://www.estream-project.com.
  • 7G. S. Manku and R. Motwani, "Approximate Fre- quency Counts over Data Streams" In: Proceed- ings of the 28th International Conference on Very Large Databases (VLDB Endowment 2002), pp. 346-57, 2002.
  • 8J. H. Chang and W. S. Lee, "Finding Recent Fre- quent Itemsets Adaptively over Online Data Streams," In: Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining (SlGKDD 2003), pp. 487-492, 2003.
  • 9H. F. Li and H. Chen, "Mining Non-Derivable Frequent Item Sets over Data Stream," Data & Knowledge Engineering, vol. 68, no. 5, May 2009, pp. 481-498.
  • 10S. K. Tanbeer, C. F. Ahmed, B. S. Jeong and Y. K. Lee, "Efficient Single-Pass Frequent Pattern Mining Using a Prefix-tree/' Information Scienc- es, 2008, 179(5): 559-583.

共引文献7

同被引文献2

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部