首页> 外文会议>IEEE International Conference on Cloud Computing Technology and Science >Background Knowledge-Resistant Traffic Padding for Preserving User Privacy in Web-Based Applications
【24h】

Background Knowledge-Resistant Traffic Padding for Preserving User Privacy in Web-Based Applications

机译:背景技术抗性交通填充,用于保留基于Web的应用程序中的用户隐私

获取原文

摘要

While enjoying the convenience of Software as a Service (SaaS), users are also at an increased risk of privacy breaches. Recent studies show that a Web-based application may be inherently vulnerable to side-channel attacks which exploit unique packet sizes to identify sensitive user inputs from encrypted traffic. Existing solutions based on packet padding or packet-size rounding generally rely on the assumption that adversaries do not possess prior background knowledge about possible user inputs. In this paper, we propose a novel random ceiling padding approach whose results are resistant to such adversarial knowledge. Specifically, the approach injects randomness into the process of forming padding groups, such that an adversary armed with background knowledge would still face sufficient uncertainty in estimating user inputs. We formally present a generic scheme and discuss two concrete instantiations. We then confirm the correctness and performance of our approach through both theoretic analysis and experiments with two real world applications.
机译:虽然享受作为服务的软件的便利性(SaaS),但用户也增加了隐私泄露的风险。最近的研究表明,基于Web的应用程序可能本身可以容易受到侧信机攻击,该攻击攻击利用唯一的分组尺寸来识别来自加密流量的敏感用户输入。基于数据包填充或分组大小的现有解决方案通常依赖于假设对手不具有关于可能的用户输入的先前背景知识。在本文中,我们提出了一种新的随机天花板填充方法,其结果抵抗这种对抗性知识。具体地,该方法将随机性注入形成填充基团的过程中,使得在估计用户输入时仍然面临足够的不确定性。我们正式提出了一种通用方案并讨论了两个具体的实例化。然后,我们通过两个现实世界应用的理论分析和实验确认我们的方法的正确性和性能。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号