default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKoki Hamada
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j18]Koki Hamada
, Shuichi Miyazaki:
Refined computational complexities of Hospitals/Residents problem with regional caps. Theor. Comput. Sci. 989: 114389 (2024)- [i18]Gilad Asharov, Koki Hamada, Dai Ikarashi, Ryo Kikuchi, Ariel Nof, Benny Pinkas, Junichi Tomida:
Secure Statistical Analysis on Multiple Datasets: Join and Group-By. IACR Cryptol. ePrint Arch. 2024: 141 (2024) - 2023
- [j17]Koji Chida, Koki Hamada, Dai Ikarashi, Ryo Kikuchi, Daniel Genkin, Yehuda Lindell, Ariel Nof:
Fast Large-Scale Honest-Majority MPC for Malicious Adversaries. J. Cryptol. 36(3): 15 (2023) - [j16]Takao Murakami, Hiromi Arai, Koki Hamada, Takuma Hatano, Makoto Iguchi, Hiroaki Kikuchi, Atsushi Kuromasa, Hiroshi Nakagawa, Yuichi Nakamura, Kenshiro Nishiyama, Ryo Nojima, Hidenobu Oguri, Chiemi Watanabe, Akira Yamada, Takayasu Yamaguchi, Yuji Yamaoka:
Designing a Location Trace Anonymization Contest. Proc. Priv. Enhancing Technol. 2023(1): 225-243 (2023) - [j15]Koki Hamada, Dai Ikarashi, Ryo Kikuchi, Koji Chida:
Efficient decision tree training with new data structure for secure multi-party computation. Proc. Priv. Enhancing Technol. 2023(1): 343-364 (2023) - [c22]Koji Chida, Koki Hamada, Atsunori Ichikawa, Masanobu Kii, Junichi Tomida:
Communication-Efficient Inner Product Private Join and Compute with Cardinality. AsiaCCS 2023: 678-688 - [c21]Gilad Asharov, Koki Hamada, Ryo Kikuchi, Ariel Nof, Benny Pinkas, Junichi Tomida:
Secure Statistical Analysis on Multiple Datasets: Join and Group-By. CCS 2023: 3298-3312 - [c20]Atsunori Ichikawa, Ilan Komargodski, Koki Hamada, Ryo Kikuchi, Dai Ikarashi:
3-Party Secure Computation for RAMs: Optimal and Concretely Efficient. TCC (1) 2023: 471-502 - [i17]Atsunori Ichikawa, Ilan Komargodski, Koki Hamada, Ryo Kikuchi, Dai Ikarashi:
3-Party Secure Computation for RAMs: Optimal and Concretely Efficient. IACR Cryptol. ePrint Arch. 2023: 516 (2023) - 2022
- [j14]Nuttapong Attrapadung, Koki Hamada, Dai Ikarashi, Ryo Kikuchi, Takahiro Matsuda, Ibuki Mishina, Hiraku Morita, Jacob C. N. Schuldt:
Adam in Private: Secure and Fast Training of Deep Neural Networks with Adaptive Moment Estimation. Proc. Priv. Enhancing Technol. 2022(4): 746-767 (2022) - [c19]Gilad Asharov, Koki Hamada, Dai Ikarashi, Ryo Kikuchi, Ariel Nof, Benny Pinkas, Katsumi Takahashi, Junichi Tomida:
Efficient Secure Three-Party Sorting with Applications to Data Analysis and Heavy Hitters. CCS 2022: 125-138 - [c18]Koki Hamada, Shuichi Miyazaki:
Refined Computational Complexities of Hospitals/Residents Problem with Regional Caps. COCOON 2022: 333-344 - [i16]Koji Chida, Koki Hamada, Atsunori Ichikawa, Masanobu Kii, Junichi Tomida:
Private Intersection-Weighted-Sum. IACR Cryptol. ePrint Arch. 2022: 338 (2022) - [i15]Gilad Asharov, Koki Hamada, Dai Ikarashi, Ryo Kikuchi, Ariel Nof, Benny Pinkas, Katsumi Takahashi, Junichi Tomida:
Efficient Secure Three-Party Sorting with Applications to Data Analysis and Heavy Hitters. IACR Cryptol. ePrint Arch. 2022: 1595 (2022) - 2021
- [j13]Koki Hamada, Shuichi Miyazaki, Kazuya Okamoto:
Strongly Stable and Maximum Weakly Stable Noncrossing Matchings. Algorithmica 83(9): 2678-2696 (2021) - [j12]Takao Murakami, Koki Hamada, Yusuke Kawamoto, Takuma Hatano:
Privacy-Preserving Multiple Tensor Factorization for Synthesizing Large-Scale Location Traces with Cluster-Specific Features. Proc. Priv. Enhancing Technol. 2021(2): 5-26 (2021) - [i14]Nuttapong Attrapadung, Koki Hamada, Dai Ikarashi, Ryo Kikuchi, Takahiro Matsuda, Ibuki Mishina, Hiraku Morita, Jacob C. N. Schuldt:
Adam in Private: Secure and Fast Training of Deep Neural Networks with Adaptive Moment Estimation. CoRR abs/2106.02203 (2021) - [i13]Koki Hamada, Shuichi Miyazaki:
Refined Computational Complexities of Hospitals/Residents Problem with Regional Caps. CoRR abs/2107.03123 (2021) - [i12]Takao Murakami, Hiromi Arai, Koki Hamada, Takuma Hatano, Makoto Iguchi, Hiroaki Kikuchi, Atsushi Kuromasa, Hiroshi Nakagawa, Yuichi Nakamura, Kenshiro Nishiyama, Ryo Nojima, Hidenobu Oguri, Chiemi Watanabe, Akira Yamada, Takayasu Yamaguchi, Yuji Yamaoka:
Designing a Location Trace Anonymization Contest. CoRR abs/2107.10407 (2021) - [i11]Koki Hamada, Dai Ikarashi, Ryo Kikuchi, Koji Chida:
Efficient decision tree training with new data structure for secure multi-party computation. CoRR abs/2112.12906 (2021) - [i10]Nuttapong Attrapadung, Koki Hamada, Dai Ikarashi, Ryo Kikuchi, Takahiro Matsuda, Ibuki Mishina, Hiraku Morita, Jacob C. N. Schuldt:
Adam in Private: Secure and Fast Training of Deep Neural Networks with Adaptive Moment Estimation. IACR Cryptol. ePrint Arch. 2021: 736 (2021) - 2020
- [c17]Koki Hamada, Shuichi Miyazaki, Kazuya Okamoto:
Strongly Stable and Maximum Weakly Stable Noncrossing Matchings. IWOCA 2020: 304-315 - [i9]Koki Hamada, Shuichi Miyazaki, Kazuya Okamoto:
Strongly Stable and Maximum Weakly Stable Noncrossing Matchings. CoRR abs/2001.08468 (2020)
2010 – 2019
- 2019
- [c16]Ryo Kikuchi, Nuttapong Attrapadung, Koki Hamada, Dai Ikarashi, Ai Ishida, Takahiro Matsuda, Yusuke Sakai, Jacob C. N. Schuldt:
Field Extension in Secret-Shared Form and Its Applications to Efficient Secure Computation. ACISP 2019: 343-361 - [c15]Atsunori Ichikawa, Wakaha Ogata, Koki Hamada, Ryo Kikuchi:
Efficient Secure Multi-Party Protocols for Decision Tree Classification. ACISP 2019: 362-380 - [c14]Koki Hamada, Shuichi Miyazaki, Hiroki Yanagisawa:
Strategy-Proof Approximation Algorithms for the Stable Marriage Problem with Ties and Incomplete Lists. ISAAC 2019: 9:1-9:14 - [i8]Koki Hamada, Shuichi Miyazaki, Hiroki Yanagisawa:
Strategy-Proof Approximation Algorithms for the Stable Marriage Problem with Ties and Incomplete Lists. CoRR abs/1902.05678 (2019) - [i7]Takao Murakami, Koki Hamada, Yusuke Kawamoto, Takuma Hatano:
Privacy-Preserving Multiple Tensor Factorization for Synthesizing Large-Scale Location Traces. CoRR abs/1911.04226 (2019) - [i6]Ryo Kikuchi, Nuttapong Attrapadung, Koki Hamada, Dai Ikarashi, Ai Ishida, Takahiro Matsuda, Yusuke Sakai, Jacob C. N. Schuldt:
Field Extension in Secret-Shared Form and Its Applications to Efficient Secure Computation. IACR Cryptol. ePrint Arch. 2019: 386 (2019) - [i5]Koji Chida, Koki Hamada, Dai Ikarashi, Ryo Kikuchi, Naoto Kiribuchi, Benny Pinkas:
An Efficient Secure Three-Party Sorting Protocol with an Honest Majority. IACR Cryptol. ePrint Arch. 2019: 695 (2019) - 2018
- [j11]Hiroaki Kikuchi, Takayasu Yamaguchi, Koki Hamada, Yuji Yamaoka, Hidenobu Oguri, Jun Sakuma:
Study on Record Linkage of Anonymizied Data. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 101-A(1): 19-28 (2018) - [j10]Ryo Kikuchi, Koji Chida, Dai Ikarashi, Koki Hamada:
Password-Based Authentication Protocol for Secret-Sharing-Based Multiparty Computation. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 101-A(1): 51-63 (2018) - [j9]Ryo Nojima, Hidenobu Oguri, Hiroaki Kikuchi, Hiroshi Nakagawa, Koki Hamada, Takao Murakami, Yuji Yamaoka, Chiemi Watanabe:
How to Handle Excessively Anonymized Datasets. J. Inf. Process. 26: 477-485 (2018) - [c13]Ryo Kikuchi, Dai Ikarashi, Takahiro Matsuda, Koki Hamada, Koji Chida:
Efficient Bit-Decomposition and Modulus-Conversion Protocols with an Honest Majority. ACISP 2018: 64-82 - [c12]Koji Chida, Koki Hamada, Dai Ikarashi, Ryo Kikuchi, Benny Pinkas:
High-Throughput Secure AES Computation. WAHC@CCS 2018: 13-24 - [c11]Koji Chida, Daniel Genkin, Koki Hamada, Dai Ikarashi, Ryo Kikuchi, Yehuda Lindell, Ariel Nof:
Fast Large-Scale Honest-Majority MPC for Malicious Adversaries. CRYPTO (3) 2018: 34-64 - [i4]Ryo Kikuchi, Dai Ikarashi, Takahiro Matsuda, Koki Hamada, Koji Chida:
Efficient Bit-Decomposition and Modulus-Conversion Protocols with an Honest Majority. IACR Cryptol. ePrint Arch. 2018: 387 (2018) - [i3]Koji Chida, Daniel Genkin, Koki Hamada, Dai Ikarashi, Ryo Kikuchi, Yehuda Lindell, Ariel Nof:
Fast Large-Scale Honest-Majority MPC for Malicious Adversaries. IACR Cryptol. ePrint Arch. 2018: 570 (2018) - 2017
- [j8]Ryo Kikuchi, Dai Ikarashi, Koji Chida, Koki Hamada, Wakaha Ogata:
Computational SS and conversion protocols in both active and passive settings. IET Inf. Secur. 11(5): 287-293 (2017) - 2016
- [j7]Koki Hamada, Kazuo Iwama, Shuichi Miyazaki:
The Hospitals/Residents Problem with Lower Quotas. Algorithmica 74(1): 440-465 (2016) - [j6]Toru Mano, Takeru Inoue, Dai Ikarashi, Koki Hamada, Kimihiro Mizutani, Osamu Akashi:
Efficient Virtual Network Optimization Across Multiple Domains Without Revealing Private Information. IEEE Trans. Netw. Serv. Manag. 13(3): 477-488 (2016) - [c10]Hiroaki Kikuchi, Takayasu Yamaguchi, Koki Hamada, Yuji Yamaoka, Hidenobu Oguri, Jun Sakuma:
Ice and Fire: Quantifying the Risk of Re-identification and Utility in Data Anonymization. AINA 2016: 1035-1042 - [c9]Hiroaki Kikuchi, Takayasu Yamaguchi, Koki Hamada, Yuji Yamaoka, Hidenobu Oguri, Jun Sakuma:
A Study from the Data Anonymization Competition Pwscup 2015. DPM/QASA@ESORICS 2016: 230-237 - [c8]Eizen Kimura, Koki Hamada, Ryo Kikuchi, Koji Chida, Kazuya Okamoto, Shirou Manabe, Tomohiro Kuroda, Yasushi Matsumura, Toshihiro Takeda, Naoki Mihara:
Evaluation of Secure Computation in a Distributed Healthcare Setting. MIE 2016: 152-156 - 2015
- [j5]Ryo Kikuchi, Koji Chida, Dai Ikarashi, Wakaha Ogata, Koki Hamada, Katsumi Takahashi:
Secret Sharing with Share-Conversion: Achieving Small Share-Size and Extendibility to Multiparty Computation. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 98-A(1): 213-222 (2015) - [j4]Ryo Kikuchi, Dai Ikarashi, Koki Hamada, Koji Chida:
Adaptively and Unconditionally Secure Conversion Protocols between Ramp and Linear Secret Sharing. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 98-A(1): 223-231 (2015) - [c7]Ryo Kikuchi, Koji Chida, Dai Ikarashi, Koki Hamada:
Practical Password-Based Authentication Protocol for Secret Sharing Based Multiparty Computation. CANS 2015: 179-196 - 2014
- [c6]Toru Mano, Takeru Inoue, Dai Ikarashi, Koki Hamada, Kimihiro Mizutani, Osamu Akashi:
Efficient virtual network optimization across multiple domains without revealing private information. ICCCN 2014: 1-8 - [i2]Koki Hamada, Dai Ikarashi, Koji Chida, Katsumi Takahashi:
Oblivious Radix Sort: An Efficient Sorting Algorithm for Practical Secure Multi-party Computation. IACR Cryptol. ePrint Arch. 2014: 121 (2014) - [i1]Dai Ikarashi, Ryo Kikuchi, Koki Hamada, Koji Chida:
Actively Private and Correct MPC Scheme in t<n/2 from Passively Secure Schemes with Small Overhead. IACR Cryptol. ePrint Arch. 2014: 304 (2014) - 2013
- [j3]Koki Hamada:
A Picturesque Maze Generation Algorithm with Any Given Endpoints. Inf. Media Technol. 8(3): 710-714 (2013) - [j2]Koki Hamada:
A Picturesque Maze Generation Algorithm with Any Given Endpoints. J. Inf. Process. 21(3): 393-397 (2013) - [c5]Ryo Kikuchi, Koji Chida, Dai Ikarashi, Koki Hamada, Katsumi Takahashi:
Secret Sharing Schemes with Conversion Protocol to Achieve Short Share-Size and Extendibility to Multiparty Computation. ACISP 2013: 419-434 - 2012
- [c4]Koki Hamada, Ryo Kikuchi, Dai Ikarashi, Koji Chida, Katsumi Takahashi:
Practically Efficient Multi-party Sorting Protocols from Comparison Sort Algorithms. ICISC 2012: 202-216 - [c3]Rie Shigetomi Yamaguchi, Keiichi Hirota, Koki Hamada, Katsumi Takahashi, Kazutaka Matsuzaki, Jun Sakuma, Yasuyuki Shirai:
Applicability of existing anonymization methods to large location history data in urban travel. SMC 2012: 997-1004 - 2011
- [c2]Koki Hamada, Kazuo Iwama, Shuichi Miyazaki:
The Hospitals/Residents Problem with Quota Lower Bounds. ESA 2011: 180-191
2000 – 2009
- 2009
- [j1]Koki Hamada, Kazuo Iwama, Shuichi Miyazaki:
An improved approximation lower bound for finding almost stable maximum matchings. Inf. Process. Lett. 109(18): 1036-1040 (2009) - 2008
- [c1]Masaaki Iiyama, Koki Hamada, Koh Kakusho, Michihiko Minoh:
Usage of needle maps and shadows to overcome depth edges in depth map reconstruction. ICPR 2008: 1-4
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-02 00:12 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
