|
|
|
题名
|
作者
|
年代
|
出处
|
被引量
|
| 1 | Certificateless Public Key Encryption with Keyword Search显示文摘Public Key Encryption with Keyword Search(PEKS),an indispensable part of searchable encryption,is stock-intrade for both protecting data and providing operability of encrypted data.So far most of PEKS schemes have been established on Identity-Based Cryptography(IBC) with key escrow problem inherently.Such problem severely restricts the promotion of IBC-based Public Key Infrastructure including PEKS component.Hence,Certificateless Public Key Cryptography(CLPKC) is efficient to remove such problem.CLPKC is introduced into PEKS,and a general model of Certificate/ess PEKS(CLPEKS) is formalized.In addition,a practical CLPEKS scheme is constructed with security and efficiency analyses.The proposal is secure channel free,and semantically secure against adaptive chosen keyword attack and keyword guessing attack.To illustrate the superiority,massive experiments are conducted on Enron Email dataset which is famous in information retrieval field.Compared with existed constructions,CLPEKS improves the efficiency in theory and removes the key escrow problem. | PENG Yanguo CUI Jiangtao PENG Changgen YING Zuobin | 2014 | China Communications2014,11,11: | 21 |
| 2 | Adaptively secure ciphertext-policy attribute-based encryption with dynamic policy updating显示文摘Attribute-Based Encryption(ABE) is a promising new cryptographic technique which guarantees fine-grained access control of outsourced encrypted data in the cloud. With the help of ABE, the majority of security issues in accessing cloud data can be solved. However, a key limitation remains, namely policy updating.Whenever the access policy is updated, a common approach is to have the data owner retrieve the data and reencrypt it with new policy, before sending the new ciphertext back to the cloud. This straight-forward approach will lead to heavy computation and communication overhead. Although a number of other approaches have been proposed in this regard, they suffer from two limitations; namely, supporting only limited update-policy types or having weak security models. In order to address these limitations, we propose a novel solution to the attribute-based encryption access control system by introducing a dynamic policy-updating technique which we call DPU-CP-ABE. The scheme is proved to be adaptively secure under the standard model and can support any type of policy updating. In addition, our scheme can significantly reduce the computation and communication costs of updating ciphertext. | Zuobin YING Hui LI Jianfeng MA Junwei ZHANG Jiangtao CUI | 2016 | Science China(Information Sciences)2016,59,4: | 3 |
| 3 | AWI-BS: An adaptive weight incentive for blockchain sharding显示文摘The sharding technique enables blockchain to process transactions in parallel by dividing blockchain nodes into small groups,each of which handles a subset of all transactions.One of the issues with blockchain sharding is generating a large number of cross-shard transactions that need to be checked on the output shard as well as the destination shard.Our analysis suggests that the processing efficiency of cross-shard transactions is consistent with the barrel effect,i.e.,that efficiency is more dependent on slower processing shard.Most of the existing studies focus on how to deal with cross-shard transactions,but neglecting the fact that the relative independence between sharding results in different incentive costs between sharding.We perform a sharding analysis on 100,000 real transactions data on Ethereum,and the results show that there is a large difference in gas prices between different shards indeed.In this paper,we propose an Adaptive Weight Incentive(AWI)for Blockchain Sharding,which uses adaptive weight in place of traditional incentive,to address the problem of differing incentive costs for each shard.Take Ethereum as an example,AWI-BS computes the weight of a transaction as a function of a combination of the underlying gas price,the latency of the transaction,and the urgency of the transaction.Then the node chooses which transaction to pack based on the AWI-BS.Lastly,we also perform an in-depth analysis of AWI-BS's security and effectiveness.The evaluation indicates that AWI-BS outperforms the other alternatives in terms of transaction confirmation latency,transaction hit rate,and system throughput. | Zuobin Ying Laican Song Deng Chen Wusong Lan Ximeng Liu | 2023 | Journal of Information and Intelligence2023,1,2: | 1 |
| 4 | P2HBT:Partially Policy Hidden E-Healthcare System with Black-Box Traceability显示文摘Electronic health record(EHR),as the core of the e-healthcare system,is an electronic version of patient medical history,which records personal healthrelated information.EHR embodies the value of disease monitoring through large-scale sharing via the Cloud service provider(CSP).However,the health data-centric feature makes EHR more preferable to the adversaries compared with other outsourcing data.Moreover,there may even be malicious users who deliberately leak their access privileges for benefits.An e-healthcare system with a black-box traceable and robust data security mechanism is presented for the first time.Specifically,we propose an effective P2 HBT,which can perform fine-grained access control on encrypted EHRs,prevent the leakage of privacy contained in access policies,and support tracing of traitors.Under the standard model,the scheme is proved fully secure.Performance analysis demonstrates that P2HBT can achieve the design goals and outperform existing schemes in terms of storage and computation overhead. | YING Zuobin SI Yuanping MA Jianfeng JIANG Wenjie XU Shengmin LIU Ximeng | 2021 | Chinese Journal of Electronics2021,30,2: | 0 |