Details of the Researcher

PHOTO

Shuji Isobe
Section
Center for Data-driven Science and Artificial Intelligence
Job title
Associate Professor

Papers 33

  1. Robust Ownership Verification of DNN Models Against JPEG Compression via Probability-Controlled Adversarial Attacks Peer-reviewed

    Teruki Sano, Minoru Kuribayashi, Masao Sakai, Shuji Isobe, Eisuke Koizumi, Zhang Zhang

    2025 Asia Pacific Signal and Information Processing Association Annual Summit and Conference (APSIPA ASC)　2140-2145　2025/10

    DOI： 10.1109/apsipaasc65261.2025.11249003 　

  2. Ownership Verification of DNN Models Using White-Box Adversarial Attacks with Specified Probability Manipulation Peer-reviewed

    Teruki Sano, Minoru Kuribayashi, Masao Sakai, Shuji Isobe, Eisuke Koizumi

    CoRR, May 2025　2025

    DOI： 10.48550/arXiv.2505.17579 　

  3. Decentralized Federated Learning using Blockchain with Token Allocation Based on Contribution of Model Updates Peer-reviewed

    Koyo MURAKATA, Minoru KURIBAYASHI, Masao SAKAI, Shuji ISOBE, Eisuke KOIZUMI

    IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences　2025

    Publisher: Institute of Electronics, Information and Communications Engineers (IEICE)

    DOI： 10.1587/transfun.2025cip0025 　

    ISSN： 0916-8508

    eISSN： 1745-1337

  4. On a Relation between Knowledge-of-Exponent Assumptions and the DLog vs. CDH Question. Peer-reviewed

    Firas Kraiem, Shuji Isobe, Eisuke Koizumi, Hiroki Shizuya

    IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences　104-A　(1)　20-24　2021

    DOI： 10.1587/transfun.2020CIP0002 　

  5. On the Classification of Knowledge-of-exponent Assumptions in Cyclic Groups Peer-reviewed

    Firas Kraiem, Shuji Isobe, Eisuke Koizumi, Hiroki Shizuya

    Interdisciplinary Information Sciences　25　(1)　67-74　2019/09

    Publisher: Graduate School of Information Sciences, Tohoku University

    DOI： 10.4036/iis.2019.r.03 　

    ISSN： 1340-9050

    eISSN： 1347-6157

  6. Lossy Identification Schemes from Decisional RSA Peer-reviewed

    Shingo HASEGAWA, Shuji ISOBE

    Interdisciplinary Information Sciences　25　(1)　59-66　2019

    Publisher: Graduate School of Information Sciences, Tohoku University

    DOI： 10.4036/iis.2019.r.01 　

    ISSN： 1340-9050

    eISSN： 1347-6157

  7. A Construction of Cramer-Shoup Like Encryption Protocols Based on the Anshel-Anshel-Goldfeld Key Exchange Protocol. Peer-reviewed

    Shuji Isobe, Jun-ya Iwazaki, Eisuke Koizumi, Atsushi Suda

    Sixth International Symposium on Computing and Networking　410-416　2018

    Publisher: IEEE Computer Society

    DOI： 10.1109/CANDARW.2018.00082 　

  8. A Method for Constructing an Autonomous Decentralized P2P Storage with High Confidentiality and Reliability. Peer-reviewed

    Masayuki Fukumitsu, Shingo Hasegawa, Shuji Isobe, Jun-ya Iwazaki, Eisuke Koizumi, Masao Sakai

    Fifth International Symposium on Computing and Networking(CANDAR)　439-444　2017

    Publisher: IEEE Computer Society

    DOI： 10.1109/CANDAR.2017.67 　

  9. Autoreducibility and Completeness for Partial Multivalued Functions. Peer-reviewed

    Shuji Isobe, Eisuke Koizumi

    IEICE Transactions on Information & Systems　100-D　(3)　422-427　2017

    DOI： 10.1587/transinf.2016FCP0006 　

  10. A Rigorous Security Proof for the Enhanced Version of Password-Protected Secret Sharing Scheme Peer-reviewed

    HASEGAWA Shingo, ISOBE Shuji, IWAZAKI Jun-ya, KOIZUMI Eisuke, SHIZUYA Hiroki

    IIS　22　(1)　31-55　2016

    Publisher: 東北大学大学院情報科学研究科ジャーナル編集委員会

    DOI： 10.4036/iis.2015.R.04 　

    ISSN： 1340-9050

    More details Close

    The password-protected secret sharing (PPSS, for short) and its security notion, called in this paper the PPSS-security, were proposed by Bagherzandi, Jarecki, Saxena and Lu. However, another security notion for PPSS schemes, the pparam-security was proposed by Hasegawa, Isobe, Iwazaki, Koizumi and Shizuya, because they pointed out an attack which can break the original protocol proposed by Bagherzandi <i>et al.</i> Hasegawa <i>et al.</i> also showed how to enhance the protocol, and proved that the enhanced one is pparam-secure. In this paper, we prove that the enhanced one is PPSS-secure as well.

  11. A construction of attribute-based aggregate signatures. Peer-reviewed

    Shingo Hasegawa, Shuji Isobe, Eisuke Koizumi, Hiroki Shizuya, Ryo Takahashi

    2016 International Symposium on Information Theory and Its Applications(ISITA)　76-80　2016

    Publisher: IEEE

  12. A Strengthened Security Notion for Password-Protected Secret Sharing Schemes. Peer-reviewed

    Shingo Hasegawa, Shuji Isobe, Jun-ya Iwazaki, Eisuke Koizumi, Hiroki Shizuya

    IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences　98-A　(1)　203-212　2015

    DOI： 10.1587/transfun.E98.A.203 　

  13. Password-protected secret-sharing schemes without random oracles. Peer-reviewed

    Shingo Hasegawa, Shuji Isobe, Jun-ya Iwazaki, Eisuke Koizumi, Hiroki Shizuya

    International Symposium on Information Theory and its Applications(ISITA)　566-570　2014

    Publisher: IEEE

  14. On the security notions of signcryption. Peer-reviewed

    Shingo Hasegawa, Shuji Isobe

    International Symposium on Information Theory and its Applications(ISITA)　231-235　2014

    Publisher: IEEE

  15. Lossy identification schemes from decisional RSA. Peer-reviewed

    Shingo Hasegawa, Shuji Isobe

    International Symposium on Information Theory and its Applications(ISITA)　143-147　2014

    Publisher: IEEE

  16. On the Impossibility of Proving Security of Strong-RSA Signatures via the RSA Assumption. Peer-reviewed

    Masayuki Fukumitsu, Shingo Hasegawa, Shuji Isobe, Hiroki Shizuya

    Information Security and Privacy - 19th Australasian Conference(ACISP)　290-305　2014

    Publisher: Springer

    DOI： 10.1007/978-3-319-08344-5_19 　

  17. A Lossy Identification Scheme Using the Subgroup Decision Assumption. Peer-reviewed

    Shingo Hasegawa, Shuji Isobe

    IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences　97-A　(6)　1296-1306　2014

    DOI： 10.1587/transfun.E97.A.1296 　

  18. On the Complexity of Computing Discrete Logarithms over Algebraic Tori. Peer-reviewed

    Shuji Isobe, Eisuke Koizumi, Yuji Nishigaki, Hiroki Shizuya

    IEICE Transactions on Information & Systems　97-D　(3)　442-447　2014

    DOI： 10.1587/transinf.E97.D.442 　

  19. The RSA Group Is Adaptive Pseudo-Free under the RSA Assumption. Peer-reviewed

    Masayuki Fukumitsu, Shingo Hasegawa, Shuji Isobe, Hiroki Shizuya

    IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences　97-A　(1)　200-214　2014

    DOI： 10.1587/transfun.E97.A.200 　

  20. NP-Complete Sets for Computing Discrete Logarithms and Integer Factorization Peer-reviewed

    Shingo Hasegawa, Shuji Isobe, Hiroki Shizuya

    Interdisciplinary Information Sciences　19　(2)　129-134　2013

    DOI： 10.4036/iis.2013.129 　

  21. Toward Separating the Strong Adaptive Pseudo-freeness from the Strong RSA Assumption. Peer-reviewed

    Masayuki Fukumitsu, Shingo Hasegawa, Shuji Isobe, Eisuke Koizumi, Hiroki Shizuya

    Information Security and Privacy - 18th Australasian Conference(ACISP)　72-87　2013

    Publisher: Springer

    DOI： 10.1007/978-3-642-39059-3_6 　

  22. On the Length-Decreasing Self-Reducibility and the Many-One-Like Reducibilities for Partial Multivalued Functions. Peer-reviewed

    Ji-Won Huh, Shuji Isobe, Eisuke Koizumi, Hiroki Shizuya

    IEICE Transactions on Information & Systems　96-D　(3)　465-471　2013

    DOI： 10.1587/transinf.E96.D.465 　

  23. On the Complexity of Computing Discrete Logarithms over Algebraic Tori. Peer-reviewed

    Shuji Isobe, Eisuke Koizumi, Yuji Nishigaki, Hiroki Shizuya

    Cryptology and Network Security(CANS)　433-442　2009

    Publisher: Springer

    DOI： 10.1007/978-3-642-10433-6_29 　

  24. On the pseudo-freeness and the CDH assumption.

    Shingo Hasegawa, Shuji Isobe, Hiroki Shizuya, Katsuhiro Tashiro

    International Journal of Information Security　8　(5)　347-355　2009

    DOI： 10.1007/s10207-009-0087-0 　

  25. NPMV-Complete Functions That Compute Discrete Logarithms and Integer Factorization.

    Shingo Hasegawa, Shuji Isobe, Hiroki Shizuya

    IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences　91-A　(1)　342-344　2008

    DOI： 10.1093/ietfec/e91-a.1.342 　

  26. Making Cryptographic Primitives Harder.

    Shingo Hasegawa, Hiroyuki Hatanaka, Shuji Isobe, Eisuke Koizumi, Hiroki Shizuya

    IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences　91-A　(1)　330-337　2008

    DOI： 10.1093/ietfec/e91-a.1.330 　

  27. A Countermeasure for Protecting NTRUSign against the Transcript Attack Peer-reviewed

    Shingo Hasegawa, Shuji Isobe, Masahiro Mambo, Hiroki Shizuya, Yuichi Futa, Motoji Ohmori

    Interdisciplinary Information Sciences　13　(2)　181-188　2007

    DOI： 10.4036/iis.2007.181 　

  28. Total Colorings Of Degenerate Graphs.

    Shuji Isobe, Xiao Zhou 0001, Takao Nishizeki

    Combinatorica(Comb.)　27　(2)　167-182　2007

    DOI： 10.1007/s00493-007-0050-5 　

  29. On the Polynomial Time Computability of Abstract Ray-Tracing Problem Peer-reviewed

    Shuji ISOBE, Tetsuo KURIYAMA, Masahiro MAMBO, Hiroki SHIZUYA

    IEICE Trans. on Fundamentals　E88-A　(5)　1209-1213　2005

    DOI： 10.1093/ietfec/e88-a.5.1206 　

    ISSN： 0916-8508 1745-1337

  30. Cost Total Colorings of Trees

    Shuji Isobe, Xiao Zhou, Takao Nishizeki

    IEICE Transactions on Information and Systems　E87-D　(2)　337-342　2004

    Publisher: Institute of Electronics, Information and Communication, Engineers, IEICE

    ISSN： 0916-8532

  31. Linear algorithm for finding list edge-colorings of series-parallel graphs Peer-reviewed

    T Fujino, S Isobe, Zhou, X, T Nishizeki

    IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS　E86D　(2)　186-190　2003/02

    ISSN： 0916-8532

  32. Total colorings of degenerated graphs

    Shuji Isobe, Xiao Zhou, Takao Nishizeki

    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)　2076　506-517　2001

    Publisher: Springer Verlag

    DOI： 10.1007/3-540-48224-5_42 　

    ISSN： 1611-3349 0302-9743

  33. A linear algorithm for finding total colorings of partial fc-trees Peer-reviewed

    Shuji Isobe, Xiao Zhou, Takao Nishizeki

    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)　1741　347-356　1999

    Publisher: Springer Verlag

    DOI： 10.1007/3-540-46632-0_35 　

    ISSN： 1611-3349 0302-9743

Show all ︎Show first 5

Misc. 3

  1. Toward separating integer factoring from discrete logarithm mod p Peer-reviewed

    Shuji Isobe, Wataru Kumagai, Masahiro Mambo, Hiroki Shizuya

    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES　E90A　(1)　48-53　2007/01

    DOI： 10.1093/ietfec/e90-a.1.48 　

    ISSN： 0916-8508

    eISSN： 1745-1337

  2. A polynomial-time algorithm for finding total colorings of partial k-trees Peer-reviewed

    ISOBE S.

    International Journal of Foundations of Computer Science　10　(2)　171-194　1999

    DOI： 10.1142/S0129054199000137 　

    ISSN： 0129-0541

  3. A polynomial-time algorithm for finding total colorings of partial k-trees Peer-reviewed

    S Isobe, Zhou, X, T Nishizeki

    GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE　1517　100-113　1998

    ISSN： 0302-9743