Public Key Timed-Release Searchable Encryption in One-to-Many Scenarios

YUAN Ke; LIU Zhe-li; JIA Chun-fu; YANG Jun; L

doi:10.3969/j.issn.0372-2112.2015.04.019

您当前的位置：

首页 >

文章列表页 >

Public Key Timed-Release Searchable Encryption in One-to-Many Scenarios

更新时间：2025-07-16

- Public Key Timed-Release Searchable Encryption in One-to-Many Scenarios
- Acta Electronica Sinica Vol. 43, Issue 4, Pages: 760-768(2015)
- 作者机构：
  
  1. 河南大学计算机与信息工程学院,河南,开封,475004
  2. 南开大学计算机与控制工程学院,天津,300071
  3. 中国科学院信息工程研究所信息安全国家重点实验室,北京,100093
  4. 河南大学计算机与信息工程学院,河南,开封,475004
  5. 南开大学计算机与控制工程学院,天津,300071
  6. 中国科学院信息工程研究所信息安全国家重点实验室,北京,100093
- 作者简介：
- 基金信息：
- DOI：10.3969/j.issn.0372-2112.2015.04.019
  CLC： TP309.07
- Published：2015
- 稿件说明：
移动端阅览
YUAN Ke, LIU Zhe-li, JIA Chun-fu, et al. Public Key Timed-Release Searchable Encryption in One-to-Many Scenarios[J]. Acta Electronica Sinica, 2015, 43(4): 760-768.
DOI：

YUAN Ke, LIU Zhe-li, JIA Chun-fu, et al. Public Key Timed-Release Searchable Encryption in One-to-Many Scenarios[J]. Acta Electronica Sinica, 2015, 43(4): 760-768. DOI： 10.3969/j.issn.0372-2112.2015.04.019.

摘要

为有效解决多接收者时间相关密文检索问题

采用广播加密技术提出一对多公钥时控性可搜索加密机制发送者将加密的数据发送至云服务器

使得仅授权用户组成员可检索下载包含特定关键词的密文

但只能在指定的未来时间之后解密.给出方案及其安全游戏模型的形式化定义

提出两种基于

-DBDHI问题的可证明安全方案

并严格证明所提方案在自适应选择明文攻击下是安全的.效率分析表明

两种方案在执行过程中

实现了计算、存储、传输规模与用户规模无关;与相关方案相比

方案2具有更高效率.

Abstract

To solve the multi-receiver time-dependent ciphertext retrieval problem efficiently

by borrowing the technique of identity-based broadcast encryption

we propose a cryptosystem of one to many public key timed-release searchableencryption (PKTRSE

).In our PKTRSE

model

the sender transmits anencrypted message to cloud server so that only the intended authorized user group member can search the target ciphertext containing specified keywords

but cannot decrypt it until the release time in the future.We formalize the notion of PKTRSE

and its security game model.Then

we construct two provably secure PKTRSE

schemes which are secure under the q-DBDHI assumption and give the rigorous proof for both schemes.The efficiency analysis s

hows that the two schemes achieve constant costs from the sender's and the recipient's points of view in the running process of the system and the second scheme is more efficient than the relevant schemes.

关键词

Keywords

references

Views

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

An Automatic Construction Method of Indistinguishable Obfuscation for Generic Computing Circuits

Two Efficient Hierarchical Identity Based Signature Schemes

A New Message Authentication Code and Its Security Proof

An Efficient Signcryption Scheme for Secure Communication of VANET

Related Author

LI Yu

HAN Yi-liang

ZHU Shuai-shuai

王大印

温巧燕

徐津

WANG Yan-ming

ZHANG Fang-guo

Related Institution

Network and Information Security Key Laboratory of APF

Engineering College of Cryptography， Engineering University of the APF

State Key Laboratory of Information Security,Institute of Software,Chinese Academy of Science

Beijing Electronic Science and Technology Institute

State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications

⁰