密文策略属性加密中的撤销控制方案

在云环境下使用数据共享功能时，由于云环境的复杂性，需要对数据进行安全保护和访问控制，这就要求使用加密机制。基于密文策略属性的加密（CP-ABE）是当前广泛使用的加密机制，它可以根据用户的属性来设置访问权限，任何具有合格访问权限的用户都可以访问数据。然而云是一个动态环境，有时可能只允许具有访问权限用户中的一部分用户访问数据，这就需要用户权限的撤销机制。然而，在CP-ABE中，访问权撤销或用户撤销是一个冗长且代价高昂的事件。所提出方案根据对CP-ABE流程的改进，在原密文中嵌入了可灵活控制的用户个人秘密，使得用户权限撤销时既不要求使用新访问策略的用户撤销数据，也不要求对数据进行重新加密，大幅减少撤销时的计算成本。与知名CP-ABE撤销方案对比，所提出方案的计算成本更低且具有良好的安全性。     

高效可撤销的身份基在线离线加密方案

身份基加密（IBE）需要提供一种有效的成员撤销机制，然而，现有可撤销成员的IBE方案存在密钥更新和加密运算量过大的问题，可能使执行该操作的设备成为系统的瓶颈。将完全子树方法和在线离线技术相结合，通过修改指数逆类型IBE的密钥生成和加密算法，提出了一种高效可撤销的身份基在线离线加密方案。方案利用完全子树方法生成更新钥，使得撤销用户无法获得更新钥，进而失去解密能力；利用在线离线技术，将大部分加密运算在离线阶段进行预处理，使得在线阶段仅执行少量简单计算即可生成密文。与相关知名方案相比，该方案不仅提高密钥生成中心的密钥更新的效率，而且极大减少了轻量级设备的在线加密工作量，适合于轻量级设备保护用户隐私信息。     

基于ATP-ABE的访问控制方案

对访问控制机制中存在的安全性和有效性的问题进行了研究，提出了基于访问树剪枝的属性加密ATP-ABE（Access Tree Pruning Attribute Based Encryption）的访问控制方案。当ATP-ABE算法需要访问它的树型结构访问策略时，通过剪枝处理访问树结构中包含用户ID属性节点的分支，提高了用户所有者DO（Data Owner）管理和控制属性的效率，更加有效地实现了数据共享。还为访问树结构设计了许可访问属性，使DO仍保留共享数据的关键属性，并且能够完全控制它们的共享数据。基于决策双线性密钥交换算法DBDH（Decisional Bilinear Diffie-Hellman）假设分析了ATP-ABE方案的安全性，研究结果表明与两种经典ABE方案比较，ATP-ABE更加有效地减少了算法的系统设置、私钥生成、密文大小、用户属性撤销以及加解密过程中的计算开销，并给出了定量结论。     

A Traceable Capability-based Access Control for IoT

Delegation mechanism in Internet of Things (IoT) allows users to share some of their permissions with others. Cloud-based delegation solutions require that only the user who has registered in the cloud can be delegated permissions. It is not convenient when a permission is delegated to a large number of temporarily users. Therefore, some works like CapBAC delegate permissions locally in an offline way. However, this is difficult to revoke and modify the offline delegated permissions. In this work, we propose a traceable capability-based access control approach (TCAC) that can revoke and modify permissions by tracking the trajectories of permissions delegation. We define a time capability tree (TCT) that can automatically extract permissions trajectories, and we also design a new capability token to improve the permission verification, revocation and modification efficiency. The experiment results show that TCAC has less token verification and revocation/modification time than those of CapBAC and xDBAuth. TCAC can discover 73.3% unvisited users in the case of delegating and accessing randomly. This provides more information about the permissions delegation relationships, and opens up new possibilities to guarantee the global security in IoT delegation system. To the best of our knowledge, TCAC is the first work to capture the unvisited permissions.     

A novel electronic cash system with trustee-based anonymity revocation from pairing

Untraceable electronic cash is an attractive payment tool for electronic-commerce because its anonymity property can ensure the privacy of payers. However, this anonymity property is easily abused by criminals. In this paper, several recent untraceable e-cash systems are examined. Most of these provide identity revealing only when the e-cash is double spent. Only two of these systems can disclose the identity whenever there is a need, and only these two systems can prevent crime. We propose a novel e-cash system based on identity-based bilinear pairing to create an anonymity revocation function. We construct an identity-based blind signature scheme, in which a bank can blindly sign on a message containing a trustee-approved token that includes the user’s identity. On demand, the trustee can disclose the identity for e-cash using only one symmetric operation. Our scheme is the first attempt to incorporate mutual authentication and key agreement into e-cash protocols. This allows the proposed system to attain improvement in communication efficiency when compared to previous works.     

群签名中成员撤销问题解决方案

针对Camenisch-Stadler群签名方案中无法撤销成员的问题,提出了一种有效的群成员撤销方案,该方案可以灵活地增加和撤销群成员。当成员加入时,群主管向其颁发成员证书,其他成员无需更新成员密钥和证书;当成员撤销时,群主管只需将撤销成员的匿名身份更新到撤销列表中,无需更新群密钥和其他成员证书,且签名长度与验证工作量均独立于群成员和已撤销成员的个数。因此,新方案适用于群成员数较多和成员更新比较频繁的群签名。     

基于信誉的快速无可信第三方匿名撤销方案

首先指出ESORICS 2012中匿名撤销方案PE(AR)2的安全问题,然后提出一个基于信誉的不依赖可信第三方的快速匿名撤销方案。该方案允许服务提供者赋予匿名会话正分或者负分并封禁信誉过低的用户。实验结果表明当K=80时,本方案可以支持每分钟820次的登录请求,而此前最快速的方案PERM只能支持每分钟21次的登录请求。     

云社交网络中安全高效的加密数据共享机制(英文)

Despite that existing data sharing systems in online social networks(OSNs)propose to encrypt data before sharing,the multiparty access control of encrypted data has become a challenging issue.In this paper,we propose a secure data sharing scheme in OSNs based on ciphertext-policy attributebased proxy re-encryption and secret sharing.In order to protect users' sensitive data,our scheme allows users to customize access policies of their data and then outsource encrypted data to the OSNs service provider.Our scheme presents a multiparty access control model,which enables the disseminator to update the access policy of ciphertext if their attributes satisfy the existing access policy.Further,we present a partial decryption construction in which the computation overhead of user is largely reduced by delegating most of the decryption operations to the OSNs service provider.We also provide checkability on the results returned from the OSNs service provider to guarantee the correctness of partial decrypted ciphertext.Moreover,our scheme presents an efficient attribute revocation method that achieves both forward and backward secrecy.The security and performance analysis results indicate that the proposed scheme is secure and efficient in OSNs.