Verifier-local revocation group signatures with backward unlinkability from lattices

For group signature(GS)supporting membership revocation,verifier-local revocation(VLR)mechanism seems to be a more flexible choice,because it requires only that verifiers download up-to-date revocation information for signature verification,and the signers are not involved.As a post-quantum secure cryptographic counterpart of classical number-theoretic cryptographic constructions,the first lattice-based VLR group signature(VLR-GS)was introduced by Langlois et al.(2014).However,none of the contemporary lattice-based VLR-GS schemes provide backward unlinkability(BU),which is an important property to ensure that previously issued signatures remain anonymous and unlinkable even after the corresponding signer(i.e.,member)is revoked.In this study,we introduce the first lattice-based VLR-GS scheme with BU security(VLR-GS-BU),and thus resolve a prominent open problem posed by previous works.Our new scheme enjoys an O(log N)factor saving for bit-sizes of the group public-key(GPK)and the member’s signing secret-key,and it is free of any public-key encryption.In the random oracle model,our scheme is proven secure under two well-known hardness assumptions of the short integer solution(SIS)problem and learning with errors(LWE)problem.

Lattice-Based Group Signature with Verifier-Local Revocation

Among several post quantum primitives proposed in the past few decades, lattice-based cryptography is considered as the most promising one, due to its underlying rich combinatorial structure, and the worst-case to average-case reductions. The first lattice-based group signature scheme with verifier-local revocation(VLR) is treated as the first quantum-resistant scheme supported member revocation, and was put forward by Langlois et al. This VLR group signature(VLR-GS) has group public key size of O(nm log N log q), and a signature size of O(tm log N log q log β). Nguyen et al. constructed a simple efficient group signature from lattice, with significant advantages in bit-size of both the group public key and the signature. Based on their work, we present a VLR-GS scheme with group public key size of O(nm log q) and signature size of O(tm log q). Our group signature has notable advantages: support of membership revocation, and short in both the public key size and the signature size.

FACOR：Flexible Access Control with Outsourceable Revocation in Mobile Clouds

Access control is a key mechanism to secure outsourced data in mobile clouds. Some existing solutions are proposed to enforce flexible access control on outsourced data or reduce the computations performed by mobile devices. However, less attention has been paid to the efficiency of revocation when there are mobile devices needed to be revoked. In this paper, we put forward a new solution, referred to as flexible access control with outsourceable revocation(FACOR) for mobile clouds. The FACOR applies the attribute-based encryption to enable flexible access control on outsourced data, and allows mobile users to outsource the time-consuming encryption and decryption computations to proxies, with only requiring attributes authorization to be fully trusted. As an advantageous feature, FACOR provides an outsourceable revocation for mobile users to reduce the complicated attribute-based revocation operations. The security analysis shows that our FACOR scheme achieves data security against collusion attacks and unauthorized accesses from revoked users. Both theoretical and experimental results confirm that our proposed scheme greatly reliefs the mobile devices from heavy encryption and decryption computations, as well as the complicated revocation of access rights in mobile clouds.

A Generic Construction of Ciphertext-Policy Attribute- Based Encryption Supporting Attribute Revocation

Attribute-based encryption is drawing more attention with its inherent attractive properties which are potential to be widely used in the newly developing cloud computing. However, one of the main obstacles for its application is how to revoke the attributes of the users, though some ABE schemes have realized revocation, they mostly focused on the user revocation that revokes the user＇s whole attributes, or attribute revocation under the indirect revocation model such that all the users＇ private keys will be affected by the revocation. In this paper, we define the model of CP-ABE supporting the attribute revocation under the direct revocation model, in which the revocation list is embed in the ciphertext and none of the users＇ private keys will be affected by the revocation process. Then we propose a generic construction, and prove its security with the decision q-BDHE assumption.

Adaptively Secure Attribute-Based Encryption Supporting Attribute Revocation

Attribute revocation is inevitable and al- so important for Attribute-Based Encryption （ABE） in practice. However, little attention has been paid to this issue, and it retrains one of the rmin obsta-cles for the application of ABE. Most of existing ABE schemes support attribute revocation work under indirect revocation model such that all the users＇ private keys will be affected when the revo-cation events occur. Though some ABE schemes have realized revocation under direct revocation model such that the revocation list is embedded in the ciphertext and none of the users＇ private keys will be affected by revocation, they mostly focused on the user revocation that revokes the user＇s whole attributes, or they can only be proven to be selectively secure. In this paper, we first define a model of adaptively secure ABE supporting the at- tribute revocation under direct revocation model. Then we propose a Key-Policy ABE （KP-ABE） scheme and a Ciphertext-Policy ABE （CP-ABE） scheme on composite order bilinear groups. Finally, we prove our schemes to be adaptively secure by employing the methodology of dual system eno cryption.

Attribute-Based Access Control Scheme with Efficient Revocation in Cloud Computing

Attribute-based encryption(ABE) supports the fine-grained sharing of encrypted data.In some common designs,attributes are managed by an attribute authority that is supposed to be fully trustworthy.This concept implies that the attribute authority can access all encrypted data,which is known as the key escrow problem.In addition,because all access privileges are defined over a single attribute universe and attributes are shared among multiple data users,the revocation of users is inefficient for the existing ABE scheme.In this paper,we propose a novel scheme that solves the key escrow problem and supports efficient user revocation.First,an access controller is introduced into the existing scheme,and then,secret keys are generated corporately by the attribute authority and access controller.Second,an efficient user revocation mechanism is achieved using a version key that supports forward and backward security.The analysis proves that our scheme is secure and efficient in user authorization and revocation.

AN EFFICIENT FORWARD SECURE GROUP SIGNATURE SCHEME WITH REVOCATION

Up to now, how to construct an efficient secure group signature scheme, which needs not to reset the system when some group members' signing keys are exposed, is still a difficult problem. A construction concerning revocation of group members is an ideal one if it satisfies forward security which makes it more attractive for not sacrificing the security of past signatures of deleted members. This paper analyses the problem and gives a construction in which the group manager can be un-trustworthy. The scheme is efficient even when the number of revoked members is large.

A Cluster-Based Random Key Revocation Protocol for Wireless Sensor Networks

In recent years,several random key pre-distribution schemes have been proposed to bootstrap keys for encryption,but the problem of key and node revocation has received relatively little attention.In this paper,based on a random key pre-distribution scheme using clustering,we present a novel random key revoca-tion protocol,which is suitable for large scale networks greatly and removes compromised information efficiently.The revocation protocol can guarantee network security by using less memory consumption and communication load,and combined by centralized and distributed revoca-tion,having virtues of timeliness and veracity for revoca-tion at the same time.

Efficient Membership Revocation in ACJT Group Signature

How to find efficient and secure member- ship revocation algorithms is one of the most important issues standing in the way of real-world applications of group signatures. In this paper, the proof of knowledge of divisibility is given and a novel membership revocation method in ACJT group signature scheme is proposed： the group manager issues the product E of the public keys of current members in the group, when a group member wants to sign, he should not only proves that he has a membership certificate, but also proves that the public key in his certificate divides exactly the public key product E with zero knowledge. The proposed method is efficient since the group manager only needs one division and one exponentiation when a group member is deleted, while the signing and verifying procedure are independent of the number of current group members and excluded members, as well as the original group public key and membership certificates needn＇t be changed.

Tree-Based Revocation for Certificateless Authentication in Vehicular Ad-Hoc Networks

This work proposes authentication based on identity as a way to increase the efficiency and security of communications in vehicular ad-hoc networks. When using identity-based cryptography to achieve certificateless authentication, membership revocation is not a trivial problem. Thus, in order to improve the performance of revocation in such networks, the use of a dynamic authenticated data structure based on perfect k-ary hash trees combined with a duplex version of the new standard SHA-3 is here presented. Efficient algorithms in the used revocation trees allow reaching a refresh rate of at most simple updates per inserted node. Consequently, the proposal is especially useful for situations with frequent revocations, which are foreseeable when vehicular ad- hoc networks are widely deployed.

Attribute-Based Secure Data Sharing with Efficient Revocation in Fog Computing

Fog computing is a concept that extends the paradigm of cloud computing to the network edge. The goal of fog computing is to situate resources in the vicinity of end users. As with cloud computing, fog computing provides storage services. The data owners can store their confidential data in many fog nodes, which could cause more challenges for data sharing security. In this paper, we present a novel architecture for data sharing in a fog environment. We explore the benefits of fog computing in addressing one-to-many data sharing applications. This architecture sought to outperform the cloud-based architecture and to ensure further enhancements to system performance, especially from the perspective of security. We will address the security challenges of data sharing, such as fine-grained access control, data confidentiality, collusion resistance, scalability, and the issue of user revocation. Keeping these issues in mind, we will secure data sharing in fog computing by combining attributebased encryption and proxy re-encryption techniques. Findings of this study indicate that our system has the response and processing time faster than classical cloud systems. Further, experimental results show that our system has an efficient user revocation mechanism, and that it provides high scalability and sharing of data in real time with low latency.

Public integrity verification for data sharing in cloud with asynchronous revocation

Cloud data sharing service,which allows a group of people to access and modify the shared data,is one of the most popular and efficient working styles in enterprises.Recently,there is an uprising trend that enterprises tend to move their IT service from local to cloud to ease the management and reduce the cost.Under the new cloud environment,the cloud users require the data integrity verification to inspect the data service at the cloud side.Several recent studies have focused on this application scenario.In these studies,each user within a group is required to sign a data block created or modified by him.While a user is revoked,all the data previously signed by him should be resigned.In the existing research,the resigning process is dependent on the revoked user.However,cloud users are autonomous.They may exit the system at any time without notifying the system admin and even are revoked due to misbehaviors.As the developers in the cloud-based software development platform,they are voluntary and not strictly controlled by the system.Due to this feature,cloud users may not always follow the cloud service protocol.They may not participate in generating the resigning key and may even expose their secret keys after being revoked.If the signature is not resigned in time,the subsequent verification will be affected.And if the secret key is exposed,the shared data will be maliciously modified by the attacker who grasps the key.Therefore,forcing a revoked user to participate in the revocation process will lead to efficiency and security problems.As a result,designing a practical and efficient integrity verification scheme that supports this scenario is highly desirable.In this paper,we identify this challenging problem as the asynchronous revocation,in which the revocation operations(i.e.,re-signing key generation and resigning process)and the user's revocation are asynchronous.All the revocation operations must be able to be performed without the participation of the revoked user.Even more ambitiously,the revocation process should not rely on any special entity,such as the data owner or a trusted agency.To address this problem,we propose a novel public data integrity verification mechanism in which the data blocks signed by the revoked user will be resigned by another valid user.From the perspectives of security and practicality,the revoked user does not participate in the resigning process and the re-signing key generation.Our scheme allows anyone in the cloud computing system to act as the verifier to publicly and efficiently verify the integrity of the shared data using Homomorphic Verifiable Tags(HVTs).Moreover,the proposed scheme resists the collusion attack between the cloud server and the malicious revoked users.The numerical analysis and experimental results further validate the high efficiency and scalability of the proposed scheme.The experimental results manifest that re-signing 10,000 data blocks only takes 3.815 s and a user can finish the verification in 300 ms with a 99% error detection probability.

An efficient voting based decentralized revocation protocol for vehicular ad hoc networks

Vehicular Ad-hoc NETworks(VANETs)enable cooperative behaviors in vehicular environments and are seen as an integral component of Intelligent Transportation Systems(ITSs).The security of VANETs is crucial for their successful deployment and widespread adoption.A critical aspect of preserving the security and privacy of VANETs is the efficient revocation of the ability of misbehaving or malicious vehicles to participate in the network.This is usually achieved by revoking the validity of the digital certificates of the offending nodes and by maintaining and distributing an accurate Certificate Revocation List(CRL).The immediate revocation of misbehaving vehicles is of prime importance for the safety of other vehicles and users.In this paper,we present a decentralized revocation approach based on Shamir’s secret sharing to revoke misbehaving vehicles with very low delays.Besides enhancing VANETs’security,our proposed protocol limits the size of the revocation list to the number of the revoked vehicles.Consequently,the authentication process is more efficient,and the communication overhead is reduced.We experimentally evaluate our protocol to demonstrate that it provides a reliable solution to the scalability,efficiency and security of VANETs.

Research on the Commutation Revocation

In order to resist some prisoner who have received rewards of commutation to implement some illegal or criminal behavior in the course of imprisonment, the system of commutation revocation must be established, which can advantage imprisonment and reduce the costs of imprisonment. The system of commutation revocation can obey to the criminal policy of temper justice with mercy and the principle of ＂collecting mistakes whenever discovered＂ and obtain the penalty goal of special prevention. In order to protect some prisoner＇ s benefit, the prisoner who be revoked the rewards of commutation can take part in the course of juice, the postbox which be opened only by the NPC and committee must be installed in prison. This will be advantage of some prisoner who be revoked the rewards of commutation appealing to the NPC and committee. Because of weakness of necessarily and execution, the system of commutation revocation cannot be established when the prisoner have been released currently.

可撤销属性加密的区块链数据访问控制方法

针对区块链数据共享中存在的粗粒度访问控制问题,提出一种基于属性撤销密文策略属性基加密的区块链数据访问控制方法。在现有方案基础上进行改造,引入预解密过程,结合属性撤销列表实现属性实时撤销;基于非对称群下的DBDH困难问题假设进行安全性证明;基于超级账本Fabric进行系统设计,结合星际文件系统采用链上链下存储方式解决区块链容量不足和系统效率问题。实验结果表明,所提方案撤销属性时无需更新密钥密文重复上链,仅需要6次Pairing操作进行预解密和解密,且在大规模属性集下,预解密时间和解密时间平均保持在百毫秒左右的常量级上,实现区块链数据高效、细粒度的访问控制。

可撤销云安全多用户密文检索设计与实验分析

针对现有多用户密文检索方案的安全隐患,提出了一种可撤销的云安全多用户密文检索方案。陷门包含长期私钥和时间私钥,用户对时间私钥进行周期性更新,当用户想要撤销对云服务器的授权时,仅需停止分发时间私钥。同时,所提方案可以通过公共信道传输时间私钥,极大地减少了信道建立的代价。最后,给出了性能和仿真实验分析。结果表明,所提方案在实现授权撤销功能的同时,具有安全性高、检索速度快等优点。

基于区块链免密钥托管的可追踪可撤销属性基加密方案

针对密文策略属性基加密(CP-ABE)方案难以高效地同时满足免密钥托管、策略隐藏、用户追踪和撤销问题,提出一种基于区块链免密钥托管的可追踪可撤销属性基加密方案(BETRABE)。首先,区块链网络中的节点为属性机构,用户只需与区块链网络通过公开信道进行少量通信即可获得解密密钥;其次,融合公钥加密对区块链中存储的用户解密密钥进行加密,用户本地只需存储公钥加密的公私钥;另外,追踪系统中泄露密钥的恶意用户,通过将该用户加入撤销列表和云服务器对密文更新实现恶意用户撤销。此外,使用单向匿名密钥协商协议实现密文访问策略全隐藏,进而更好地保护存储在云服务器上密文的隐私性。基于l-SDH(l-Strong Diffie-Hellman)假设在标准模型下进行安全性验证。实验结果表明,BETRABE极大地减少了密钥生成阶段的通信成本和用户的密钥存储开销,加密和解密时间随着用户属性数增加线性增长,且相较于其他方案拥有较高的解密效率。

论授益行政行为职权撤销的除斥期间——以《行政程序法》制定为视角

职权撤销是按照依法行政原则对违法行政行为的消灭,属于行政机关的自我纠错行为。对于具有持续性法律效果的授益行政行为,毫无时间限制的职权撤销,将对其构建的法律关系网的稳定性及所涉利害关系人权益产生重大影响。职权撤销的期限在性质上属于除斥期间。出于维护法律秩序安定性、规范行政权、避免私方利益遭受更大损失以及避免“过”与“罚”严重失衡等考虑,授益行政行为职权撤销宜设置除斥期间。通过比较研究,出于不同规范功能,除斥期间宜采用短期限与最长期限相结合的方式。短期限采用主观起算标准,以行政机关知道撤销事由之日作为期间起算点;最长期限采用客观起算标准,以行政行为作出之日为期间起算点。因相对人欺诈而行政行为违法的,职权撤销除斥期间只宜设定短期限。

任务匹配系统中高效可撤销属性加密方案

针对传统任务匹配系统中数据处理存在的安全隐私和成本开销问题,提出了一种适用于资源有限系统的高效可撤销外包密文策略属性加密方案.通过将传统的加密分为用户离线和在线加密阶段两部分实现快速加密,并将密文外包给云服务器再与区块链建立联系以降低用户计算成本,最后利用变色龙哈希函数更新用户私钥进行属性撤销和用户撤销两类细粒度撤销.最后通过实验表明,该方案与现有可撤销属性加密方案相比,可以抵御密钥泄露和共谋攻击,且具有更低的时间开销.

专利权恶意取得及其规制路径

伪造并不真实存在的技术方案、明知为现有技术(或现有设计)、故意侵犯他人技术秘密并申请专利,以及违反保密审查义务在外国申请专利后又在中国国内申请专利等四种行为,是典型的专利权恶意取得行为。根据这些行为所侵害的法益为公共利益或是特定第三人利益,可以将其分为无效的专利权恶意取得行为与可撤销的专利权恶意取得行为。对于前者,任何单位或者个人都可以向国务院专利行政部门请求宣告专利权无效;对于后者,只能由利益受到损害的特定第三人主张撤销原授权决定,并请求变更权利归属。专利权恶意取得行为的规制,既需要司法机关在个案中层层把关、细致甄别,又需要行政审查机关注重源头治理、加强事后惩戒,形成协同治理体系。