|
|
All Technical Committee Conferences (Searched in: All Years)
|
|
Search Results: Conference Papers |
Conference Papers (Available on Advance Programs) (Sort by: Date Descending) |
|
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-29 13:05 |
Miyagi |
Tohoku Univ. |
A Lossy Identification Scheme from the Subgroup Decision Shingo Hasegawa, Shuji Isobe (Tohoku Univ.) ISEC2013-68 LOIS2013-34 |
Lossy identification schemes are used to construct tightly secure signature schemes via the Fiat-Shamir heuristic in the... [more] |
ISEC2013-68 LOIS2013-34 pp.57-63 |
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, 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 |
LOIS, IPSJ-CN |
2007-06-01 13:45 |
Osaka |
|
Estimating Market Share by Blog Mining
-- Analysis of the relationship between blog and existing statistical indicator -- Shingo Hasegawa (UEC), Ko Fujimura (NTT) OIS2007-7 |
The number of mentions in blogosphere reflects activities in the real world. It is thus considered as a useful indicator... [more] |
OIS2007-7 pp.37-42 |
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 |
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 |
|
|
|
Copyright and reproduction :
All rights are reserved and no part of this publication may be reproduced or transmitted in any form or by any means, electronic or mechanical, including photocopy, recording, or any information storage and retrieval system, without permission in writing from the publisher. Notwithstanding, instructors are permitted to photocopy isolated articles for noncommercial classroom use without fee. (License No.: 10GA0019/12GB0052/13GB0056/17GB0034/18GB0034)
|
[Return to Top Page]
[Return to IEICE Web Page]
|