Progress of Secure Computation: Basic Constructions and Dedicated Algorithms-Reference-Cited by-同舟云学术

Progress of Secure Computation: Basic Constructions and Dedicated Algorithms

Published:2018-07-01 Issue:1 Volume:12 Page:12-20
ISSN:1882-0875
Container-title:IEICE ESS Fundamentals Review
language:en
Short-container-title:IEICE Fundamentals Review

Author:

KIKUCHI Ryo¹,IKARASHI Dai¹

Affiliation:

1. NTT Secure Platform Laboratories, NIPPON TELEGRAPH AND TELEPHONE CORPORATION

Publisher

Institute of Electronics, Information and Communications Engineers (IEICE)

Subject

General Earth and Planetary Sciences,General Environmental Science

Link

https://www.jstage.jst.go.jp/article/essfr/12/1/12_12/_pdf

Reference39 articles.

1. (1) M. Ben-Or, S. Goldwasser, and A. Wigderson, “Completeness theorems for non-cryptographic fault-tolerant distributed computation (extended abstract),” Proc. 20th Annual ACM Symposium on Theory of Computing, J. Simon, ed., pp. 1-10, Chicago, USA, May 1988.

2. (2) D. Chaum, C. Crépeau, and I. Damgård, “Multiparty unconditionally secure protocols (extended abstract),” Proc. 20th Annual ACM Symposium on Theory of Computing, J. Simon, ed., pp. 11-19, Chicago, USA, May 1988.

3. (3) O. Goldreich, S. Micali, and A. Wigderson, “How to play any mental game or A completeness theorem for protocols with honest majority,” Proc. 19th Annual ACM Symposium on Theory of Computing, 1987, A.V. Aho, ed., pp. 218-229, New York, USA, 1987.

4. (4) A.C. Yao, “How to generate and exchange secrets (extended abstract),” 27th Annual Symposium on Foundations of Computer Science, pp. 162-167, Toronto, Canada, Oct. 1986.

5. (5) O. Goldreich, The Foundations of Cryptography - Volume 1, Basic Techniques, Cambridge University Press, 2001.

Cited by 1 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Application and evaluation of secure computation technology for the secure use of crop-breeding big data;Breeding Research;2024-06-01