共 124 条
- [1] How to generate and exchange secrets, Proc of 27th Annual Symp on Foundations of Computer Science, pp. 162-167, (1986)
- [2] Shamir A., How to share a secret, Communications of the ACM, 22, 11, pp. 612-613, (1979)
- [3] Blakley G R., Safeguarding cryptographic keys, Proc of Managing Requirements Knowledge, International Workshop on IEEE Computer Society, pp. 313-313, (1979)
- [4] Rabin M O., Transaction protection by beacons, Journal of Computer and System Sciences, 27, 2, pp. 256-267, (1981)
- [5] Rivest R L, Adleman L, Dertouzos M L., On data banks and privacy homomorphisms, Foundations of Secure Computation, 4, 11, pp. 169-180, (1978)
- [6] Gentry C., Fully homomorphic encryption using ideal lattices, Proc of the 41st Annual ACM Symp on Theory of Computing, pp. 169-178, (2009)
- [7] Beaver D, Micali S, Rogaway P., The round complexity of secure protocols, Proc of the 22nd Annual ACM Symp on Theory of Computing, pp. 503-513, (1990)
- [8] Naor M, Pinkas B, Sumner R., Privacy preserving auctions and mechanism design, Proc of the 1st ACM Conf on Electronic Commerce, pp. 129-139, (1999)
- [9] Kolesnikov V, Schneider T., Improved garbled circuit: Free XOR gates and applications, Proc of Int Colloquium on Automata, Languages, and Programming, pp. 486-498, (2008)
- [10] Pinkas B, Schneider T, Smart N P, Et al., Secure two-party computation is practical, Proc of Int Conf on the Theory and Application of Cryptology and Information Security, pp. 250-267, (2009)