Honest-Sender Commitment and Honest-Receiver Commitment

Goldwasser S, Micali S, and Rackoff C. The knowledge complexity of interactive proof systems. SIAM Journal on Computing, 1989, 18(1): 186-208.[2] Goldreich O, Micali S, and Widerson A. Proofs that yields nothing but their validity or all languages in NP have zero knowledge proof systems. Journal of ACM, 1991, 38(3): 691-729.[3] Goldreich O. Foundations of Cryptography-Basic Tools. Version 1, USA, Cambridge University of Press, 2001: 228-240.[4] Goldreich O, Micali S, and Widerson A. How to play any mental game or a completeness theorem for protocols with honest majority. Proceeding of the 19th Annual ACM Symposium on Theory of ComputingSTOC87, New York, New York, USA, May 25-27, 1987: 218-229.[5] Even S, Goldreich O, and Lempel A. A randomized protocol for signing contracts. Communications of the ACM, 1985, 28(6): 637-647.[6] Dolev D, Dwork C, and Naor M. Non-malleable cryptography. SIAM Journal on Computing, 2000, 30(2): 391-437.[7] Damgard I and Groth J. Non-interactive and reusable non-malleable commitment schemes. Proceedings of the 35th Annual ACM Symposium on Theory of Computing STOC03, San Diego, California, USA, June 9-11, 2003: 426-437.[8] Di Crescenzo G, Ishai Y, and Ostrovsky R. Non-interactive and non-malleable commitments. Proceedings of the 30th Annual ACM Symposium on Theory of Computing STOC98, Dallas, Texas, USA, May 23-26, 1998: 141-150.[9] Di Crescenzo G, Katz J, and Ostrovsky R, et al.. Efficient and non-interactive non-malleable commitments. In Advances in CryptologyEUROCRYPT01, Innsbruck, Tyrol, Australia, May 6-10, 2001, 2045: 40-59.[10] Fischlin M and Fischlin R. Efficient non-malleable commitment schemes. In Advances in Cryptology CRYPTO00, Santa Barbara, California, USA, August 20-24, 2000, 1880: 413-431.[11] Lin Hui-jia, Pass R, and Venkitasubramaniam M. Concurrent non-malleable commitments from any one-way function. Proceedings of the 5th Theory of Cryptography Conference TCC08, New york, USA, March 19-21, 2008, 4948: 571-588.[12] Pass R and Rosen A. Concurrent non-malleable commitments. Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer ScienceFOCS05, Pittsburgh, PA, October 22-25, 2005: 563-572.[13] Zhang Zong-yang, Cao Zhen-fu, and Ding Ning, et al.. Non-malleable statistically-hiding commitment from any one-way function. In Advances in Cryptology ASIACRYPT09, Tokyo, Japan, December 6-10, 2009, 5912: 303-318.[14] Naor M. Bit commitment using pseudo-randomness. Journal of Crypto, 1991, 4(2): 151-158.[15] Pedersen T P. Non-interactive and information-theoretic secure verifiable secret sharing. In Advances in Cryptology CRYPTO91, Santa Barbara, California, USA, August 11-15, 1991, 576: 121-140.