Zobrazeno 1 - 10
of 45
pro vyhledávání: '"Koji Chida"'
Publikováno v:
Journal of Cryptology. 36
Publikováno v:
NTT Technical Review. :40-46
Autor:
Tetsuya Okuda, Koji Chida, Daisuke Shirai, Sakae Chikara, Tsunekazu Saito, Misato Nakabayashi, Kazuki Yamamura, Yuri Tanaka, Katsuyuki Natsukawa, Koichi Takasugi
Publikováno v:
NTT Technical Review. 20:32-39
Autor:
Tomoaki Washio, Yoshinori Orime, Tetsushi Morita, Koji Chida, Kazuo Morimura, Yoshihito Oshima
Publikováno v:
NTT Technical Review. 19:75-80
Publikováno v:
Economic Review / Keizai Kenkyū. Apr2018, Vol. 69 Issue 2, p145-159. 13p.
Publikováno v:
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences. :51-63
Publikováno v:
IET Information Security. 11:287-293
Secret sharing (SS) has been extensively studied as both a means of secure data storage and a fundamental building block for multiparty computation (MPC). For these purposes, code-efficiency and MPC-suitability are required for SS but they are incomp
Autor:
Takashi Nishimura, Tomio Arai, Koji Chida, Mitsuhiro Kawata, Atsushi Yoshida, Yoshiki Misawa, Yoko Matsuda, Yuta Nakano, Atsuko Seki, Ken Kikuchi, Jun Tanaka, Ryoko Asami
Publikováno v:
Cardiovascular Pathology. 28:14-17
Aspergillus udagawae has morphological similarities to Aspergillusfumigatus; however, it shows a low susceptibility to common antifungal drugs and poor in vitro sporulation. We present the first reported case of infectious endocarditis caused by A. u
Autor:
Eizen, Kimura, Satoshi, Hasegawa, Koji, Chida, Shoko, Gamo, Satoshi, Irino, Haku, Ishida, Yukio, Kurihara
Publikováno v:
Studies in health technology and informatics. 245
We analyze the deterioration of clinical data quality due to anonymization. The result shows that data quality remained high with micro-aggregation and also verify the availability of noise addition to prevent illegal re-identification by matching an
Publikováno v:
Information Security and Privacy ISBN: 9783319936376
ACISP
ACISP
In this paper, we propose secret-sharing-based bit-decomposition and modulus-conversion protocols for a prime order ring \(\mathbb {Z}_p\) with an honest majority: an adversary can corrupt \(k-1\) parties of n parties and \(2k-1 \le n\). Our protocol
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::03831da92363281a7ab9af5864e963e4
https://doi.org/10.1007/978-3-319-93638-3_5
https://doi.org/10.1007/978-3-319-93638-3_5