7[1]Schneier B. Applied cryptography: protocol, algorithm, and source code in C [M]. Second edition. New York: John Wiley & Sons, 1998.
8[2]Kilian J, Petrank E. An efficient non-interactive zero-knowledge proofsystem for NP with general assumptions [J]. Journal of Cryptology, 1998, 11(1): 1～27.
9[3]Burmester M, Desmedt Y G, Itoh T, et al. Divertible and subliminal-free zero knowledge proofs for languages [J]. Journal of Cryptology, 1999, 12(4): 197～223.
10[4]Davis M D, Weyuker E J. Computability, complexity and languages: fundamentals of theoretical computer science [M]. New York: Academic Press, 1983. 70～75.
