ID 原文 译文
21055 而后进一步利用Berstein-type不等式处理其中的中断概率约束，将其转化为凸的问题进行求解。 Then, the Bernstein-type inequality is utilized to deal with the outage probability limits, and it is transformed into a convex problem.
21056 仿真结果验证了该方案的安全性和鲁棒性。 Simulation results validate the security and the robustness of the proposed scheme.
21057 代理重加密在云计算环境下的密文共享等方面起着重要的作用。 Proxy re-encryption plays an important role for encrypted data sharing and so on in cloudcomputing.
21058 目前格上基于身份的代理重加密方案都是随机预言机模型的。 Currently, almost all of the constructions of identity-based proxy re-encryption over lattice are inthe random oracle model.
21059 针对这个问题，该文构造了一个高效的标准模型下格上基于身份的代理重加密方案。在方案中，用户身份仅仅被映射为一个向量，使得用户私钥的尺寸较短。 According to this problem, an efficient identity-based proxy re-encryption is constructed over lattice in the standard model, where the identity string is just mapped to one vector and getting a shorter secret key for users.
21060 该方案具有双向性，多次使用性等性质，并且在LWE困难假设下是适应性选择身份CPA安全的。 The proposed scheme has the properties of bidirectional, multi-use,moreover, it is semantic secure against adaptive chosen identity and chosen plaintext attack based on LearningWith Errors (LWE) problems in the standard mode.
21061 近年来，可搜索加密技术及细粒度访问控制的属性加密在云存储环境下得到广泛应用。 In recent years, searchable encryption technology and fine-grained access control attribute encryptionis widely used in cloud storage environment.
21062 考虑到现存的基于属性的可搜索加密方案存在仅支持单关键词搜索而不支持属性撤销的问题，以及单关键词搜索可能造成返回搜索结果部分错误并导致计算和宽带资源浪费的缺陷，该文提出一种支持属性撤销的可验证多关键词搜索加密方案。 Considering that the existing searchable attribute-based encryption schemes have some flaws: It only support single-keyword search without attribute revocation. The single-keyword search may result in the waste of computing and broadband resources due to the partial retrieval from search results. A verifiable multi-keyword search encryption scheme that supports revocation ofattributes is proposed.
21063 该方案允许用户检测云服务器搜索结果的正确性，同时在细粒度访问控制结构中支持用户属性的撤销，且在属性撤销过程中不需要更新密钥和重加密密文。 The scheme allows users to detect the correctness of cloud server search results while supporting the revocation of user attributes in a fine-grained access control structure without updating the keyor re-encrypting the ciphertext during revocation stage.
21064 该文在随机预言机模型下基于判定性线性假设被证明具有抵抗选择关键词集攻击安全性及关键词隐私性，同时从理论和实验两方面分析验证了该方案具有较高的计算效率与存储效率。 The afore mentioned scheme is proved by the deterministic linearity hypothesis, and the relevant analysis results indicate that it can resist the attacks of keyword selection and the privacy of keywords in the random oracle model with high computational efficiency and storage effectiveness.