| IEICE Technical Committee Submission System Conference Schedule |
Online Proceedings [Sign in] Tech. Rep. Archives |
All Technical Committee Conferences (Searched in: All Years)
| Committee | Date Time | Place | Paper Title / Authors | Abstract | Paper # | |
| ISEC, LOIS | 2012-11-21 15:05 |
Shizuoka | Shizuoka City Industry-University Exchange Center | Secure multiplication algorithm based on secret sharing Ryota Nakada, Takayuki Nakachi (NTT)  ISEC2012-59 LOIS2012-34 |
In this paper, we propose secure multiplication algorithm based on the secret sharing scheme. Secret sharing scheme can... [more] |
ISEC2012-59 LOIS2012-34 pp.15-20 |
| ISEC, LOIS | 2012-11-22 13:15 |
Shizuoka | Shizuoka City Industry-University Exchange Center | Secret sharing using the Chinese remainder theorem and its application Toshio Tsuji, Masao Kasahara (Osaka Gakuin Univ.) ISEC2012-66 LOIS2012-41 |
This paper presents a method of secret sharing using Chinese remainder theorem. In particular, we develop a system whic... [more] | ISEC2012-66 LOIS2012-41 pp.61-68 |
| EMM | 2012-10-04 14:00 |
Chiba | Makuhari Messe | Secret Sharing Suitable for Cloud Computing Satoshi Takahashi, Keiichi Iwamura (TUS) EMM2012-57 |
Recently, secret sharing has been attracting attention of applying to loud computing. For this reason is secret sharing ... [more] | EMM2012-57 pp.11-16 |
| AP | 2012-03-16 10:25 |
Shizuoka | Chuo public hall (Atami City) | Active Tapping Approach against Wireless Secret Key Sharing System Katsuhiro Fujiki, Tadafumi Yoshida, Takafumi Saito, Naoki Sakai, Hideyuki Uehara, Takashi Ohira (Toyohashi Tech) AP2011-206 |
Against the wireless secret key sharing system, this paper proposes a new active tapping approach that uses generation o... [more] | AP2011-206 pp.43-48 |
| NS, IN (Joint) |
2012-03-09 12:00 |
Miyazaki | Miyazaki Seagia | An Application of Content Management on Named Data Networking Kei Kusunoki, Yoshihiro Kawahara, Tohru Asami (Tokyo Univ.) IN2011-183 |
Named Data Networking (NDN) designed for a large scale content distribution has a similar problem like P2P, i.e. diffic... [more] |
IN2011-183 pp.275-280 |
| IT, ISEC, WBS | 2012-03-01 14:20 |
Kanagawa | Consideration for IT-secure password protected secret sharing Atsushi Waseda, Ryo Nojima (NICT) IT2011-52 ISEC2011-79 WBS2011-53 |
Bagherzand et al. proposed the password protected secret sharing scheme whose shares are protected by the user password... [more] | IT2011-52 ISEC2011-79 WBS2011-53 pp.41-43 |
|
| IT | 2011-11-29 14:05 |
Iwate | HOTEL MORI NO KAZE | [Invited Talk]
The Practical Value of Information-Theoretic Security Technologies Tsutomu Matsumoto (YNU) IT2011-35 |
It is often recognized that information-theoretic security technologies are good in security but not practically appeari... [more] | IT2011-35 pp.1-5 |
| ICSS | 2011-11-18 15:00 |
Tokushima | Naruto University of Education | A New Distributed Storage System Ensuring Security and Reliability Tadashi Minowa (NICT) ICSS2011-35 |
With the growing volume of data generating on diversified information equipment such as smartphones across the network, ... [more] | ICSS2011-35 pp.19-24 |
| ISEC, LOIS | 2011-11-14 15:10 |
Osaka | Osaka Electro-Communication University | Ramp secret sharing scheme based on MBR codes Masazumi Kurihara (UEC), Hidenori Kuwakado (Kobe University) ISEC2011-43 LOIS2011-37 |
Some Ramp secret sharing system based on minimum bandwidth regenerating code(MBR code) for repairable distributed storag... [more] | ISEC2011-43 LOIS2011-37 pp.61-68 |
| IT | 2011-07-22 09:55 |
Okayama | Okayama University | On ramp secret sharing schemes for distributed storage systems under repair dynamics
-- Ramp Secret Sharing Schemes based on MBR Codes -- Masazumi Kurihara (UEC), Hidenori Kuwakado (Kobe Univ.) IT2011-17 |
In this paper, a construction method of ramp secret sharing systems based on minimum bandwidth regenerating(MBR) codes f... [more] | IT2011-17 pp.41-46 |
| IA, ICSS | 2011-06-17 10:25 |
Fukuoka | Kyushu Institute of Technology | Secure and Traceable Online Image Sharing Scheme for Service Providers Kohei Sugiyama, Masaki Fukushima, Teruyuki Hasegawa (KDDI Labs.) IA2011-8 ICSS2011-8 |
We propose a scheme for application service providers to provide a secure and traceable online image sharing service. To... [more] | IA2011-8 ICSS2011-8 pp.41-46 |
| IT | 2011-05-20 13:55 |
Osaka | Osaka City University | Access Structure of Secret Sharing Scheme based on Second-Degree Bivariate Polynomial Interpolation Scheme Hideaki Kashiwagura, Mikihiko Nishiara (Shinshu Univ.) IT2011-4 |
Shamir's polynomial interpolation scheme is a secret sharing scheme with univariate polynomial. In this study, we inve... [more] |
IT2011-4 pp.19-24 |
| ISEC, IT, WBS | 2011-03-04 14:55 |
Osaka | Osaka University | On an extended version of Rashmi-Shah-Kumar regenerating codes and secret sharing for distributed storage Masazumi Kurihara (Univ. of Electro-Comm), Hidenori Kuwakado (Kobe Univ.) IT2010-114 ISEC2010-118 WBS2010-93 |
In this paper, an extended version of Rashmi-Shah-Kumar Minimum Storage Regenerating(MSR) codes is proposed. In Rashmi-S... [more] | IT2010-114 ISEC2010-118 WBS2010-93 pp.303-310 |
| ISEC, IT, WBS | 2011-03-04 10:25 |
Osaka | Osaka University | A New Class of Secret Sharing Schemes, KSS(I), and Its Application to Biometrics Masao Kasahara (O.G.U) IT2010-120 ISEC2010-124 WBS2010-99 |
In this paper, we present a new secret sharing scheme, referred to as KSS(I) on the basis of systematic Reed-Solomon cod... [more] | IT2010-120 ISEC2010-124 WBS2010-99 pp.349-352 |
| IT | 2011-01-18 11:20 |
Nara | On regenerating codes and secret sharing for distributed storage Masazumi Kurihara (UEC), Hidenori Kuwakado (Kobe Univ.) IT2010-56 |
In this paper we argue secret sharing for the regenerating codes corresponding to the repair problem for distributed sto... [more] | IT2010-56 pp.13-18 |
|
| NS, RCS (Joint) |
2010-12-17 15:30 |
Okayama | Okayama Univ. | A Study on Parameter Controls of Transmit Antenna Directivity for Secure Wireless Link Creation based on Secret Sharing Method Masaaki Yamanaka (Hiroshima International Univ.), Shinichi Miyamoto, Seiichi Sampei (Osaka Univ.), Norihiko Morinaga (Hiroshima International Univ.) RCS2010-196 |
The authors have proposed a secure wireless communication scheme by producing shared information by secret sharing metho... [more] | RCS2010-196 pp.221-226 |
| AN, USN, SR, RCS (Joint) |
2010-10-28 09:30 |
Osaka | Osaka University | Spatially Distributed Ciphering Function Using Private Wireless Distributed Networks for Secure Wireless Communication Shinichi Miyamoto, Satoshi Hirai (Osaka Univ.), Masaaki Yamanaka (Hiroshima International Univ.), Seiichi Sampei (Osaka Univ.) RCS2010-116 SR2010-49 AN2010-26 USN2010-22 |
Private wireless network has to establish determinate wireless channel in the limited area that user intends in the priv... [more] | RCS2010-116 SR2010-49 AN2010-26 USN2010-22 pp.55-62(RCS), pp.65-72(SR), pp.1-8(AN), pp.1-8(USN) |
| COMP | 2010-10-15 13:20 |
Miyagi | Tohoku Univ. | Secure Vickrey Auction Based on Secret Sharing Takuma Sugimoto, Takashi Horiyama (Saitama Univ.) COMP2010-34 |
Vickrey auction, in which the highest bidder wins at the second highest price, is a well-known incentive compatible auct... [more] | COMP2010-34 pp.19-25 |
| ISEC | 2010-09-10 16:35 |
Tokyo | Kikai-Shinko-Kaikan Bldg. | A general construction method of visual secret sharing scheme with share rotations Mitsugu Iwamoto, Yang Li, Kazuo Sakiyama, Kazuo Ohta (Univ. of Electro-Comm.) ISEC2010-49 |
In this paper, we discuss a visual secret sharing scheme with multiple secret images including share rotation operations... [more] | ISEC2010-49 pp.67-74 |
| IPSJ-AVM, MoNA | 2010-07-16 10:55 |
Hokkaido | Hokkaido Univ. | An Approach to Reduce Illegal Content Redistributions of P2P Video Sharing System Using Multiple Secret Sharing Scheme Kei Kusunoki, Yoshihiro Kawahara, Tohru Asami (Univ. of Tokyo.), Kazuhiko Yamaguchi (Univ. of Electro-Comm.) MoMuC2010-23 |
CGM (Consumer Generated Media) based video sharing services are one of the killer applications among the current Interne... [more] | MoMuC2010-23 pp.57-62 |
[Return to Top Page]