Zobrazeno 1 - 10
of 31
pro vyhledávání: '"Kazuma OHARA"'
Autor:
Yohei WATANABE, Takeshi NAKAI, Kazuma OHARA, Takuya NOJIMA, Yexuan LIU, Mitsugu IWAMOTO, Kazuo OHTA
Publikováno v:
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences. :1559-1577
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e2952a3a0224b46976714753d59918fa
https://doi.org/10.1587/transfun.2021eap1163
https://doi.org/10.1587/transfun.2021eap1163
Publikováno v:
Proceedings of the 2022 ACM on Asia Conference on Computer and Communications Security.
In this paper, we propose memory- and round-efficient protocols for securely evaluating arithmetic primitives. We focus on secure two-party computation over the ring ℤ2k that achieves security against semi-honest adversaries and works in the pre-pr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d5efbe394cd3073d9b759d2524ad3df9
https://doi.org/10.1145/3488932.3517407
https://doi.org/10.1145/3488932.3517407
Publikováno v:
Proceedings of the Twelfth ACM Conference on Data and Application Security and Privacy.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fce021f13f443429dcbf95288f709947
https://doi.org/10.1145/3508398.3511521
https://doi.org/10.1145/3508398.3511521
Publikováno v:
Applied Cryptography and Network Security ISBN: 9783031092336
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3b9ee5322705863e79501b49c2e79c18
https://doi.org/10.1007/978-3-031-09234-3_32
https://doi.org/10.1007/978-3-031-09234-3_32
Autor:
Hiraku Morita, Goichiro Hanaoaka, Nuttapong Attrapadung, Kazunari Tozawa, Takahiro Matsuda, Tadanori Teruya, Kazuma Ohara, Jacob C. N. Schuldt
Publikováno v:
CCS
In this paper we propose efficient two-party protocols for obliviously applying a (possibly random) linear group action to a data set. Our protocols capture various applications such as oblivious shuffles, circular shifts, matrix multiplications, to
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::fd209da136fac1c89376a16da4b704d8
https://doi.org/10.1145/3460120.3484584
https://doi.org/10.1145/3460120.3484584
Publikováno v:
CCS
We present a highly-scalable secure computation of graph algorithms, which hides all information about the topology of the graph or other input values associated with nodes or edges. The setting is where all nodes and edges of the graph are secret-sh
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9a3a1e56cc86958a3b0fad3ee47c2be1
https://doi.org/10.1145/3460120.3484560
https://doi.org/10.1145/3460120.3484560
Autor:
Kenji Kai, Kei Kawai, Kazuma Ohara, Yuki Minamoto, Yoshitaka Jin, Teruya Maki, Jun Noda, Tatsuo Shiina, Davaanyam, Enkhbaatar
Publikováno v:
SOLA; 2023, Vol. 19, p269-273, 5p
Publikováno v:
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences. (9):1079-1090
In recent years, multi-party computation (MPC) frameworks based on replicated secret sharing schemes (RSSS) have attracted the attention as a method to achieve high efficiency among known MPCs. However, the RSSS-based MPCs are still inefficient for s
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::232fca6108255c9857312ce763da673b
http://id.nii.ac.jp/1438/00009885/
http://id.nii.ac.jp/1438/00009885/
Publikováno v:
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences. :1101-1117
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::374c7e623bb3ded8ee078daab81eb794
https://doi.org/10.1587/transfun.e102.a.1101
https://doi.org/10.1587/transfun.e102.a.1101
Autor:
Takahiro Matsuda, Yusuke Sakai, Kazuma Ohara, Kazumasa Omote, Keita Emura, Yutaka Kawai, Goichiro Hanaoka
Publikováno v:
Security and Communication Networks, Vol 2019 (2019)
This paper introduces a new capability for group signatures called message-dependent opening. It is intended to weaken the high trust placed on the opener; i.e., no anonymity against the opener is provided by an ordinary group signature scheme. In a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6448a9bd8f7e40c397de011681fcd55c
https://doi.org/10.1155/2019/4872403
https://doi.org/10.1155/2019/4872403