首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   5篇
  国内免费   1篇
  完全免费   2篇
  自动化技术   8篇
  2012年   2篇
  2010年   2篇
  2008年   2篇
  2006年   1篇
  2004年   1篇
排序方式: 共有8条查询结果,搜索用时 109 毫秒
1
1.
和以前实现的数字签名一样,一般的Fiat-Shamir数字签名方案虽然不需要可信任的第三方介入,但它的信息是逐位公开的,因而就不能保证它可抗并行攻击.本文利用限时提交协议实现了一个抗并行攻击的Fiat-Shamir签名方案,并对它的安全性和效率进行了分析.  相似文献
2.
数字作品的所有权证明允许在不泄漏任何秘密信息和防止所有者欺骗的前提下,对版权声明进行验证.提出一种基于Proactive可验证秘密共享和安全多方计算的数字作品所有权证明方案.在该方案中,可验证秘密共享,保证了所有权秘密的正确性,并防止对协议参与者的欺骗.通过Proactive安全提供自动恢复功能来保证协议生存周期内秘密的完整性和安全性.使用安全多方计算和同态承诺的零知识证明,实现了所有权验证.在不假设可信方存在的前提下,所提出方案能够在没有太多成员合谋的情况下,完成有效计算并发现不忠实成员.  相似文献
3.
With the emergence and popularity of identity verification means by biometrics, the biometric system which can assure security and privacy has received more and more concentration from both the research and industry communities. In the field of secure biometric authentication, one branch is to combine the biometrics and cryptography. Among all the solutions in this branch, fuzzy commitment scheme is a pioneer and effective security primitive. In this paper, we propose a novel binary length-fixed feature generation method of fingerprint. The alignment procedure, which is thought as a difficult task in the encrypted domain, is avoided in the proposed method due to the employment of minutiae triplets. Using the generated binary feature as input and based on fuzzy commitment scheme, we construct the biometric cryptosystems by combining various of error correction codes, including BCH code, a concatenated code of BCH code and Reed-Solomon code, and LDPC code. Experiments conducted on three fingerprint databases, including one in-house and two public domain, demonstrate that the proposed binary feature generation method is effective and promising, and the biometric cryptosystem constructed by the feature outperforms most of the existing biometric cryptosystems in terms of ZeroFAR and security strength. For instance, in the whole FVC2002 DB2, a 4.58% ZeroFAR is achieved by the proposed biometric cryptosystem with the security strength 48 bits.  相似文献
4.
Boneh和Naor在2000年美密会上提出了时控承诺机制,它能抵抗并行暴力攻击,且保留了强制打开承诺值的可能性。之后,时控承诺机制在密码学许多领域得到了大量应用,例如公平交换协议、公平多方安全计算及公平多方抛币协议。然而,在Boneh-Naor方案中,每次承诺均需要大量的模幂运算和网络带宽,效率很低。本文基于Pedersen承诺机制、GBBS假设和主时间线元素组技术,构造了一种高效的同态时控承诺方案。新方案中主时间线元素组仅在初始化阶段进行一次运算与证明,极大地节省了每次承诺的计算时间和网络带宽。其次,相比于其它方案,新方案具有另一重要特性:同态性。  相似文献
5.
Constructions of cryptographic primitives based on general assumptions (e.g., one-way functions) tend to be less efficient than constructions based on specific (e.g., number-theoretic) assumptions. This has prompted a recent line of research aimed at investigating the best possible efficiency of (black-box) cryptographic constructions based on general assumptions. Here, we present bounds on the efficiency of statistically-binding commitment schemes constructed using black-box access to one-way permutations; our bounds are tight for the case of perfectly-binding schemes. Our bounds hold in an extension of the Impagliazzo-Rudich model: we show that any construction beating our bounds would imply the unconditional existence of a one-way function (from which a statistically-binding commitment scheme could be constructed “from scratch”).  相似文献
6.
Since the concept of zero-knowledge protocols was introduced, it has attracted a lot of attention and in turn showed significant effect on the development of cryptography, complexity theory and other areas. The round complexity of a zero-knowledge protocol is a very important efficiency consideration, and it is required to be as small as possible. Generally, it is desirable to have zero-knowledge protocols with constant numbers of rounds. Goldreich and Oren proved that only languages in BPP have one-round a...  相似文献
7.
指出原有多重签密方案存在的缺陷,并提出一种新的基于RSA的多重签密方案。本方案以RSA密码体制为基础,借鉴了原有多重签密方案的结构特点。改善了原有多重签密方案的缺陷,在安全性上实现了消息保密性、不可伪造性、不可否认等特性,同时考虑了原始消息的安全发送问题。在同等安全下,本方案比传统的先签名再加密方式,在执行效率和执行灵活性方面具有更多优势。基于RSA密码体制的广泛应用,方案简洁且易于建立,适合在电子政务和电子商务环境下为消息的安全传递提供认证加密保护。  相似文献
8.
承诺方案不仅是许多密码协议中的核心部分,同时也被直接使用于远程电子投票、电子选举、电子拍卖等场合。提出一个基于椭圆曲线离散对数困难问题的承诺方案,该方案不需要在参与方之间进行信息交互,并通过执行一轮承诺阶段和公开承诺阶段就可以实现发送方对某一消息的承诺。对该方案进行详尽地分析,指出基于椭圆曲线离散对数困难问题该方案具有消息隐藏性和消息绑定性,且在执行效率和通信带宽上具有优势。  相似文献
1
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号