Selective End-To-End Data-Sharing in the Cloud

被引:0
作者
Hoerandner, Felix [1 ]
Ramacher, Sebastian [2 ]
Roth, Simon [1 ]
机构
[1] Graz Univ Technol, Graz, Austria
[2] AIT Austrian Inst Technol, Vienna, Austria
来源
INFORMATION SYSTEMS SECURITY (ICISS 2019) | 2019年 / 11952卷
基金
欧盟地平线“2020”;
关键词
Data-sharing; End-to-end confidentiality; Proxy re-encryption; Redactable signatures; PROXY; ACCUMULATORS;
D O I
10.1007/978-3-030-36945-3_10
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Cloud-based services enable easy-to-use data-sharing between multiple parties, and, therefore, have been widely adopted over the last decade. Storage services by large cloud providers such as Drop-box or Google Drive as well as federated solutions such as Nextcloud have amassed millions of users. Nevertheless, privacy challenges hamper the adoption of such services for sensitive data: Firstly, rather than exposing their private data to a cloud service, users desire end-to-end confidentiality of the shared files without sacrificing usability, e.g., without repeatedly encrypting when sharing the same data set with multiple receivers. Secondly, only being able to expose complete (authenticated) files may force users to expose overmuch information. The receivers, as well as the requirements, might be unknown at issue-time, and thus the issued data set does not exactly match those requirements. This mismatch can be bridged by enabling cloud services to selectively disclose only relevant parts of a file without breaking the parts' authenticity. While both challenges have been solved individually, it is not trivial to combine these solutions and maintain their security intentions. In this paper, we tackle this issue and introduce selective end-to-end data-sharing by combining ideas from proxy re-encryption and redactable signature schemes. Proxy re-encryption provides us with the basis for end-to-end encrypted data-sharing, while redactable signatures enable to redact parts and selectively disclose only the remaining still authenticated parts. We overcome the issues encountered when naively combining these two concepts, introduce a security model, and present a modular instantiation together with implementations based on a selection of various building blocks. We conclude with an extensive performance evaluation of our instantiation.
引用
收藏
页码:175 / 195
页数:21
相关论文
共 38 条
[1]  
[Anonymous], 2016, NIST SPEC PUBL
[2]  
[Anonymous], 2002, LNCS
[3]  
[Anonymous], 2002, P 9 ACM C COMPUTER C
[4]  
Ateniese G., 2006, ACM Transactions on Information and Systems Security, V9, P1, DOI 10.1145/1127345.1127346
[5]  
Ateniese G., 2010, INTERNET SOC, V104, DOI [10.1007/978-3-642-13708-2_6, DOI 10.1007/978-3-642-13708-2_6]
[6]  
Ateniese G, 2009, LECT NOTES COMPUT SC, V5473, P279, DOI 10.1007/978-3-642-00862-7_19
[7]   Updating Key Size Estimations for Pairings [J].
Barbulescu, Razvan ;
Duquesne, Sylvain .
JOURNAL OF CRYPTOLOGY, 2019, 32 (04) :1298-1336
[8]  
Blaze M, 1998, LECT NOTES COMPUT SC, V1403, P127, DOI 10.1007/BFb0054122
[9]  
Boneh D, 2011, LECT NOTES COMPUT SC, V6597, P253, DOI 10.1007/978-3-642-19571-6_16
[10]  
Brzuska C, 2010, LECT NOTES COMPUT SC, V6123, P87, DOI 10.1007/978-3-642-13708-2_6