Zobrazeno 1 - 10
of 23
pro vyhledávání: '"Dai Ikarashi"'
Publikováno v:
Journal of Cryptology. 36
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7ab2e13b5ade0c66e14aaf1245ecadf3
https://doi.org/10.1007/s00145-023-09453-7
https://doi.org/10.1007/s00145-023-09453-7
Autor:
Gilad Asharov, Koki Hamada, Dai Ikarashi, Ryo Kikuchi, Ariel Nof, Benny Pinkas, Katsumi Takahashi, Junichi Tomida
Publikováno v:
Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::41358ed56fc8f5d2fc033ac7e53d63cc
https://doi.org/10.1145/3548606.3560691
https://doi.org/10.1145/3548606.3560691
Publikováno v:
CC
Stateful packrat parsing is an algorithm for parsing syntaxes that have context-sensitive features. It is a well-known knowledge among researchers that the running time of stateful packrat parsing is linear for real-world grammars, as demonstrated in
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b8a6a135665045d99395f06109eeb89e
https://doi.org/10.1145/3377555.3377898
https://doi.org/10.1145/3377555.3377898
Autor:
Ryo Kikuchi, Dai Ikarashi
Publikováno v:
IEICE ESS Fundamentals Review. 12:12-20
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::52c15184ea670417237793152f0ec982
https://doi.org/10.1587/essfr.12.1_12
https://doi.org/10.1587/essfr.12.1_12
Publikováno v:
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences. :51-63
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7978ed9d07dcf8d059acf9346162156b
https://doi.org/10.1587/transfun.e101.a.51
https://doi.org/10.1587/transfun.e101.a.51
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
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5bf7e8abb3f9d0cf41b71b28bd1471e8
https://doi.org/10.1049/iet-ifs.2016.0276
https://doi.org/10.1049/iet-ifs.2016.0276
Autor:
Ai Ishida, Ryo Kikuchi, Jacob C. N. Schuldt, Yusuke Sakai, Dai Ikarashi, Takahiro Matsuda, Nuttapong Attrapadung, Koki Hamada
Publikováno v:
Information Security and Privacy ISBN: 9783030215477
ACISP
ACISP
Secure computation enables participating parties to jointly compute a function over their inputs while keeping them private. Secret sharing plays an important role for maintaining privacy during the computation. In most schemes, secret sharing over t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::785bc4f688ab2e3170f6a93bcee367ba
https://doi.org/10.1007/978-3-030-21548-4_19
https://doi.org/10.1007/978-3-030-21548-4_19
Efficient Virtual Network Optimization Across Multiple Domains Without Revealing Private Information
Publikováno v:
ICCCN
Building optimal virtual networks across multiple domains is an essential technology for offering flexible network services. However, existing research is founded on an unrealistic assumption: providers will share their private information including
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8abdeee0d985b53cb186fc599ab28fe5
https://doi.org/10.1109/tnsm.2016.2582179
https://doi.org/10.1109/tnsm.2016.2582179
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
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783319968773
CRYPTO (3)
CRYPTO (3)
Protocols for secure multiparty computation enable a set of parties to compute a function of their inputs without revealing anything but the output. The security properties of the protocol must be preserved in the presence of adversarial behavior. Th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::613f9855c9c4b5b24c8c785b028468b4
https://doi.org/10.1007/978-3-319-96878-0_2
https://doi.org/10.1007/978-3-319-96878-0_2