Ryo Nojima

dblp:25/4427 · DBLP profile ↗
← Back
14ranked-venue papers
4as first author
6since 2021 · last 2026
0000-0002-2955-2920ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Security and privacy · 13 · 3 first-author · 5 since 2021Theory of computation · 2 · 1 since 2021Artificial intelligence and machine learning · 1 · 1 first-author · 1 since 2021
YearPublicationVenuePosition
2026 Practical Private Approximate Similarity Computation
Ryo Nojima, Lihua Wang 0001
ICISSP (2)1
2024 Security Evaluation of Decision Tree Meets Data Anonymization
Ryousuke Wakabayashi, Lihua Wang 0001, Ryo Nojima, Atsushi Waseda
ICISSP3
2024 Simple Privacy-Preserving Federated Learning with Different Encryption Keys
abstract
Federated learning is a method where multiple participants collaboratively train a model using machine learning techniques, such as deep learning, while keeping each participant's data private through the use of a central server. However, there are cases in which participant input information is leaked to the server. To solve this problem, several protocols have been proposed. In particular, Phong et al. (in IEEE TIFS 2018) proposed a protocol that protects participant information against a server using homomorphic encryption. Later, Park et al. (in ICTC 2022) proposed an improved protocol, where each client has a different secret-key for the homomorphic encryption. In this paper, we show that the Park et al.'s protocol has some weakness and propose the secure one based on the previously proposed protocols.
Haruto Yokomitsu, Ryo Nojima, Lihua Wang 0001
ISITA2
2023 Differential Private (Random) Decision Tree Without Adding Noise
Ryo Nojima, Lihua Wang 0001
ICONIP (9)1
2023 Designing a Location Trace Anonymization Contest
abstract
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 per user) and fine-grained locations (1024 regions). In our contest, each team anonymizes her original traces, and then the other teams perform privacy attacks against the anonymized traces. In other words, both defense and attack compete together, which is close to what happens in real life. Prior to our contest, we show that re-identification alone is insufficient as a privacy risk and that trace inference should be added as an additional risk. Specifically, we show an example of anonymization that is perfectly secure against re-identification and is not secure against trace inference. Based on this, our contest evaluates both the re-identification risk and trace inference risk and analyzes their relationship. Through our contest, we show several findings in a situation where both defense and attack compete together. In particular, we show that an anonymization method secure against trace inference is also secure against re-identification under the presence of appropriate pseudonymization. We also report defense and attack algorithms that won first place, and analyze the utility of anonymized traces submitted by teams in various applications such as POI recommendation and geo-data analysis.
Takao Murakami, Hiromi Arai, Koki Hamada, Takuma Hatano, Makoto Iguchi, Hiroaki Kikuchi, Atsushi Kuromasa, Hiroshi Nakagawa, Yuichi Nakamura 0004, Kenshiro Nishiyama, Ryo Nojima, Hidenobu Oguri, Chiemi Watanabe, Akira Yamada 0001, Takayasu Yamaguchi, Yuji Yamaoka
Proc. Priv. Enhancing Technol.11
2022 Construction of a Support Tool for User Reading of Privacy Policies and Assessment of its User Impact
Sachiko Kanamori, Hirotsune Sato, Naoya Tabata, Ryo Nojima
ICISSP4
2016 How does the willingness to provide private information change?
Sachiko Kanamori, Ryo Nojima, Hirotsune Sato, Naoya Tabata, Kanako Kawaguchi, Hirohiko Suwa, Atsushi Iwai
ISITA2
2016 Analyzing Randomized Response Mechanisms Under Differential Privacy
Atsushi Waseda, Ryo Nojima
ISC2
2015 POSTER: PRINCESS: A Secure Cloud File Storage System for Managing Data with Hierarchical Levels of Sensitivity
abstract
PRINCESS (Proxy Re-encryption with INd-Cca security in an Encrypted file Storage System) is a secure storage system which utilizes special proxy re-encryption technology. With PRINCESS, the files encrypted in accordance with the confidentiality levels can be shared among appointed users while remaining encrypted. In this poster/demo, we show the efficiency of PRINCESS, which can be applied to a Body Area Network information sharing, automobile information sharing, etc. This system facilitates the potential for new services that require privacy data to be shared securely via cloud technology.
Lihua Wang 0001, Takuya Hayashi 0001, Sachiko Kanamori, Atsushi Waseda, Ryo Nojima, Shiho Moriai
CCS5
2012 Relation between Verifiable Random Functions and Convertible Undeniable Signatures, and New Constructions
Kaoru Kurosawa, Ryo Nojima, Le Trieu Phong
ACISP2
2011 Generic Fully Simulatable Adaptive Oblivious Transfer
Kaoru Kurosawa, Ryo Nojima, Le Trieu Phong
ACNS2
2009 Simple Adaptive Oblivious Transfer without Random Oracle
Kaoru Kurosawa, Ryo Nojima
ASIACRYPT2
2009 A Storage Efficient Redactable Signature in the Standard Model
Ryo Nojima, Jin Tamura, Youki Kadobayashi, Hiroaki Kikuchi
ISC1
2008 Semantic security for the McEliece cryptosystem without random oracles
Ryo Nojima, Hideki Imai, Kazukuni Kobara, Kirill Morozov
Des. Codes Cryptogr.1