| ［1］ Goldwasser S, Kalai Y T, Rothblum G N. One-time Programs［C］//Proc of the 28th Annual Conference on Cryptology: Advances in Cryptology. Heidelberg: Springer-Verlag, 2008: 39-56.
［2］ Yao A C. How to Generate and Exchange Secrets［C］//Proc of Twenty-seventh IEEE Symposium on Foundations of Computer Science. NewYork: IEEE Computer Society, 1986: 162-167.
［3］ Lindell Y, Pinkas B. A Proof of Security of Yao's Protocol for Two-Party Computation［J］. Journal of Cryptology, 2009, 22(2): 161-188.
［4］ Goldreich O, Micali S, Wigderson A. How to Play Any Mental Game［C］//Proc of the Nineteenth Annual ACM Symposium on Theory of Computing. NewYork: ACM, 1987: 218-229.
［5］ Malkhi D, Nisan N, Pinkas B, et al. Fairplay—a Secure Two-Party Computation System［C］//Proc of the 13th Conference on USENIX Security Symposium. California: USENIX Association, 2004: 287-302.
［6］ Naor M, Pinkas B, Sumner R. Privacy Preserving Auctions and Mechanism Design［C］//Proc of the 1st ACM Conference on Electronic Commerce. NewYork: ACM, 1999: 129-139.
［7］ Brassard G, Crepeau C, Robert J M. Information-theoretic Reductions Among Disclosure Problems［C］//Proc of 27th Annual Symposium on Foundations of Computer Science. Washington: IEEE Computer Society, 1986: 168-173.
［8］ Even S, Goldreich O, Lempel A. A Randomized Protocol for Signing Contracts［J］. Communications of the ACM, 1985, 28(6): 637-647.
［9］ Goldreich O, Goldwasser S, Micali S. How to Construct Random Functions［J］. Journal of the ACM, 1986, 33(4): 792-807. |
