Engineering Sciences/NOLTA-Information Security(Date:2017/12/21)

Presentation
Blacklistable Anonymous Credential System with Reputation Using Accumulator

Takeshi Kanatani(Hiroshima Univ.),  Toru Nakanishi(Hiroshima Univ.),  

[Date]2017-12-21
[Paper #]ISEC2017-81,COMP2017-35
Security and Enhancement of a Searchable Public-key Encryption Secure against Keyword Guessing Attack

Takanori Saito(Hiroshima Univ),  Toru Nakanishi(Hiroshima Univ),  

[Date]2017-12-21
[Paper #]ISEC2017-80,COMP2017-34
Implementation Results of Privacy-Preserving and Public-Verifiable Data Aggregation Protocols

Tatsuya Suzuki(Tokai Univ.),  Keita Emura(NICT),  Hayato Kimura(Tokai Univ.),  Toshihiro Ohigashi(Tokai Univ.),  

[Date]2017-12-21
[Paper #]ISEC2017-79,COMP2017-33
Fundamental Study of Classification of Attackers by Multiple Honeypots

Kazuya Yamashita(Univ. of Toyama),  Okino Koji(Univ. of Toyama),  

[Date]2017-12-21
[Paper #]ISEC2017-72,COMP2017-26
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),  

[Date]2017-12-21
[Paper #]ISEC2017-74,COMP2017-28
[Invited Talk] Foundations and practical studies of secure computation

Ryo Kikuchi(NTT),  

[Date]2017-12-21
[Paper #]ISEC2017-78,COMP2017-32
Effect on Mix Columns to the Security of Minalpher

Yuki Kishi(Kanagawa Univ),  Taroh Sasaki(Kanagawa Univ),  Athushi Fujioka(Kanagawa Univ),  

[Date]2017-12-21
[Paper #]ISEC2017-73,COMP2017-27
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.),  

[Date]2017-12-21
[Paper #]ISEC2017-77,COMP2017-31
Maximum k-path Vertex Cover Problem on Graph Classes

Tsuyoshi Yagita(Kyutech),  Eiji Miyano(Kyutech),  Toshiki Saitoh(Kyutech),  Ryuhei Uehara(JAIST),  Tom C. van der Zanden(Utrecht U.),  

[Date]2017-12-21
[Paper #]ISEC2017-76,COMP2017-30
Implementation Difficulty of Dynamic Self-Modifying Based Self Destructive Tamper Response

Kazuomi Oishi(SIST),  

[Date]2017-12-21
[Paper #]ISEC2017-82,COMP2017-36
O(n^{1/3})-space algorithm for the grid graph reachability problem

Ryo Ashida(Tokyo Tech),  Kotaro Nakagawa(Tokyo Tech),  

[Date]2017-12-21
[Paper #]ISEC2017-75,COMP2017-29
［招待講演］半正定値緩和手法によるランダム制約充足問題の反駁の限界

Ryuhei Mori(Tokyo Tech),  

[Date]2017-12-22
[Paper #]ISEC2017-87,COMP2017-41
Optimizing Bleichenbacher's Attack on Schnorr-Type Signatures with Barely Biased Nonces

Akira Takahashi(Kyoto Univ.),  Mehdi Tibouchi(NTT),  Masayuki Abe(NTT),  Tatsuaki Okamoto(NTT),  

[Date]2017-12-22
[Paper #]ISEC2017-84,COMP2017-38
Reputation System with Confidentiality to Administrator Using Linear Homomorophic Signatures

Daiki Uenoyama(Hiroshima Univ.),  Toru nakanishi(Hiroshima Univ.),  

[Date]2017-12-22
[Paper #]ISEC2017-83,COMP2017-37
Efficient Enumeration of Dominating Sets in K-Degenerate graphs

Kazuhiro Kurita(HU),  Kunihiro Wasa(NII),  Takeaki Uno(NII),  Hiroki Arimura(HU),  

[Date]2017-12-22
[Paper #]ISEC2017-89,COMP2017-43
A Note on Security Notions of Anonymity in Identity-Based Encryption

Honomu Ohtomo(Kanagawa Univ.),  Taroh Sasaki(Kanagawa Univ.),  Atsushi Fujioka(Kanagawa Univ.),  

[Date]2017-12-22
[Paper #]ISEC2017-85,COMP2017-39
Physical Bucket Sort with Restricted take Operations

Atsuki Nagao(Seikei Univ.),  Wei Wu(Seikei Univ.),  Hiro Ito(UEC),  

[Date]2017-12-22
[Paper #]ISEC2017-90,COMP2017-44
A Note on Rearrangement Errors in a Card-Based Protocol

Takaaki Mizuki(Tohoku Univ.),  Yuichi Komano(Toshiba),  

[Date]2017-12-22
[Paper #]ISEC2017-86,COMP2017-40
An ILP Formulation for Maximum Lengh Interval Graph Decomposition Problem

Keisuke Inoue(KTC),  

[Date]2017-12-22
[Paper #]ISEC2017-88,COMP2017-42