Committee |
Date Time |
Place |
Paper Title / Authors |
Abstract |
Paper # |
ISEC, IT, WBS |
2015-03-02 13:40 |
Fukuoka |
The University of Kitakyushu |
A Construction of Attribute-based Aggregate Signatures Ryo Takahashi, Shingo Hasegawa, Shuji Isobe, Eisuke Koizumi, Hiroki Shizuya (Tohoku Univ.) IT2014-66 ISEC2014-79 WBS2014-58 |
Hohenberger, Sahai, Waters proposed the first identity-based aggregate signature which admits unrestricted aggregation b... [more] |
IT2014-66 ISEC2014-79 WBS2014-58 pp.25-32 |
ISEC, IT, WBS |
2015-03-02 14:05 |
Fukuoka |
The University of Kitakyushu |
On the Limit of Security Proof for Homomorphic Encryption Daiki Takahashi, Shingo Hasegawa, Shuji Isobe, Eisuke Koizumi, Hiroki Shizuya (Tohoku Univ.) IT2014-67 ISEC2014-80 WBS2014-59 |
In this paper, we explore on the limitation of security proofs for homomorphic encryptions.
We consider the computation... [more] |
IT2014-67 ISEC2014-80 WBS2014-59 pp.33-38 |
ISEC, LOIS |
2013-11-28 15:00 |
Miyagi |
Tohoku Univ. |
A Note on Attacks against Card-Based Cryptographic Protocols Takaaki Mizuki, Hiroki Shizuya (Tohoku Univ.) ISEC2013-62 LOIS2013-28 |
It has been known that Secure Multi-Party Computations can be conducted using a number of black and red physical cards (... [more] |
ISEC2013-62 LOIS2013-28 pp.21-28 |
IE, MVE |
2012-03-12 - 2012-03-13 |
Toyama |
Toyama University |
Easy creation of chalk board lecture video content for learning and teacher reflection Satoshi Shimada, Suguru Higashino (NTT), Fumiko Konno, Takashi Mitsuishi, Yoshinori Hayakawa, Hiroki Shizuya (Tohoku univ.) IE2011-170 MVE2011-132 |
This paper proposes a method to create a lecture video content easily from chalk and talk lecture video captured by a fi... [more] |
IE2011-170 MVE2011-132 pp.217-222 |
ISEC, LOIS |
2011-11-15 13:25 |
Osaka |
Osaka Electro-Communication University |
SLP separates the strong RSA assumption from the DDH assumption Masayuki Fukumitsu, Shingo Hasegawa, Shuji Isobe, Eisuke Koizumi, Hiroki Shizuya (Tohoku Univ.) ISEC2011-55 LOIS2011-49 |
Although we have many computational reductions among the cryptographic primitives, little is known about the relationshi... [more] |
ISEC2011-55 LOIS2011-49 pp.141-148 |
ISEC, LOIS |
2011-11-15 13:50 |
Osaka |
Osaka Electro-Communication University |
On the Little Knowledge Interactive Proof Jun-ya Iwazaki, Shingo Hasegawa, Shuji Isobe, Eisuke Koizumi, Hiroki Shizuya (Tohoku Univ.) ISEC2011-56 LOIS2011-50 |
We propose the notion of little knowledgeness in interactive proof systems,
as a notion alternative to the zero knowle... [more] |
ISEC2011-56 LOIS2011-50 pp.149-154 |
ISEC, IT, WBS |
2011-03-04 14:55 |
Osaka |
Osaka University |
On the self-reducibility and the many-one-like reducibilities for multi-valued functions Ji-Won Huh, Shuji Isobe, Eisuke Koizumi, Hiroki Shizuya (Tohoku Univ.) IT2010-127 ISEC2010-131 WBS2010-106 |
In this paper, we investigate a relationship between the self-reducibility and the many-one-like reducibilities for mult... [more] |
IT2010-127 ISEC2010-131 WBS2010-106 pp.389-394 |
ISEC, IPSJ-CSEC, SITE, ICSS [detail] |
2010-07-02 14:40 |
Aomori |
Hirosaki University |
On the Relationship between Recognizing Languages and Computing Functions Shingo Hasegawa, Shuji Isobe, Hiroki Shizuya (Tohoku Univ.) ISEC2010-37 SITE2010-33 ICSS2010-43 |
We explore the relationship between the class NP and the function class NPMVg, the set of witness functions for language... [more] |
ISEC2010-37 SITE2010-33 ICSS2010-43 pp.202-208 |
WBS, IT, ISEC |
2009-03-10 15:40 |
Hokkaido |
Hakodate Mirai Univ. |
On the Computational Complexity of the Discrete Logarithm Problem over Algebraic Tori Yuji Nishigaki, Shingo Hasegawa, Shuji Isobe, Eisuke Koizumi, Masao Sakai, Hiroki Shizuya (Tohoku Univ.) IT2008-127 ISEC2008-185 WBS2008-140 |
In this paper we investigate the computational complexity of the discrete logarithm problem over algebraic tori (TDLP).
... [more] |
IT2008-127 ISEC2008-185 WBS2008-140 pp.545-550 |
ISEC, IT, WBS |
2008-02-29 14:55 |
Tokyo |
|
A Construction of Partially Blind Signatures with Traceability Tsunemichi Chiba (Mitsubishi Electric CC), Eikoh Chida (Ichinoseki NCT), Masahiro Mambo (Univ. of Tsukuba), Hiroki Shizuya (Tohoku Univ.) IT2007-59 ISEC2007-156 WBS2007-90 |
In the paper we propose
a construction of partially blind signatures with traceability.
The proposed scheme has two ve... [more] |
IT2007-59 ISEC2007-156 WBS2007-90 pp.73-78 |
IT, ISEC, WBS |
2007-03-16 14:50 |
Gunma |
Gunma Univ. (Kiryu Campus) |
A technique for making PKI robust Masaki Yoshida, Shingo Hasegawa, Shuji Isobe, Eisuke Koizumi, Masao Sakai, Hiroki Shizuya (Tohoku Univ.), Yuichi Futa, Manabu Maeda (Matsushita) |
We study a strategy for recovering a PKI system without reconstructing the whole one when the trust anchor has been brok... [more] |
IT2006-105 ISEC2006-160 WBS2006-102 pp.119-124 |
IT, ISEC, WBS |
2007-03-16 15:15 |
Gunma |
Gunma Univ. (Kiryu Campus) |
A Digital Watermarking for Audio Information: Randomized Method and Beat-Frequency Method Shinya Miura, Masao Sakai, Hiroki Shizuya (Tohoku Univ.) |
In this paper, we propose a randomized method and a beat-frequency method for an audio digital watermarking.
The random... [more] |
IT2006-106 ISEC2006-161 WBS2006-103 pp.125-130 |
WBS, IT, ISEC |
2006-03-16 16:45 |
Aichi |
Nagoya Univ. |
Complexity of Diffie-Hellman problems and its variants Kazunari Manabe, Shuji Isobe, Eisuke Koizumi, Masao Sakai, Hiroki Shizuya (Tohoku Univ.) |
[more] |
IT2005-82 ISEC2005-139 WBS2005-96 pp.105-110 |
WBS, IT, ISEC |
2006-03-16 17:10 |
Aichi |
Nagoya Univ. |
On the Complexity of the Closest Vector Problem for Regular Lattices Shingo Hasegawa, Shuji Isobe, Hiroki Shizuya (Tohoku Univ.), Yuichi Futa, Motoji Ohmori (Matsushita Elec. Ind.) |
[more] |
IT2005-83 ISEC2005-140 WBS2005-97 pp.111-115 |
WBS, IT, ISEC |
2006-03-16 17:35 |
Aichi |
Nagoya Univ. |
Complexity of abstract DDoS attack problems Daisuke Yokota, Shuji Isobe, Eisuke Koizumi, Masao Sakai, Hiroki Shizuya (Tohoku Univ.) |
[more] |
IT2005-84 ISEC2005-141 WBS2005-98 pp.117-121 |