欢迎您！东篱公司
退出
-
申报数据库
-
立项数据库
-
成果数据库
-
项目获奖数据库
中文摘要：
非承诺加密机制是语义安全的,不能抵抗选择密文攻击.在non-erase模型的安全假设下,基于非承诺加密机制的不经意传输协议不能实现自适应攻击者UC（Universally Composable）安全的定义.利用可否认加密体制和可验证平滑投影哈希函数,提出了一个新的不经意传输协议,可否认加密体制通过陷门承诺的双陷门解密技术实现,新协议方案是可证明UC安全的,基于公共参考串模型,安全性可以归约为确定性复合剩余假设.新协议参与方能够处理指数空间的消息,计算效率得到改善,通过两次协议交互可以实现string-OT协议,与bit-OT协议相比单轮通信效率提高O（n）倍。
英文摘要：
Non-committing encryption achieved only semantic security, in contrast, applications often require security against chosen ciphertext attacks.A main ingredient in the previous adaptive universally composable （UC） oblivious transfer protocols are non-committing encryptions, the previous proposals are not UC secure against adaptive adversaries in the so-called non-erase model. A new UC secure oblivious transfer protocols were proposed and schemes utilize two primitives of the verifiably smooth projective hashing and deniable encryption as constructed by. the double trapdoor decryption mechanism based on trapdoor commitment. Our construction is based on the decisional composite residuosity in common reference string （CRS） model. We constructed a two-message （1-round） string oblivious transfer protocol, which improves computational efficient that supports message spaces of size exponential and save O（n）-1 rounds communications efficient than bit-OT protocols.
同期刊论文项目
同项目期刊论文
位置：