首页> 外文会议>International Conference on Information and Communications Security >Anonymous End to End Encryption Group Messaging Protocol Based on Asynchronous Ratchet Tree
【24h】

Anonymous End to End Encryption Group Messaging Protocol Based on Asynchronous Ratchet Tree

机译:基于异步棘轮的匿名端到结束加密组消息传递协议

获取原文

摘要

Double ratchet protocol was first proposed and used in Signal's end to end encryption and later widely applied by WhatsApp, Face-book and other popular applications. Asynchronous Ratchet Tree (ART) is the new group messaging protocol based on ratchet and is the first protocol that applied forward secrecy (FS) and post-compromised-security (PCS) in group key exchange. However, anonymity is not considered which is crucial for privacy preserving solutions. Thus, it is meaningful to provide anonymous features while applying FS and PCS. In this paper we propose "Anonymous Asynchronous Ratchet Tree (AART)" to improve the structure of ART to achieve anonymity in group messaging while retaining FS and PCS. Also, we formalize the definitions of anonymity as Internal Group Anonymity (IGA) and External Group Anonymity (EGA). We prove that our AART satisfies IGA and EGA as well as FS and PCS.
机译:首先提出双ratchet协议并用于信号端到端加密,后来广泛应用于WhatsApp,面部书和其他流行应用程序。 异步棘轮树(ART)是基于棘轮的新组消息传递协议,是应用程序组密钥交换中的前向保密(FS)和安全后安全性(PC)的第一个协议。 但是,不考虑匿名性,这对于隐私保存解决方案至关重要。 因此,在应用FS和PC时提供匿名功能是有意义的。 在本文中,我们提出了“匿名异步棘轮树(AART)”,以提高艺术结构,以在保留FS和PC的同时实现组消息传递中的匿名性。 此外,我们将匿名性的定义形式为内部组匿名(IGA)和外部组匿名(EGA)。 我们证明我们的AART满足IGA和EGA以及FS和PC。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号