D. Cao, Y. L. Song. Quantum fuzzy commitment and biometric authentication scheme based on entanglement-assisted quantum error-correcting codes. Acta Electronica Sinica, 40(7): 1492-1496, 2012.
[2]
Ben-Aroya A, Ta-Shma A. On the complexity of approximating the diamond norm. http://arxiv.org/abs/0902.3397v3, 2009.
[3]
Watrous J. Semidefinite programs for completely bounded norms. http://arxiv.org/abs/0901.4709v2, 2009.
[4]
Benenti G, Strini G. Computing the distance between quantum channels: usefulness of the Fano representation[J]. Journal of Physics B: Atomic, Molecular and Optical Physics, 43(21): 215508, 2010.
[5]
Watrous J. Theory of quantum information. https://cs.uwaterloo.ca/~watrous/quant-info/. 2011.
[6]
Daniel Gottesman and Isaac Chuang. Quantum digital signatures. Technical Report arXiv:quant-ph/0105032, Cornell University Library, Nov 2001.
[7]
Harry Buhrman, Richard Cleve, John Watrous, and Ronald de Wolf. Quantum fingerprinting. Phys. Rev. Lett., 87(16):167902, Sep 2001.
[8]
Xin Lu and Dengguo Feng. Quantum digital signature based on quantum one-way functions.In The 7th International Conference on Advanced Communication Technology, 2005, ICACT2005, volume 1, pages 514–517, 2005.
[9]
JingXian Zhou, YaJian Zhou, XinXin Niu, and YiXian Yang. Quantum proxy signa-ture scheme with public verifiability. Science China Physics, Mechanics and Astronomy,54(10):1828–1832, 2011.
[10]
F. Ablayev, A. Vasiliev. Quantum hashing. http://arxiv.org/abs/1310.4922v1, 2013.
[11]
A. Vasiliev. Quantum Communications Based on Quantum Hashinghttp://arxiv.org/abs/1312.1661, 2013.
[12]
F. Ablayev, Marat A.. Quantum Hashing via Classical ε-universal Hashing Constructions. arXiv:1404.1503v1, 2014
[13]
K. Jesse, Identifying almost identical files using context triggered piecewise hashing. Digital Investigation, 2006, pp. 91-97
[14]
F. Hao, J. Daugman, P. Zielinski, A Fast Search Algorithm for a Large Fuzzy Database. IEEE Transactions on information forensics and security, Vol.3, No.2, pp.203-212, 2008.
[15]
Daniel L, Owen K, Recursive n-gram hashing is pairwise independent, at best. Computer Speech and Language, Vol.24, No.4, pp.698-710, 2010.
[16]
H. Baier, F. Breitinger, Security Aspects of Piecewise Hashing in Computer Forensics. Sixth International Conference on IT Security Incident Management and IT Forensics, Stuttgart, Germany, pp.21-36, 2011.
[17]
Robert R., Hans J. B. A one way quantum computer. Physical Review Letters, 86(32):5188-5191.
[18]
H. K. Lau, C. Weedbrook. Quantum secret sharing with continuous-variable cluster states. Physical Review A, 88: 042313, 2013.
[19]
K. Inaba, Y. Tokunaga, K. Tamaki, K. Igeta, M. Yamashita1. High-Fidelity Cluster State Generation for Ultracold Atoms in an Optical Lattice. Physical Review Letters, 112: 110501, 2014.
[20]
N. C. Menicucci. Fault-Tolerant Measurement-Based Quantum Computing with Continuous-Variable Cluster States. Physical Review Letters, 112: 120504, 2014.
[21]
G. H. Aguilar, T. Kolb, D. Cavalcanti, L. Aolita, R. Chaves, S. P. Walborn, P. H. Souto Ribeiro. Linear-Optical Simulation of the Cooling of a Cluster-State Hamiltonian System. Physical Review Letters, 112: 160501, 2014.
[22]
Briegel H. J., Raussendorf. Persisteent entanglement in arrays of interacting particles. PRL,86(910),2001.
[23]
J.Carter, M. Wegman, Universal Classes of Hash Functions, J.Computer and System Sciences 18(1979),143-154, 1979.
[24]
D.R. Stinson. On the connections between universal hashing, combinatorial designs and error-correcting codes. Congressus Numerantium 114, 727, 1996.
