秘匿マルチパーティ計算 (Japanese Wikipedia)

Analysis of information sources in references of the Wikipedia article "秘匿マルチパーティ計算" in Japanese language version.

refsWebsite

Global rank Japanese rank

5doi.org

2^nd place

6^th place

5acm.org

1,185^th place

2,667^th place

3springer.com

274^th place

596^th place

2acompany.tech

low place

2iacr.org

5,032^nd place

9,586^th place

1taf.or.jp

low place

1mit.edu

415^th place

1,150^th place

1wisc.edu

1,045^th place

2,105^th place

1ieee.org

652^nd place

1,307^th place

1jst.go.jp

1,903^rd place

237^th place

1biu.ac.il

9,276^th place

low place

1e-words.jp

low place

1,383^rd place

1nii.ac.jp

304^th place

20^th place

1qiita.com

low place

3,367^th place

acm.org

dl.acm.org

Joe Kilian: "Founding Cryptography on Oblivious Transfer". STOC 1988: 20-31.
Tal Rabin, "Michael Ben-Or: Verifiable Secret Sharing and Multiparty Protocols with Honest Majority (Extended Abstract)". STOC 1989: 73-85.
Danny Dolev, Cynthia Dwork, Orli Waarts, Moti Yung: "Perfectly Secure Message Transmission". J. ACM 40(1): 17-47 (1993).
Rafail Ostrovsky, Moti Yung: "How to Withstand Mobile Virus Attacks". PODC 1991. pp.51-59.
Moti Yung: From Mental Poker to Core Business: Why and How to Deploy Secure Computation Protocols? ACM Conference on Computer and Communications Security 2015: 1-2 https://dl.acm.org/citation.cfm?doid=2810103.2812701

acompany.tech

プライバシーテック研究所「【技術】MPC技術入門② MPCのセキュリティ定義」2021年6月11日
プライバシーテック研究所「【技術】Oblivious Transfer (OT) とは」2020年7月3日

biu.ac.il

u.cs.biu.ac.il

Claudio Orlandi: Is multiparty computation any good in practice?, ICASSP 2011

doi.org

Micali, Silvio; Goldreich, Oded; Wigderson, Avi (1987). How to play any mental game. pp. 218-229. doi:10.1145/28395.28420. https://doi.org/10.1145/28395.28420.
Abascal, Jackson; Faghihi Sereshgi, Mohammad Hossein; Hazay, Carmit; Ishai, Yuval; Venkitasubramaniam, Muthuramakrishnan (2020-10-30). “Is the Classical GMW Paradigm Practical? The Case of Non-Interactive Actively Secure 2PC”. Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security. CCS '20 (Virtual Event, USA: Association for Computing Machinery): 1591-1605. doi:10.1145/3372297.3423366. ISBN 978-1-4503-7089-9.
木内正人, 高橋寛行, 大嶋一矢, 佐藤加代子「新時代のセキュリティ・デザイン・コンセプトの研究」『日本デザイン学会研究発表大会概要集』第64巻、日本デザイン学会、2017年、248頁、doi:10.11247/jssd.64.0_248、CRID 1390001205609544704。
Aumann, Yonatan; Lindell, Yehuda (2007). Security against covert adversaries: Efficient protocols for realistic adversaries. pp. 137-156. doi:10.1007/978-3-540-70936-7_8.
Ben-Or, Michael; Goldwasser, Shafi; Wigderson, Avi (1988-01-01). Completeness theorems for non-cryptographic fault-tolerant distributed computation. ACM. pp. 1-10. doi:10.1145/62212.62213. ISBN 978-0897912648

e-words.jp

e-words IT用語辞典「セキュア」の解説より

iacr.org

eprint.iacr.org

Peter Bogetoft, Dan Lund Christensen, Ivan Damgård, Martin Geisler, Thomas Jakobsen, Mikkel Krøigaard, Janus Dam Nielsen, Jesper Buus Nielsen, Kurt Nielse, Jakob Pagter, Michael Schwartzbach and Tomas Toft (2008). “Multiparty Computation Goes Live”. Cryptology ePrint Archive (Report 2008/068). http://eprint.iacr.org/2008/068.
Iddo Bentov, Ranjit Kumaresan (2014). “How to Use Bitcoin to Design Fair Protocols”. Cryptology e Print (129): 1-38. https://eprint.iacr.org/2014/129.pdf 2014年10月9日閲覧。.

ieee.org

ieeexplore.ieee.org

Andrew Chi-Chih Yao:How to Generate and Exchange Secrets (Extended Abstract). FOCS 1986: 162-167.

jst.go.jp

jglobal.jst.go.jp

古典的GMWパラダイムは実用的か?非対話型アクティブセキュア2PCの場合【JST・京大機械翻訳】

mit.edu

publications.csail.mit.edu

Ran Canetti, et al., "Adaptively Secure Multi-party", TOC/CIS groups, LCS, MIT (1996), p. 1.

nii.ac.jp

cir.nii.ac.jp

木内正人, 高橋寛行, 大嶋一矢, 佐藤加代子「新時代のセキュリティ・デザイン・コンセプトの研究」『日本デザイン学会研究発表大会概要集』第64巻、日本デザイン学会、2017年、248頁、doi:10.11247/jssd.64.0_248、CRID 1390001205609544704。

qiita.com

Qiita「【秘密計算】最古のMulti-party Computationプロトコル「Yao's Garbled Circuit」とは」2020年12月11日

springer.com

link.springer.com

Zvi Galil, Stuart Haber, Moti Yung: "Cryptographic Computation: Secure Fault-Tolerant Protocols and the Public-Key Model". CRYPTO 1987: 135-155.
David Chaum, Ivan Damgård, Jeroen van de Graaf: "Multiparty Computations Ensuring Privacy of Each Party's Input and Correctness of the Result". 87-119.
Michael Backes, Birgit Pfitzmann, and Michael Waidner. "A general composition theorem for secure reactive systems." In Theory of Cryptography Conference, pp. 336-354. Springer, Berlin, Heidelberg, 2004.

taf.or.jp

岩本貢、太田和夫、西出隆志「マルチパーティ計算の情報理論的解析」電気通信普及財団研究調査助成報告書 No.31、2016年

wisc.edu

cs.wisc.edu

Andrew C. Yao, Protocols for secure computations (extended abstract)