| IEICE Technical Committee Submission System Conference Schedule |
Online Proceedings [Sign in] Tech. Rep. Archives |
Technical Committee on Information Security (ISEC) (Searched in: 2017)
Search Results: Keywords 'from:2017-12-21 to:2017-12-21'
| Committee | Date Time | Place | Paper Title / Authors | Abstract | Paper # | |
| ISEC, COMP | 2017-12-21 09:55 |
Kochi | Eikokuji Campus, Kochi University of Technology | Fundamental Study of Classification of Attackers by Multiple Honeypots Kazuya Yamashita, Okino Koji (Univ. of Toyama)  ISEC2017-72 COMP2017-26 |
It is known that stored information in a honeypot is affected by its environment of observation, such as its response an... [more] | ISEC2017-72 COMP2017-26 pp.1-5 |
| ISEC, COMP | 2017-12-21 10:20 |
Kochi | Eikokuji Campus, Kochi University of Technology | Effect on Mix Columns to the Security of Minalpher
-- Experimental Results for 6 Rounds -- Yuki Kishi, Taroh Sasaki, Athushi Fujioka (Kanagawa Univ) ISEC2017-73 COMP2017-27 |
This paper examines Mix Columns in Minalpher. The SPN strcture have Mix Columns, and Mix Columns influence for security... [more] | ISEC2017-73 COMP2017-27 pp.7-10 |
| ISEC, COMP | 2017-12-21 11:00 |
Kochi | Eikokuji Campus, Kochi University of Technology | Space Efficient Algorithms for Maximum (Weight) Independent Set on Circular Arcs Shohei Urakawa (Kobe Univ.), Tom C. van der Zanden (Utrecht Univ.), Toshiki Saitoh (Kyutech), Ryuhei Uehara (JAIST) ISEC2017-74 COMP2017-28 |
Recently，due to increase of the capacity of storages，we require space efficient algorithms with a limited workspace for ... [more] | ISEC2017-74 COMP2017-28 pp.11-18 |
| ISEC, COMP | 2017-12-21 11:25 |
Kochi | Eikokuji Campus, Kochi University of Technology | O(n^{1/3})-space algorithm for the grid graph reachability problem Ryo Ashida, Kotaro Nakagawa (Tokyo Tech) ISEC2017-75 COMP2017-29 |
The directed graph reachability problem is a canonical complete problem for class NL. The best known polynomial time al... [more] |
ISEC2017-75 COMP2017-29 pp.19-24 |
| ISEC, COMP | 2017-12-21 11:50 |
Kochi | Eikokuji Campus, Kochi University of Technology | Maximum k-path Vertex Cover Problem on Graph Classes Tsuyoshi Yagita, Eiji Miyano, Toshiki Saitoh (Kyutech), Ryuhei Uehara (JAIST), Tom C. van der Zanden (Utrecht U.) ISEC2017-76 COMP2017-30 |
This paper introduces the maximum version of the $k$-path vertex cover problem, called the textsc{Maximum $k$-Path Verte... [more] | ISEC2017-76 COMP2017-30 pp.25-31 |
| ISEC, COMP | 2017-12-21 12:15 |
Kochi | Eikokuji Campus, Kochi University of Technology | An optimal strategy of the second player for the 1-round voronoi game on trees Akihiro Sugimoto (Kobe Univ.), Toshiki Saitoh (Kyushu Inst. of Tech.) ISEC2017-77 COMP2017-31 |
Voronoi game is an encampment game which is played on a plane. The game is expected to be applied to a model of competit... [more] | ISEC2017-77 COMP2017-31 pp.33-39 |
| ISEC, COMP | 2017-12-21 14:10 |
Kochi | Eikokuji Campus, Kochi University of Technology | [Invited Talk]
Foundations and practical studies of secure computation Ryo Kikuchi (NTT) ISEC2017-78 COMP2017-32 |
Secure computation, also known as secure multiparty computation, is a method to compute a function on encrypted data. Th... [more] | ISEC2017-78 COMP2017-32 p.41 |
| ISEC, COMP | 2017-12-21 15:25 |
Kochi | Eikokuji Campus, Kochi University of Technology | Implementation Results of Privacy-Preserving and Public-Verifiable Data Aggregation Protocols Tatsuya Suzuki (Tokai Univ.), Keita Emura (NICT), Hayato Kimura, Toshihiro Ohigashi (Tokai Univ.) ISEC2017-79 COMP2017-33 |
Aggregator Oblivious Encryption (AOE) was proposed by Shi et al. in NDSS 2011. AOE with public verifiability was also pr... [more] | ISEC2017-79 COMP2017-33 pp.43-50 |
| ISEC, COMP | 2017-12-21 15:50 |
Kochi | Eikokuji Campus, Kochi University of Technology | Security and Enhancement of a Searchable Public-key Encryption Secure against Keyword Guessing Attack Takanori Saito, Toru Nakanishi (Hiroshima Univ) ISEC2017-80 COMP2017-34 |
[more] | ISEC2017-80 COMP2017-34 pp.51-57 |
| ISEC, COMP | 2017-12-21 16:15 |
Kochi | Eikokuji Campus, Kochi University of Technology | Blacklistable Anonymous Credential System with Reputation Using Accumulator Takeshi Kanatani, Toru Nakanishi (Hiroshima Univ.) ISEC2017-81 COMP2017-35 |
Conventional anonymous authentication such as group signature has a problem that the ID administrator can specify the au... [more] | ISEC2017-81 COMP2017-35 pp.59-65 |
| ISEC, COMP | 2017-12-21 16:40 |
Kochi | Eikokuji Campus, Kochi University of Technology | Implementation Difficulty of Dynamic Self-Modifying Based Self Destructive Tamper Response Kazuomi Oishi (SIST) ISEC2017-82 COMP2017-36 |
Tamper resistant software, which has sufficient resistance against analysis and attack, is a necessary and important tec... [more] | ISEC2017-82 COMP2017-36 pp.67-74 |
| ISEC, COMP | 2017-12-22 09:50 |
Kochi | Eikokuji Campus, Kochi University of Technology | Reputation System with Confidentiality to Administrator Using Linear Homomorophic Signatures Daiki Uenoyama, Toru nakanishi (Hiroshima Univ.) ISEC2017-83 COMP2017-37 |
[more] | ISEC2017-83 COMP2017-37 pp.75-81 |
| ISEC, COMP | 2017-12-22 10:15 |
Kochi | Eikokuji Campus, Kochi University of Technology | Optimizing Bleichenbacher's Attack on Schnorr-Type Signatures with Barely Biased Nonces Akira Takahashi (Kyoto Univ.), Mehdi Tibouchi, Masayuki Abe, Tatsuaki Okamoto (NTT) ISEC2017-84 COMP2017-38 |
Bleichenbacher's attack is a key recovery attack technique exploiting biased nonces in Schnorr-type signatures. While a... [more] |
ISEC2017-84 COMP2017-38 pp.83-88 |
| ISEC, COMP | 2017-12-22 10:40 |
Kochi | Eikokuji Campus, Kochi University of Technology | A Note on Security Notions of Anonymity in Identity-Based Encryption
-- Relationship between LOR security and SW security -- Honomu Ohtomo, Taroh Sasaki, Atsushi Fujioka (Kanagawa Univ.) ISEC2017-85 COMP2017-39 |
One of the criteria of security of Identity-based encryption is anonymity. The anonymity is defined using a game betwee... [more] | ISEC2017-85 COMP2017-39 pp.89-94 |
| ISEC, COMP | 2017-12-22 11:05 |
Kochi | Eikokuji Campus, Kochi University of Technology | A Note on Rearrangement Errors in a Card-Based Protocol Takaaki Mizuki (Tohoku Univ.), Yuichi Komano (Toshiba) ISEC2017-86 COMP2017-40 |
(To be available after the conference date) [more] | ISEC2017-86 COMP2017-40 pp.95-101 |
| ISEC, COMP | 2017-12-22 13:00 |
Kochi | Eikokuji Campus, Kochi University of Technology | [Invited Talk]
Ryuhei Mori (Tokyo Tech) ISEC2017-87 COMP2017-41 |
[more] | ISEC2017-87 COMP2017-41 pp.103-105 |
| ISEC, COMP | 2017-12-22 14:15 |
Kochi | Eikokuji Campus, Kochi University of Technology | An ILP Formulation for Maximum Lengh Interval Graph Decomposition Problem Keisuke Inoue (KTC) ISEC2017-88 COMP2017-42 |
[more] | ISEC2017-88 COMP2017-42 pp.107-110 |
| ISEC, COMP | 2017-12-22 14:40 |
Kochi | Eikokuji Campus, Kochi University of Technology | Efficient Enumeration of Dominating Sets in K-Degenerate graphs Kazuhiro Kurita (HU), Kunihiro Wasa, Takeaki Uno (NII), Hiroki Arimura (HU) ISEC2017-89 COMP2017-43 |
A dominating set is one of the fundamental graph structure, like clique, independent set, s-t path, and cut. It is known... [more] | ISEC2017-89 COMP2017-43 pp.111-117 |
| ISEC, COMP | 2017-12-22 15:05 |
Kochi | Eikokuji Campus, Kochi University of Technology | Physical Bucket Sort with Restricted take Operations Atsuki Nagao, Wei Wu (Seikei Univ.), Hiro Ito (UEC) ISEC2017-90 COMP2017-44 |
[more] | ISEC2017-90 COMP2017-44 pp.119-122 |
[Return to Top Page]