Satoshi Obana
- Artificial Intelligence
- Information Systems
- Electrical and Electronic Engineering
- Computer Networks and Communications
- Computational Theory and Mathematics
- Co-authors
- Kaoru KurosawaToshiyuki IsshikiKazue SakoJun FurukawaSumio MoriokaYuichi NakamuraToshinori Araki
- Topics
- Cryptography and Data Security (11 papers)Complexity and Algorithms in Graphs (5 papers)Chaos-based Image/Signal Encryption (4 papers)
- Journals
- IEEE Transactions on Information TheoryInformation Processing LettersDesigns Codes and Cryptography
- Partner nations
- Japan
In The Last Decade
Satoshi Obana
13 papers receiving 48 citations
Peers
Comparison fields: 5 of 16
- Artificial Intelligence 44
- Information Systems 18
- Electrical and Electronic Engineering 18
- Computer Networks and Communications 13
- Computational Theory and Mathematics 11
Countries citing papers authored by Satoshi Obana
This map shows the geographic impact of Satoshi Obana's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Satoshi Obana with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Satoshi Obana more than expected).
Fields of papers citing papers by Satoshi Obana
This network shows the impact of papers produced by Satoshi Obana. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Satoshi Obana. The network helps show where Satoshi Obana may publish in the future.
Co-authorship network of co-authors of Satoshi Obana
This figure shows the co-authorship network connecting the top 25 collaborators of Satoshi Obana. A scholar is included among the top collaborators of Satoshi Obana based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Satoshi Obana. Satoshi Obana is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | 0 | |
| 2 | 1 | |
| 3 | 6 | |
| 4 | 1 | |
| 5 | 4 | |
| 6 | 1 | |
| 7 | 9 | |
| 8 | 2 | |
| 9 | Searchable symmetric encryption supporting update | 0 |
| 10 | 3 | |
| 11 | Almost optimum secret sharing schemes secure against cheating for arbitrary secret distribution | 0 |
| 12 | 6 | |
| 13 | 2 | |
| 14 | 11 | |
| 15 | 8 | |
| 16 | 3 | |
| 17 | 0 |
About Satoshi Obana
Satoshi Obana is a scholar working on Artificial Intelligence, Computational Theory and Mathematics and Information Systems, having authored 17 papers that have together received 57 indexed citations. Recurring topics across this work include Cryptography and Data Security (11 papers), Complexity and Algorithms in Graphs (5 papers) and Chaos-based Image/Signal Encryption (4 papers). The work is most often cited by research in Artificial Intelligence (44 citations), Discrete Mathematics and Combinatorics (3 citations) and Information Systems (18 citations). Satoshi Obana has collaborated with scholars based in Japan. Frequent co-authors include Kaoru Kurosawa, Toshiyuki Isshiki, Kazue Sako, Jun Furukawa, Sumio Morioka, Yuichi Nakamura and Toshinori Araki. Their work appears in journals such as IEEE Transactions on Information Theory, Information Processing Letters and Designs Codes and Cryptography.
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.