期刊文献+

Multi-User File-Sharing Systems Based on LWE 被引量:1

下载PDF
导出
摘要 Multi-user file-sharing plays an important role in the cloud storage.It allows different users to share files via the cloud.However,it usually faces many security issues because the cloud is usually public and semi-trusted.To overcome these issues,we propose multi-user file-sharing systems(MFS)in this paper.According to the date sources,we propose two frameworks of MFS based on the framework of proxy re-encryption(PRE),unique source(uni-source)MFS and multi-source MFS.We formalize the security models,which contain ciphertext security,secret key security and master secret security.With the frameworks,we propose two secure and efficient MFS schemes based on LWE,the uni-source MFS UM and the multi-source MFS MM.We prove that UM is secret key and ciphertext security,and MM is secret key,master secret and ciphertext security with the hardness assumptions of LWE and SIS.Furtherly,we prove they have some useful properties,such as non-interactive and anonymous.
出处 《China Communications》 SCIE CSCD 2020年第7期166-182,共17页 中国通信(英文版)
基金 supported by Purple Mountain Laboratories,Frontiers Science Center for Mobile Information Communication and Security,and Science and technology project of Jiangsu province(No.BE2019019)。
  • 相关文献

参考文献1

二级参考文献21

  • 1Vadim Lyubashevsky,Chris Peikert,Oded Regev.On Ideal Lattices and Learning with Errors over Rings[J]. Journal of the ACM (JACM) . 2013 (6)
  • 2Oded Regev.On lattices, learning with errors, random linear codes, and cryptography[J]. Journal of the ACM (JACM) . 2009 (6)
  • 3Chris Peikert.Limits on the Hardness of Lattice Problems in ? p Norms[J]. computational complexity . 2008 (2)
  • 4Dorit Aharonov,Oded Regev.Lattice problems in NP ∩ coNP[J]. Journal of the ACM (JACM) . 2005 (5)
  • 5Subhash Khot.Hardness of approximating the shortest vector problem in lattices[J]. Journal of the ACM (JACM) . 2005 (5)
  • 6Oded Regev.New lattice-based cryptographic constructions[J]. Journal of the ACM (JACM) . 2004 (6)
  • 7I. Dinur,G. Kindler,R. Raz,S. Safra.Approximating CVP to Within Almost-Polynomial Factors is NP-Hard[J]. COMBINATORICA . 2003 (2)
  • 8Irit Dinur.Approximating SVP ∞ to within almost-polynomial factors is NP-hard[J]. Theoretical Computer Science . 2002 (1)
  • 9O. Goldreich,D. Micciancio,S. Safra,J.-P. Seifert.Approximating shortest lattice vectors is not harder than approximating closest lattice vectors[J]. Information Processing Letters . 1999 (2)
  • 10Martin Henk.Note on shortest and nearest lattice vectors[J]. Information Processing Letters . 1997 (4)

共引文献5

同被引文献4

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部