[1] Yao A C C. Protocols for secure computations[C]//FOCS'82. Chicago: IEEE, 1982: 80-91.
[2] GoldreichO, Micali S, Wigderson A. How to play any mental game-a completeness theorem for protocols with honest majority[C]//STOC'87. New York: ACM, 1987: 218-229.
[3] Ben-Or M, Goldwasser S, Wigderson A. Completeness theorems for non-cryptographic fault-tolerant distributed computation[C]//STOC'88. Chicago: ACM, 1988: 1-10.
[4] Chaum D, Crépeau C, Damgard I. Multi-party unconditionally secure protocols (extended abstract)[C]//STOC’88. Chicago: ACM, 1988: 11-19.
[5] Rabin T, Ben-Or M. Verifiable secret-sharing and multiparty protocols with honest majority[C]//STOC’89. Seattle: ACM, 1989: 73-85.
[6] Beaver D. Secure multi-party protocols and zero-knowledge proof systems tolerating a faulty minority[J]. Journal of Cryptology, 1991, 4(2): 75-122.
[7] Jakobsson M, Yung M. Proving without knowing: on oblivious, agnostic and blindfolded provers[C]//CRYPTO’96. California: Springer, 1996: 186-200.
[8] IoannidisI, Grama A. An efficient protocol for yao's millionaires' problem[C]//Proceedings of the 36th Hawaii Internatinal Conference on System Sciences. Hawaii: (s.n.), 2003: 205-210.
[9] BlakeI F, Kolesnikov V. Strong conditional oblivious transfer and computing on intervals[C]//ASIACRYPT’04. Jeju Island: Springer, 2004: 515-529.
[10] Li S D, Wang D S, Dai Y Q, et al. Symmetric cryptographic solution to Yao's millionaires' problem and an evaluation of secure multiparty computations[J]. Information Sciences, 2008(178): 244-255.
[11] Li S D, Wang D S, Dai Y Q. Symmetric cryptographic protocols for extended millionaires' problem[J]. Science in China Series F, 2009, 52(6): 974-982.
[12] 马敏耀. 安全多方计算及其扩展问题的研究[D]. 北京: 北京邮电大学, 2010.
[13] LidlR, Niederreiter H. Finite fields[M]. Cambridge University Press, 1996.
[14] Goldreich O. Foundation of cryptography, Volume (Ⅱ): basic applications[M].[S.l.]: Cambridge University Press, 2004.
[15] Paillier P. Public-key cryptosystems based on composite degree residuosity classes[C]//EUROCRYPT'99. Czech Republic: Springer, 1999: 223-238. |