Cluster states quantum fuzzy hashing and covert information search

Dong CAO

doi:10.3969/j.issn.1007-5461.2015.01.009

[1] Gottesman D, Chuang I. Quantum digital signatures [OL]. http://arxiv.org/abs/quant-ph/0105032 Technical Report, Cornell University Library, 2001.

[2] Buhrman H, Richard C, Watrous J, et al. Quantum fingerprinting[J]. Phys. Rev. Lett., 2001, 87(16): 167902.

[3] Xin L, Feng D G. Quantum digital signature based on quantum one-way functions [C].The 7th International Conference on Advanced Communication Technology, 2005, 514-517.

[4] Zhou J X, Zhou T J, Niu X X, et al. Quantum proxy signature scheme with public verifiability [J]. Science China Physics, Mechanics and Astronomy, 2011,54(10): 1828-1832.

[5] Ablayev F, Vasiliev A. Quantum hashing [OL]. http://arxiv.org/abs/1310.4922v1, 2013.

[6] Vasiliev A. Quantum communications based on quantum hashing [OL]. http://arxiv.org/abs/1312.1661, 2013.

[7] Ablayev F, Marat A. Quantum hashing via classical ε-universal hashing constructions [OL]. http://arxiv.org/ abs/1404.1503v1, 2014.

[8] Jesse K. Identifying almost identical files using context triggered piecewise hashing [OL]. http://www.science- direct.com/ science/article/pii/S1742287606000764.

[9] Hao F, Daugman J, Zielinski P. A fast search algorithm for a large fuzzy database [J]. IEEE Transactions on Information Forensics and Security, 2008, 3(2): 203-212.

[10] Daniel L, Owen K. Recursive n-gram hashing is pairwise independent, at best [J]. Computer Speech and Language, 2010, 24(4): 698-710.

[11] Baier H, Breitinger F. Security aspects of piecewise hashing in computer forensics [C]. Sixth International Conference on IT Security Incident Management and IT Forensics, Stuttgart, Germany, 2011.

[12] Robert R, Hans J B. A one way quantum computer [J]. Phys. Rev. Lett., 2001, 8(32): 5188-5191.

[13] Lau H K, Weedbrook C. Quantum secret sharing with continuous-variable cluster states [J]. Phys. Rev. A, 2013, 88: 042313.

[14] Inaba K, Tokunaga Y, Tamaki K, et al. High-fidelity cluster state generation for ultracold atoms in an optical lattice [J]. Phys. Rev. Lett., 2014, 112: 110501.

[15] Menicucci N C. Fault-tolerant measurement-based quantum computing with continuous-variable cluster states [J]. Phys. Rev. Lett., 2014, 112: 120504.

[16] Aguilar G H, Kolb T, Cavalcanti D, et al. Linear-optical simulation of the cooling of a cluster-state Hamiltonian system [J]. Phys. Rev. Lett., 2014, 112: 160501.

[17] Briegel H, Raussendorf J. Persisteent entanglement in arrays of interacting particles [J]. PRL, 2001, 8(5): 910-913.

[18] Carter J, Wegman M. Universal classes of Hash functions [J]. Computer and System Sciences, 1979, 18: 143-154.

[19] Stinson D R. On the connections between universal hashing, combinatorial designs and error-correcting codes [OL]. http://citeseerx.ist.psu.edu/viewdoc/summary doi=10.1.1.50.5465.

[20] Minho J. Quantum hashing for multimedia[J]. IEEE Transactions on Information Forensics and Security, 2009, 4(4): 982-994.

[21] Cao D, Song Y L. Quantum fuzzy commitment and biometric authentication scheme based on entanglement-assisted quantum error-correcting codes[J]. Acta Electronica Sinica, 2012, 40(7): 1492-1496.

[22] Ben-Aroya A, Ta-Shma A. On the complexity of approximating the diamond norm [OL]. http://arxiv.org/abs/0902.3397v3, 2009.

[23] Watrous J. Semidefinite programs for completely bounded norms [OL]. http://arxiv.org/abs/0901.4709v2, 2009.

[24] Benenti G, et al. Computing the distance between quantum channels: Usefulness of the Fano representation [J]. Journal of Physics B: Atomic, Molecular and Optical Physics, 2010, 43(21): 215508.

[25] Watrous J. Theory of quantum information [OL]. https://cs.uwaterloo.ca/ watrous/quant-info/, 2011.

[26] Liu H B, Tang Q F, Yang J. Application of improved histogram equalization and retinex algorithm in gray image enhancement [J]. Chinese Journal of Quantum Electronics, 2014, 31(5): 525-532 (in Chinese).