可验证性
可验证性的相关文献在1990年到2022年内共计146篇,主要集中在自动化技术、计算机技术、经济计划与管理、无线电电子学、电信技术
等领域,其中期刊论文135篇、会议论文5篇、专利文献465614篇;相关期刊87种,包括合作经济与科技、经济技术协作信息、商场现代化等;
相关会议5种,包括2014全国高性能计算学术年会、第三届全国科技哲学暨交叉学科研究生论坛、2009年西南地区网络与信息系统学术年会等;可验证性的相关文献由263位作者贡献,包括李志慧、甘元驹、刘忆宁等。
可验证性—发文量
专利文献>
论文:465614篇
占比:99.97%
总计:465754篇
可验证性
-研究学者
- 李志慧
- 甘元驹
- 刘忆宁
- 张福康
- 彭凌西
- 彭银桥
- 李婧
- 王志亮
- 赖红
- 赵建杰
- 邓锐
- 陈月峰
- 于佳
- 刘祥
- 吴宏锋
- 周可兵
- 孙瑞
- 张京花
- 张兴兰
- 张剑
- 张建中
- 张晓辉
- 戴芳
- 施荣华
- 李聪
- 杨晓元
- 林昌露
- 欧海文
- 王育民
- 王静
- 田有亮
- 秦静
- 芦殿军
- 范晓阳
- 赵凤群
- 赵志远
- 赵荣
- 邢红蕊
- 郭玉娟
- 钱家欢
- 阳杰
- 雒京华
- 韦性佳
- L.杨
- Q.郑
- WANG Jie
- X.范
- YU Xiao
- ZHAO Ming
- 丁健
-
-
高岩;
黄成杭;
梁佐泉;
冯四风
-
-
摘要:
经典的Shamir秘密共享方案,部分参与者提供无效的子秘密导致秘密重构失败,为此,设计一种基于SM2与SM4签密的可验证秘密共享方案。分发者将秘密拆分为n个子秘密,然后使用SM2与SM4签密方案对子秘密进行签密,生成的n个签密数据依次分发给n个参与者;当需要恢复原始秘密时,任意t个参与者参与秘密重构可以恢复原始秘密,重构前先对参与者的签密数据进行解签密,验证失败则拒绝重构;解密得到的t个子秘密可以重构恢复原始秘密。方案可以根据实际需要动态设置门限值t和参与者n的取值。仿真实验验证了方案的正确性、安全性和不可伪造性。
-
-
赵博;
刘晋璐;
秦静
-
-
摘要:
通配符可搜索加密因能够灵活地支持关键词的部分匹配,在安全存储服务中有重要的应用价值,但大多数现有的通配符可搜索加密方案都未考虑服务器恶意的情况,且利用布隆过滤构造索引,搜索结果存在假阳性.为此,本文提出了一个无假阳性的可验证通配符可搜索加密方案.该方案通过对关键词编码将通配符搜索转化为范围搜索,并利用保序加密保证明文文本字典顺序和密文数值顺序的一致性,对于含任意单字符通配符的关键词包含的明文文本字典区间都对应着确定的密文数值范围,实现了搜索结果无假阳性.进一步,提出有序二叉位图树(ordered binary bitmap tree,OBBT)索引与逐层匹配算法提高了搜索效率.通过在OBBT的叶子节点存储索引关键词对应的验证标签,实现了搜索结果正确性和完整性的验证.安全性分析表明方案是非适应性语义安全的.性能分析表明,相对以往方案搜索效率也有明显提升.
-
-
张恩;
李会敏;
常键
-
-
摘要:
针对现有云外包隐私保护k-means聚类方案存在的效率不高,以及当云服务器不可信或遭受黑客攻击时返回不合理聚类结果的问题,提出了一种可应用于多方隐私保护场景的云外包可验证隐私保护k-means聚类方案.首先,提出了一种适用于云外包场景的改进的聚类初始化方法,从而有效提高算法的迭代效率;然后,利用乘法三元组技术来设计安全欧几里得距离的计算,并利用混淆电路技术来设计安全计算最小值算法;最后,提出了一种验证算法,使用户仅需一轮通信就实现对聚类结果的验证,并且数据外包后算法的训练完全在云上进行,能够有效减少用户和云的交互.仿真实验表明,所提方案在数据集Synthetic和S1上的准确度分别达到97%和93%,说明隐私保护下的k-means聚类和明文k-means聚类的情况近似,适用于医疗、社会科学和商业等领域.
-
-
钱家欢
-
-
摘要:
财务会计信息的可靠性对于企业经济发展具有深远影响,故而应予以重视。在此之上,本文简要分析了财务会计信息可靠性改进目标,并通过健全财会监督制度、优化财务报告内容、注重管理者素养、实现规范化管理等策略,以此提高财务信息管理水平,增强财务会计信息可靠性,促进企业的长远发展。
-
-
张剑;
林昌露;
丁健;
林修慧;
李朝珍
-
-
摘要:
在多秘密共享方案中,通常会生成大量公开值来保障多个秘密安全正确地重构,同时参与者也需要保存大量信息.为减少公开值的个数以及参与者所需保存的信息量,本文基于中国剩余定理和Shamir(t,n)-门限秘密共享方案设计了一个子秘密可多使用的门限存取结构多秘密共享方案.根据中国剩余定理将多项式产生的子秘密信息进行聚合生成公开值,减少了公开值的个数;应用转换值的方法和离散对数对参与者子秘密信息进行保护.构造了具有以下特点的多秘密共享方案:可一次共享多个秘密;不同的秘密可对应不同门限的存取结构;参与者可验证所恢复秘密值的正确性;公开值个数更少;参与者存储一个子秘密且子秘密可以多次使用.
-
-
郭丽峰;
王倩丽
-
-
摘要:
为实现云存储中的细粒度的访问控制,属性基加密(ABE)被提出,并逐渐成为云环境中最具发展前景的加密算法.但由于ABE采用了双线性对运算,计算效率较低,阻碍ABE在实际中的广泛应用.文章提出了一种可验证的支持完全外包的属性基加密方案,该方案将属性授权机构以及数据解密方的计算量外包到云服务器上,降低属性授权机构和数据解密方的计算负担.数据拥有者通过与服务器的交互完成加密计算,从而降低数据拥有者的计算负担.该方案还可以验证外包加密和外包解密计算的正确性.该方案在q-BDHE假设下证明是选择安全的.根据理论和实验分析可得,该方案的效率和功能性较高,更适于实际的应用.
-
-
杜永红
-
-
摘要:
2018年IASB发布的《财务报告概念框架》中,将会计目标由二元改为一元,因此会计信息质量特征也随之变化,这说明了IASB对于决策有用性的偏爱和对相关性以及公允价值计量的推崇.但我国仍然坚持双元财务目标,同时公允价值计量仍在发展过程中,信息披露现状较差,因此我国应当坚持不对称谨慎性.但是对于如实反映和可靠性,我们应当综合考虑,如实反映的表述更好,更多地反映了会计信息加工过程的要求、人的主观努力,更接近会计准则的目标导向,并且与公允价值计量联系紧密,但是可靠性中实质重于形式和可验证性依旧应当作为如实反映的衡量标准纳入信息质量特征,使得如实反映保持可靠性的内核,在外部监管不成熟,法律和资本环境不健全的情况下防范和过滤虚假会计信息.
-
-
杨雄胜
-
-
摘要:
《财会月刊》2021年6期,20000字会计对社会经济文明进步承担着基础性的保障与促进作用。这种基础性的保障与促进作用,集中表现为会计的两大功能:为所有经济活动提供合适与否的标准框架与行为规范,即会计制度、准则;对所有经济活动满足社会经济文明进步要求的状况与程度,提供具有社会共识性并具有可验证性的证明报告,即会计工作。
-
-
杜耀刚;
杨自力;
张艳硕;
王泽豪
-
-
摘要:
提出一种以线性码原理和混沌映射理论为基础的无载体信息隐藏方案.通过提取图像的像素矩阵,利用线性码原理和混沌映射理论先后对矩阵信息作可验证处理和加密处理,最后通过一系列变换建立图像与密文信息的对应关系,从而实现无载体信息隐藏.实验和分析表明,该方案保证了信息的安全性,增强了随机性,同时具有可验证性,这使得提出的信息隐藏方案是可信任的.另外相比于其他方案,该方案的隐藏容量有了很大的提升,并且大大减少了信息库的存储资源消耗.
-
-
钱家欢
-
-
摘要:
财务会计信息的可靠性对于企业经济发展具有深远影响,故而应予以重视.在此之上,本文简要分析了财务会计信息可靠性改进目标,并通过健全财会监督制度、优化财务报告内容、注重管理者素养、实现规范化管理等策略,以此提高财务信息管理水平,增强财务会计信息可靠性,促进企业的长远发展.
-
-
-
-
彭银桥;
甘元驹;
彭凌西;
邓锐;
陈月峰
- 《第一届中国可信计算与信息安全学术会议》
| 2004年
-
摘要:
在修改的Ohta-Okamoto的数字签名方案基础上,设计出了一个新的(t,n)门限签名方案.该门限签名方案具有可验证性和防止内部成员合谋攻击;而且验证者在验证群签名的有效性的计算复杂性与一般个人签名方案一样.该方案的安全性是基于大整数的因式分解,因此在计算上是安全的.
-
-
ZHAO Ming;
赵铭;
WANG Jie;
王杰;
YU Xiao;
于晓
- 《2014全国高性能计算学术年会》
| 2014年
-
摘要:
As Cloud Computing becomes more and more prevalent, much more sensitive IT industry data are being centralized in cloud. Considering secure protection of privacy, it is vital not to sacrifice the confidentiality of sensitive data while providing operational functionality. Fuzzy (fault-tolerant) keyword searchable encryption has been studied by many researchers for a period of time. However, insecurity and disadvantages of designed algorithms have greatly shaped the spread of application. In this paper, we propose an improved fuzzy keyword search on encrypted data scheme named as Distributed Fault-tolerant Keyword Search Supporting Verifiable Search-ability (DFKSSVS) in hybrid cloud with the emphasis of interaction circumstances, and we also consider the applicable system and threat model to be "semi-honest-but-curious" proposed in Through improved dictionary-based keyword construction scheme, we generate fuzzy keyword set, and build secure index for efficient fuzzy search. After the searching procedure, the scheme can support verifiability of returned tiles via proof returned by cloud as well, and interaction between data user and private cloud to achieve dynamic ranking of retrieval results statistically. Through rigorous security and thorough analysis, we show that the improved solution can meet verifiable fuzzy keyword searching on cloud encrypted data and support the exact keyword matching on secure index already generated. Security analysis and extensive experimental results demonstrate the accuracy and efficiency of our proposed scheme.
-
-
ZHAO Ming;
赵铭;
WANG Jie;
王杰;
YU Xiao;
于晓
- 《2014全国高性能计算学术年会》
| 2014年
-
摘要:
As Cloud Computing becomes more and more prevalent, much more sensitive IT industry data are being centralized in cloud. Considering secure protection of privacy, it is vital not to sacrifice the confidentiality of sensitive data while providing operational functionality. Fuzzy (fault-tolerant) keyword searchable encryption has been studied by many researchers for a period of time. However, insecurity and disadvantages of designed algorithms have greatly shaped the spread of application. In this paper, we propose an improved fuzzy keyword search on encrypted data scheme named as Distributed Fault-tolerant Keyword Search Supporting Verifiable Search-ability (DFKSSVS) in hybrid cloud with the emphasis of interaction circumstances, and we also consider the applicable system and threat model to be "semi-honest-but-curious" proposed in Through improved dictionary-based keyword construction scheme, we generate fuzzy keyword set, and build secure index for efficient fuzzy search. After the searching procedure, the scheme can support verifiability of returned tiles via proof returned by cloud as well, and interaction between data user and private cloud to achieve dynamic ranking of retrieval results statistically. Through rigorous security and thorough analysis, we show that the improved solution can meet verifiable fuzzy keyword searching on cloud encrypted data and support the exact keyword matching on secure index already generated. Security analysis and extensive experimental results demonstrate the accuracy and efficiency of our proposed scheme.
-
-
ZHAO Ming;
赵铭;
WANG Jie;
王杰;
YU Xiao;
于晓
- 《2014全国高性能计算学术年会》
| 2014年
-
摘要:
As Cloud Computing becomes more and more prevalent, much more sensitive IT industry data are being centralized in cloud. Considering secure protection of privacy, it is vital not to sacrifice the confidentiality of sensitive data while providing operational functionality. Fuzzy (fault-tolerant) keyword searchable encryption has been studied by many researchers for a period of time. However, insecurity and disadvantages of designed algorithms have greatly shaped the spread of application. In this paper, we propose an improved fuzzy keyword search on encrypted data scheme named as Distributed Fault-tolerant Keyword Search Supporting Verifiable Search-ability (DFKSSVS) in hybrid cloud with the emphasis of interaction circumstances, and we also consider the applicable system and threat model to be "semi-honest-but-curious" proposed in Through improved dictionary-based keyword construction scheme, we generate fuzzy keyword set, and build secure index for efficient fuzzy search. After the searching procedure, the scheme can support verifiability of returned tiles via proof returned by cloud as well, and interaction between data user and private cloud to achieve dynamic ranking of retrieval results statistically. Through rigorous security and thorough analysis, we show that the improved solution can meet verifiable fuzzy keyword searching on cloud encrypted data and support the exact keyword matching on secure index already generated. Security analysis and extensive experimental results demonstrate the accuracy and efficiency of our proposed scheme.
-
-
ZHAO Ming;
赵铭;
WANG Jie;
王杰;
YU Xiao;
于晓
- 《2014全国高性能计算学术年会》
| 2014年
-
摘要:
As Cloud Computing becomes more and more prevalent, much more sensitive IT industry data are being centralized in cloud. Considering secure protection of privacy, it is vital not to sacrifice the confidentiality of sensitive data while providing operational functionality. Fuzzy (fault-tolerant) keyword searchable encryption has been studied by many researchers for a period of time. However, insecurity and disadvantages of designed algorithms have greatly shaped the spread of application. In this paper, we propose an improved fuzzy keyword search on encrypted data scheme named as Distributed Fault-tolerant Keyword Search Supporting Verifiable Search-ability (DFKSSVS) in hybrid cloud with the emphasis of interaction circumstances, and we also consider the applicable system and threat model to be "semi-honest-but-curious" proposed in Through improved dictionary-based keyword construction scheme, we generate fuzzy keyword set, and build secure index for efficient fuzzy search. After the searching procedure, the scheme can support verifiability of returned tiles via proof returned by cloud as well, and interaction between data user and private cloud to achieve dynamic ranking of retrieval results statistically. Through rigorous security and thorough analysis, we show that the improved solution can meet verifiable fuzzy keyword searching on cloud encrypted data and support the exact keyword matching on secure index already generated. Security analysis and extensive experimental results demonstrate the accuracy and efficiency of our proposed scheme.
-
-
-