Shun Takagi
Research Subjects
Shun Takagi has a total of 17 co-authors. Here are the top co-authors by number of shared publications:
- Masatoshi Yoshikawa
Osaka Seikei University
2 shared publications - Yang Cao
Tokyo Institute of Technology
2 shared publications - Haru Terashima
Graduate School of Engineering, Nagoya University
1 shared publication - Hidehito Gomi
Yahoo Japan Corporation
1 shared publication - Kazuyuki Shoji
Graduate School of Engineering, Nagoya University
1 shared publication - Kenta Urano
Graduate School of Engineering, Nagoya University
1 shared publication
Latest Publications
- Open Access
- 14 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 6878-6892
Simple and Concretely Efficient Hierarchical Doubly ORAM
- 14 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 6878-6892
Open AccessSimple and Concretely Efficient Hierarchical Doubly ORAM
- Open Access
- 12 May 2026
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Management of Data
- Vol. 4 (2) , 1-26
Analysis of Shuffling Beyond Pure Local Differential Privacy
Shuffling is a powerful way to amplify privacy of a local randomizer in private distributed data analysis. Most existing analyses of how shuffling amplifies privacy are based on the pure local differential privacy (DP) parameter ε 0 . This paper raises the question of whether ε 0 adequately captures the privacy amplification. For example, since the Gaussian mechanism does not satisfy pure local DP for any finite ε 0 , does it follow that shuffling yields weak amplification? To solve this problem, we revisit the privacy blanket bound of Balle et al. (the blanket divergence ) and develop a direct asymptotic analysis that bypasses ε 0 . Our key finding is that, asymptotically, the blanket divergence depends on the local mechanism only through a single scalar parameter χ and that this dependence is monotonic. Therefore, this parameter serves as a proxy for shuffling efficiency, which we call the shuffle index. By applying this analysis to both upper and lower bounds of the shuffled mechanism's privacy profile, we obtain a band for its privacy guarantee through shuffle indices. Furthermore, we derive a simple structural, necessary and sufficient condition on the local randomizer under which this band collapses asymptotically. k -RR families with k ≥3 satisfy this condition, while for generalized Gaussian mechanisms the condition may not hold but the resulting band remains tight. Finally, we complement the asymptotic theory with an FFT-based algorithm for computing the blanket divergence at finite n , which offers rigorously controlled relative error and near-linear running time in n , providing a practical numerical analysis for shuffle DP.
- 12 May 2026
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Management of Data
- Vol. 4 (2) , 1-26
Open AccessAnalysis of Shuffling Beyond Pure Local Differential Privacy
Shuffling is a powerful way to amplify privacy of a local randomizer in private distributed data analysis. Most existing analyses of how shuffling amplifies privacy are based on the pure local differential privacy (DP) parameter ε 0 . This paper raises the question of whether ε 0 adequately captures the privacy amplification. For example, since the Gaussian mechanism does not satisfy pure local DP for any finite ε 0 , does it follow that shuffling yields weak amplification? To solve this problem, we revisit the privacy blanket bound of Balle et al. (the blanket divergence ) and develop a direct asymptotic analysis that bypasses ε 0 . Our key finding is that, asymptotically, the blanket divergence depends on the local mechanism only through a single scalar parameter χ and that this dependence is monotonic. Therefore, this parameter serves as a proxy for shuffling efficiency, which we call the shuffle index. By applying this analysis to both upper and lower bounds of the shuffled mechanism's privacy profile, we obtain a band for its privacy guarantee through shuffle indices. Furthermore, we derive a simple structural, necessary and sufficient condition on the local randomizer under which this band collapses asymptotically. k -RR families with k ≥3 satisfy this condition, while for generalized Gaussian mechanisms the condition may not hold but the resulting band remains tight. Finally, we complement the asymptotic theory with an FFT-based algorithm for computing the blanket divergence at finite n , which offers rigorously controlled relative error and near-linear running time in n , providing a practical numerical analysis for shuffle DP.
- Open Access
- 29 October 2024
- Published by Association for Computing Machinery (ACM)
- p. 5-9
Time-series Stay Frequency for Multi-City Next Location Prediction using Multiple BERTs
Human Mobility Prediction Challenge 2024 was organized to compare human future movement prediction methods using a unified dataset. The challenge focuses on human movement prediction in multiple cities with varying numbers of users. Many existing movement prediction methods train deep learning models using large-scale movement histories from cities and make predictions. While cities with large users have sufficient training data, smaller cities with fewer users may face challenges due to insufficient data, raising concerns about lower prediction accuracy. Additionally, it is difficult to treat stay locations between different cities' movement histories due to differences in spatial area arrangement, making it challenging to share data across cities. To address this issue, we propose human movement prediction method that utilizes time-series stay frequency patterns, which can be commonly applied across different cities. This method demonstrated superiority in predicting movements in cities with fewer users compared to models trained and predicted using only the movement histories of the target city. Furthermore, the method achieved top 10 prediction accuracy in HuMob Challenge 2024.
- 29 October 2024
- Published by Association for Computing Machinery (ACM)
- p. 5-9
Open AccessTime-series Stay Frequency for Multi-City Next Location Prediction using Multiple BERTs
Human Mobility Prediction Challenge 2024 was organized to compare human future movement prediction methods using a unified dataset. The challenge focuses on human movement prediction in multiple cities with varying numbers of users. Many existing movement prediction methods train deep learning models using large-scale movement histories from cities and make predictions. While cities with large users have sufficient training data, smaller cities with fewer users may face challenges due to insufficient data, raising concerns about lower prediction accuracy. Additionally, it is difficult to treat stay locations between different cities' movement histories due to differences in spatial area arrangement, making it challenging to share data across cities. To address this issue, we propose human movement prediction method that utilizes time-series stay frequency patterns, which can be commonly applied across different cities. This method demonstrated superiority in predicting movements in cities with fewer users compared to models trained and predicted using only the movement histories of the target city. Furthermore, the method achieved top 10 prediction accuracy in HuMob Challenge 2024.
- 13 July 2022
- Published by Springer Nature
- p. 68-86
Mitigating Privacy Vulnerability Caused by Map Asymmetry
- 13 July 2022
- Published by Springer Nature
- p. 68-86
Mitigating Privacy Vulnerability Caused by Map Asymmetry
- 11 June 2019
- Published by Springer Nature
- p. 143-163
Geo-Graph-Indistinguishability: Protecting Location Privacy for LBS over Road Networks
- 11 June 2019
- Published by Springer Nature
- p. 143-163
Geo-Graph-Indistinguishability: Protecting Location Privacy for LBS over Road Networks