New Methods to Ensure Security to Increase User's Sense of Safety in Cloud Services

被引:6
作者
Miyanishi, Yohtaro [1 ]
Kanaoka, Akira [2 ]
Sato, Fumiaki [2 ]
Han, Xiaogong [3 ]
Kitagami, Shinji [3 ]
Urano, Yoshiyori [3 ]
Shiratori, Norio [4 ,5 ]
机构
[1] ISEM Inc, Tokyo, Japan
[2] Toho Univ, Dept Informat Sci, Funabashi, Chiba, Japan
[3] Waseda Univ, Grad Sch Global Informat & Telecommun Studies GIT, Tokyo, Japan
[4] Tohoku Univ, RIEC, Sendai, Miyagi, Japan
[5] Waseda Univ GITS, Tokyo, Japan
来源
2014 IEEE 11TH INTL CONF ON UBIQUITOUS INTELLIGENCE AND COMPUTING AND 2014 IEEE 11TH INTL CONF ON AUTONOMIC AND TRUSTED COMPUTING AND 2014 IEEE 14TH INTL CONF ON SCALABLE COMPUTING AND COMMUNICATIONS AND ITS ASSOCIATED WORKSHOPS | 2014年
关键词
cloud computing; cloud security; secret sharing; secure computation;
D O I
10.1109/UIC-ATC-ScalCom.2014.37
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
We discuss about cloud security. Because cloud computing service users must submit almost their entire store of data and programs to a certain cloud provider, they cannot escape from anxiety about the possibility of data and programs being abused or leaked. Those data and programs usually embody the entirety of a company's stored knowledge. We have studied some countermeasures against the abuse or leakage of data and programs caused by cloud providers' careless or intentional infractions. As one of such countermeasures, secret sharing and secure computation by secure multi-party method has been studied to date. And, it has been used practically in some applications. This conventional method can calculate secret addition or subtraction easily, but to do secret multiplication it requires rather complex processes. We proposed before a method to maintain secrecy by dividing data and programs. As described herein, we first provide classification of our approaches including conventional secure multi-party computation method. Then we propose a new idea to conduct arithmetic multiplication and division easily as well as addition and subtraction, without using complex computational processes. Additionally, we present some practical real-world examples of our proposed method, and verify it.
引用
收藏
页码:859 / 866
页数:8
相关论文
共 12 条
  • [1] [Anonymous], NDSS 13
  • [2] Beimel A., 2011, P 3 INT C COD CRYPT
  • [3] Ben-David A., 2008, ACM CCS 08
  • [4] Bogdanov D., 2008, ESORICS 2008
  • [5] Canetti R., 1996, Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, P639, DOI 10.1145/237814.238015
  • [6] Catrina O., 2010, ESORICS 2010
  • [7] Chida K., 2011, J INF PROCESS, V52, P2674
  • [8] Cramer R., 2000, EUROCRYPT 00
  • [9] Fully Homomorphic Encryption Using Ideal Lattices
    Gentry, Craig
    [J]. STOC'09: PROCEEDINGS OF THE 2009 ACM SYMPOSIUM ON THEORY OF COMPUTING, 2009, : 169 - 178
  • [10] Han S., 2014, 76 NAT CONV IPSJ 3D