1 |
PANETTA K. Gartner top strategic technology trends for 2021[EB/OL]. (2020-10-19) [2021-10-20]..
|
2 |
YAO A C. Protocols for secure computations[C]// Proceedings of the 23rd Annual Symposium on Foundations of Computer Science. Piscataway: IEEE, 1982:160-164. 10.1109/sfcs.1982.38
|
3 |
GOLDREICH O, MICALI S, WIGDERSON A. How to play ANY mental game[C]// Proceedings of the 19th Annual ACM Symposium on Theory of Computing. New York: ACM, 1987:218-229. 10.1145/28395.28420
|
4 |
KOLESNIKOV V, SCHNEIDER T. Improved garbled circuit: free XOR gates and applications[C]// Proceedings of the 2008 International Colloquium on Automata, Languages, and Programming, LNCS 5126. Berlin: Springer, 2008:486-498.
|
5 |
KOLESNIKOV V, MOHASSEL P, ROSULEK M. FleXOR: flexible garbling for XOR gates that beats free-XOR[C]// Proceedings of the 2014 Annual Cryptology Conference, LNCS 8617. Berlin: Springer, 2014:440-457.
|
6 |
ZAHUR S, ROSULEK M, EVANS D. Two halves make a whole: reducing data transfer in garbled circuits using half gates[C]// Proceedings of the 2015 Annual International Conference on the Theory and Applications of Cryptographic Techniques, LNCS 9057. Berlin: Springer, 2015:220-250.
|
7 |
HASTINGS M, HEMENWAY B, NOBLE D, et al. SoK: general purpose compilers for secure multi-party computation[C]// Proceedings of the 2019 IEEE Symposium on Security and Privacy. Piscataway: IEEE, 2019:1220-1237. 10.1109/sp.2019.00028
|
8 |
RIVEST R L, SHAMIR A, ADLEMAN L. A method for obtaining digital signatures and public-key cryptosystems[J]. Communications of the ACM, 1978, 21(2): 120-126. 10.1145/359340.359342
|
9 |
PAILLIER P. Public-key cryptosystems based on composite degree residuosity classes[C]// Proceedings of the 1999 International Conference on the Theory and Applications of Cryptographic Techniques, LNCS 1592. Berlin: Springer, 1999:223-238.
|
10 |
GENTRY C. Fully homomorphic encryption using ideal lattices[C]// Proceedings of the 41st Annual ACM Symposium on Theory of Computing. New York: ACM, 2009:169-178. 10.1145/1536414.1536440
|
11 |
BRAKERSKI Z, GENTRY C, VAIKUNTANATHAN V. (Leveled) fully homomorphic encryption without bootstrapping[J]. ACM Transactions on Computation Theory, 2014, 6(3): No.13. 10.1145/2633600
|
12 |
GENTRY C, SAHAI A, WATERS B. Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based[C]// Proceedings of the 2013 Annual Cryptology Conference, LNCS 8042. Berlin: Springer, 2013:75-92.
|
13 |
BEAVER D. Efficient multiparty protocols using circuit randomization[C]// Proceedings of the 1991 Annual International Cryptology Conference, LNCS 576. Berlin: Springer, 1992:420-432. 10.1007/3-540-46766-1_34
|
14 |
仲红,黄刘生,罗永龙. 一个实用的电子评审方案[J]. 小型微型计算机系统, 2007, 28(1):178-181. 10.3969/j.issn.1000-1220.2007.01.038
|
|
ZHONG H, HUANG L S, LUO Y L. A practical electronic jury voting scheme[J]. Journal of Chinese Computer Systems, 2007, 28(1):178-181. 10.3969/j.issn.1000-1220.2007.01.038
|
15 |
张嘉诚,崔喆,刘霆,等. 基于安全多方计算的电子评审系统设计方案[J]. 计算机应用, 2020, 40(S2):80-84.
|
|
ZHANG J C, CUI Z, LIU T, et al. Design scheme of electronic jury system based on secure multi-party computation[J]. Journal of Computer Applications, 2020, 40(S2):80-84.
|
16 |
HEVIA A, KIWI M. Electronic jury voting protocols[J]. Theoretical Computer Science, 2004, 321(1): 73-94. 10.1016/j.tcs.2003.06.003
|
17 |
傅祖芸,赵建中. 信息论与编码[M]. 2版. 北京:电子工业出版社, 2014:271-280.
|
|
FU Z Y, ZHAO J Z. Information Theory and Coding[M]. 2nd ed. Beijing: Publishing House of Electronics Industry, 2014:271-280.
|
18 |
SHAMIR A. How to share a secret[J]. Communications of the ACM, 1979, 22(11):612-613. 10.1145/359168.359176
|
19 |
王晓京,方嘉佳,蔡红亮,等. 视图的秘密分享及其代数编码方法[J]. 计算机应用, 2012, 32(3):669-678. 10.3724/sp.j.1087.2012.00669
|
|
WANG X J, FANG J J, CAI H L, et al. Secret image sharing and its algebraic coding method[J]. Journal of Computer Applications, 2012, 32(3):669-678. 10.3724/sp.j.1087.2012.00669
|
20 |
WANG X J, YUAN Q Z, CAI H L, et al. A new approach to image sharing with high-security threshold structure[J]. Journal of the ACM, 2014, 61(6): No.39. 10.1145/2666470
|
21 |
CRAMER R, DAMGÅRD I, MAURER U. General secure multi-party computation from any linear secret-sharing scheme[C]// Proceedings of the 2000 International Conference on the Theory and Applications of Cryptographic Techniques, LNCS 1807. Berlin: Springer, 2000:316-334.
|