default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRyo Nojima
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c18]Ryousuke Wakabayashi, Lihua Wang, Ryo Nojima, Atsushi Waseda:
Security Evaluation of Decision Tree Meets Data Anonymization. ICISSP 2024: 853-860- 2023
- [j13]Sachiko Kanamori, Hirotsune Sato, Naoya Tabata
, Ryo Nojima:
Construction of a Support Tool for Japanese User Reading of Privacy Policies and Assessment of its User Impact. IEICE Trans. Inf. Syst. 106(5): 856-867 (2023) - [j12]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) - [c17]Kaisei Kajita, Keita Emura, Kazuto Ogawa, Ryo Nojima, Go Ohtake:
Continuous Group Key Agreement with Flexible Authorization and Its Applications. IWSPA@CODASPY 2023: 3-13 - [c16]Ryo Nojima, Lihua Wang:
Differential Private (Random) Decision Tree Without Adding Noise. ICONIP (9) 2023: 162-174 - 2022
- [j11]Sachiko Kanamori, Taeko Abe, Takuma Ito, Keita Emura, Lihua Wang, Shuntaro Yamamoto, Le Trieu Phong, Kaien Abe, Sangwook Kim, Ryo Nojima, Seiichi Ozawa, Shiho Moriai:
Privacy-Preserving Federated Learning for Detecting Fraudulent Financial Transactions in Japanese Banks. J. Inf. Process. 30: 789-795 (2022) - [j10]Keita Emura, Kaisei Kajita, Ryo Nojima, Kazuto Ogawa, Go Ohtake:
Providing Membership Privacy to the Asynchronous Ratcheting Trees Protocol without losing Scalability. J. Wirel. Mob. Networks Ubiquitous Comput. Dependable Appl. 13(4): 105-123 (2022) - [c15]Keita Emura, Ryoma Ito, Sachiko Kanamori, Ryo Nojima, Yohei Watanabe:
State-free End-to-End Encrypted Storage and Chat Systems based on Searchable Encryption. ICEIS (2) 2022: 106-113 - [c14]Sachiko Kanamori, Hirotsune Sato, Naoya Tabata, Ryo Nojima:
Construction of a Support Tool for User Reading of Privacy Policies and Assessment of its User Impact. ICISSP 2022: 412-419 - [c13]Keita Emura, Kaisei Kajita, Ryo Nojima, Kazuto Ogawa, Go Ohtake:
Membership Privacy for Asynchronous Group Messaging. WISA 2022: 131-142 - [i12]Keita Emura, Kaisei Kajita, Ryo Nojima, Kazuto Ogawa, Go Ohtake:
Membership Privacy for Asynchronous Group Messaging. IACR Cryptol. ePrint Arch. 2022: 46 (2022) - [i11]Kaisei Kajita, Keita Emura, Kazuto Ogawa, Ryo Nojima, Go Ohtake:
Continuous Group Key Agreement with Flexible Authorization and Its Applications. IACR Cryptol. ePrint Arch. 2022: 1768 (2022) - 2021
- [e1]Toru Nakanishi, Ryo Nojima:
Advances in Information and Computer Security - 16th International Workshop on Security, IWSEC 2021, Virtual Event, September 8-10, 2021, Proceedings. Lecture Notes in Computer Science 12835, Springer 2021, ISBN 978-3-030-85986-2 [contents] - [i10]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) - [i9]Yoshinori Aono, Sitong Liu, Tomoki Tanaka, Shumpei Uno, Rodney Van Meter, Naoyuki Shinohara, Ryo Nojima:
The Present and Future of Discrete Logarithm Problems on Noisy Quantum Computers. CoRR abs/2111.06102 (2021) - [i8]Keita Emura, Ryoma Ito, Sachiko Kanamori, Ryo Nojima, Yohei Watanabe:
State-free End-to-End Encrypted Storage and Chat Systems based on Searchable Encryption. IACR Cryptol. ePrint Arch. 2021: 953 (2021) - 2020
- [c12]Atsushi Waseda, Ryo Nojima:
On Limitation of Plausible Deniability. IWSEC 2020: 207-217
2010 – 2019
- 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) - 2016
- [j8]Takashi Kurokawa, Ryo Nojima, Shiho Moriai:
On the security of CBC Mode in SSL3.0 and TLS1.0. J. Internet Serv. Inf. Secur. 6(1): 2-19 (2016) - [c11]Sachiko Kanamori, Ryo Nojima, Hirotsune Sato, Naoya Tabata, Kanako Kawaguchi, Hirohiko Suwa, Atsushi Iwai:
How does the willingness to provide private information change? ISITA 2016: 418-422 - [c10]Atsushi Waseda, Ryo Nojima:
Analyzing Randomized Response Mechanisms Under Differential Privacy. ISC 2016: 271-282 - [i7]Mikio Fujiwara, Atsushi Waseda, Ryo Nojima, Shiho Moriai, Wakaha Ogata, Masahide Sasaki:
Unbreakable distributed storage with quantum key distribution network and password-authenticated secret sharing. CoRR abs/1607.00468 (2016) - 2015
- [j7]Kaoru Kurosawa, Ryo Nojima, Le Trieu Phong:
Generic Fully Simulatable Adaptive Oblivious Transfer. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 98-A(1): 232-245 (2015) - [c9]Lihua Wang, Ryo Nojima, Shiho Moriai:
A Secure Automobile Information Sharing System. IoTPTS@AsiaCCS 2015: 19-26 - [c8]Lihua Wang, Takuya Hayashi, Sachiko Kanamori, Atsushi Waseda, Ryo Nojima, Shiho Moriai:
POSTER: PRINCESS: A Secure Cloud File Storage System for Managing Data with Hierarchical Levels of Sensitivity. CCS 2015: 1684-1686 - [c7]Takashi Kurokawa, Ryo Nojima, Shiho Moriai:
Can We Securely Use CBC Mode in TLS1.0? ICT-EurAsia/CONFENIS 2015: 151-160 - 2014
- [j6]Kaoru Kurosawa, Ryo Nojima, Le Trieu Phong:
Relation between Verifiable Random Functions and Convertible Undeniable Signatures, and New Constructions. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 97-A(1): 215-224 (2014) - 2013
- [j5]Kaoru Kurosawa, Ryo Nojima, Le Trieu Phong:
New leakage-resilient CCA-secure public key encryption. J. Math. Cryptol. 7(4): 297-312 (2013) - [i6]Kaoru Kurosawa, Ryo Nojima, Le Trieu Phong:
UC-Secure Multi-Session OT Using Tamper-Proof Hardware. IACR Cryptol. ePrint Arch. 2013: 77 (2013) - 2012
- [c6]Kaoru Kurosawa, Ryo Nojima, Le Trieu Phong:
Relation between Verifiable Random Functions and Convertible Undeniable Signatures, and New Constructions. ACISP 2012: 235-246 - [i5]Kaoru Kurosawa, Ryo Nojima, Le Trieu Phong:
Relation between Verifiable Random Functions and Convertible Undeniable Signatures, and New Constructions. IACR Cryptol. ePrint Arch. 2012: 213 (2012) - [i4]Kaoru Kurosawa, Ryo Nojima, Le Trieu Phong:
New Leakage Resilient CCA-Secure Public Key Encryption. IACR Cryptol. ePrint Arch. 2012: 453 (2012) - 2011
- [c5]Kaoru Kurosawa, Ryo Nojima, Le Trieu Phong:
Generic Fully Simulatable Adaptive Oblivious Transfer. ACNS 2011: 274-291 - [i3]Kaoru Kurosawa, Ryo Nojima, Le Trieu Phong:
Generic Fully Simulatable Adaptive Oblivious Transfer. IACR Cryptol. ePrint Arch. 2011: 382 (2011) - 2010
- [c4]Kaoru Kurosawa, Ryo Nojima, Le Trieu Phong:
Efficiency-Improved Fully Simulatable Adaptive OT under the DDH Assumption. SCN 2010: 172-181 - [i2]Kaoru Kurosawa, Ryo Nojima, Le Trieu Phong:
Efficiency-Improved Fully Simulatable Adaptive OT under the DDH Assumption. IACR Cryptol. ePrint Arch. 2010: 327 (2010)
2000 – 2009
- 2009
- [j4]Ryo Nojima, Youki Kadobayashi:
Cryptographically Secure Bloom-Filters. Trans. Data Priv. 2(2): 131-139 (2009) - [c3]Kaoru Kurosawa, Ryo Nojima:
Simple Adaptive Oblivious Transfer without Random Oracle. ASIACRYPT 2009: 334-346 - [c2]Ryo Nojima, Jin Tamura, Youki Kadobayashi, Hiroaki Kikuchi:
A Storage Efficient Redactable Signature in the Standard Model. ISC 2009: 326-337 - [i1]Kaoru Kurosawa, Ryo Nojima:
Simple Adaptive Oblivious Transfer Without Random Oracle. IACR Cryptol. ePrint Arch. 2009: 327 (2009) - 2008
- [j3]Ryo Nojima, Hideki Imai, Kazukuni Kobara, Kirill Morozov:
Semantic security for the McEliece cryptosystem without random oracles. Des. Codes Cryptogr. 49(1-3): 289-305 (2008) - 2006
- [c1]Ryo Nojima, Kazukuni Kobara, Hideki Imai:
Efficient Shared-Key Authentication Scheme from Any Weak Pseudorandom Function. INDOCRYPT 2006: 303-316 - 2005
- [j2]Ryo Nojima, Yuichi Kaji:
Secure, Efficient and Practical Key Management Scheme in the Complete-Subtree Method. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 88-A(1): 189-194 (2005) - [j1]Ryo Nojima, Yuichi Kaji:
Using Trapdoor Permutations in a Complete Subtree Method for Broadcast Encryption. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 88-A(2): 568-574 (2005)
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 2025-01-20 22:56 CET 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:
