论文标题

2FE:用于云存储的两因素加密

2FE: Two-Factor Encryption for Cloud Storage

论文作者

Dalskov, Anders, Lain, Daniele, Ulqinaku, Enis, Kostiainen, Kari, Capkun, Srdjan

论文摘要

当前有许多商业解决方案可用,加密的云存储服务正在稳步增长。在这样的解决方案中,云存储是可靠的数据可用性的,但不是为了机密性。此外,用户的设备被认为是安全的,并且预计用户的行为正确。 我们认为,实际上并未实现此类假设:例如,用户通常会忘记密码,无法做出备份,而用户的设备被盗或被恶意软件感染。因此,我们考虑了一个更广泛的威胁模型,其中用户的设备容易受到攻击,并且可能会出现常见的人类错误。鉴于此模型,我们分析了10种流行的商业服务,并表明它们都没有提供良好的机密性和数据可用性。 由于市场上缺乏足够的解决方案,我们设计了一种名为“两因素加密”(2FE)的新型方案,该方案从两因素身份验证中汲取灵感,并将文件加密和解密转换为交互式过程,其中两个用户设备(例如笔记本电脑和智能手机)必须相互作用。 2FE提供了强大的机密性和可用性保证,因为它可以承受损坏的云存储,一次被盗或折衷的用户设备以及各种人类错误。 2FE通过利用秘密共享的其他技术来实现这一目标,例如遗忘的伪随机函数和零知识证明。我们通过实验评估2FE,并表明其性能开销很小。最后,我们解释了如何将方法适应其他相关用例,例如加密货币钱包。

Encrypted cloud storage services are steadily increasing in popularity, with many commercial solutions currently available. In such solutions, the cloud storage is trusted for data availability, but not for confidentiality. Additionally, the user's device is considered secure, and the user is expected to behave correctly. We argue that such assumptions are not met in reality: e.g., users routinely forget passwords and fail to make backups, and users' devices get stolen or become infected with malware. Therefore, we consider a more extensive threat model, where users' devices are susceptible to attacks and common human errors are possible. Given this model, we analyze 10 popular commercial services and show that none of them provides good confidentiality and data availability. Motivated by the lack of adequate solutions in the market, we design a novel scheme called Two-Factor Encryption (2FE) that draws inspiration from two-factor authentication and turns file encryption and decryption into an interactive process where two user devices, like a laptop and a smartphone, must interact. 2FE provides strong confidentiality and availability guarantees, as it withstands compromised cloud storage, one stolen or compromised user device at a time, and various human errors. 2FE achieves this by leveraging secret sharing with additional techniques such as oblivious pseudorandom functions and zero-knowledge proofs. We evaluate 2FE experimentally and show that its performance overhead is small. Finally, we explain how our approach can be adapted to other related use cases such as cryptocurrency wallets.

扫码加入交流群

加入微信交流群

微信交流群二维码

扫码加入学术交流群,获取更多资源