6 papers
Efficient decision tree training with new data structure for secure multi-party computation
Koki Hamada, Dai Ikarashi, Ryo Kikuchi +1
We propose a secure multi-party computation (MPC) protocol that constructs a secret-shared decision tree for a given secret-shared dataset. The previous MPC-based decision tree tra…
Refined Computational Complexities of Hospitals/Residents Problem with Regional Caps
Koki Hamada, Shuichi Miyazaki
The Hospitals/Residents problem (HR) is a many-to-one matching problem whose solution concept is stability. It is widely used in assignment systems such as assigning medical studen…
Designing a Location Trace Anonymization Contest
Takao Murakami, Hiromi Arai, Koki Hamada +13
For a better understanding of anonymization methods for location traces, we have designed and held a location trace anonymization contest that deals with a long trace (400 events p…
Adam in Private: Secure and Fast Training of Deep Neural Networks with Adaptive Moment Estimation
Nuttapong Attrapadung, Koki Hamada, Dai Ikarashi +5
Privacy-preserving machine learning (PPML) aims at enabling machine learning (ML) algorithms to be used on sensitive data. We contribute to this line of research by proposing a fra…
Strongly Stable and Maximum Weakly Stable Noncrossing Matchings
Koki Hamada, Shuichi Miyazaki, Kazuya Okamoto
In IWOCA 2019, Ruangwises and Itoh introduced stable noncrossing matchings, where participants of each side are aligned on each of two parallel lines, and no two matching edges are…
Strategy-Proof Approximation Algorithms for the Stable Marriage Problem with Ties and Incomplete Lists
Koki Hamada, Shuichi Miyazaki, Hiroki Yanagisawa
In the stable marriage problem (SM), a mechanism that always outputs a stable matching is called a stable mechanism. One of the well-known stable mechanisms is the man-oriented Gal…