首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   12篇
  国内免费   1篇
  完全免费   8篇
  自动化技术   21篇
  2016年   1篇
  2015年   2篇
  2014年   2篇
  2012年   1篇
  2011年   1篇
  2010年   1篇
  2009年   2篇
  2008年   3篇
  2007年   3篇
  2006年   2篇
  2005年   1篇
  2004年   1篇
  2002年   1篇
排序方式: 共有21条查询结果,搜索用时 93 毫秒
1.
隐私保护数据挖掘方法的研究   总被引:3,自引:0,他引:3  
陈芸  张伟 《微计算机信息》2006,22(21):239-241
介绍了隐私保护数据挖掘的国内外研究概况,提出了对数据挖掘中隐私保护技术的分类,分析和评价相关典型算法,并对隐私保护数据挖掘的未来研究方向进行了展望。  相似文献
2.
同态加密算法及其在云安全中的应用   总被引:2,自引:0,他引:2  
云服务模式具有巨大的经济技术优势和广阔的应用前景,普及云服务技术对我国的信息化建设和社会发展具有重要的意义.云服务推广与应用中面临的最大挑战是安全问题.同态加密,尤其是全同态加密是解决云服务安全问题极为关键的技术,也是近年来国际密码学界研究的热点问题.对同态加密的研究现状进行了综述,介绍了同态加密在云计算机密性保护及其他方面的应用,重点介绍了各种代数部分同态加密方案和电路全同态加密方案的优缺点.对同态加密未来的研究问题进行了分析,同时简单介绍了云安全中的明文保密计算概念、相对于密文计算的优势以及需要进一步研究的问题等.  相似文献
3.
分布的缺失数据中保护隐私的贝叶斯网络学习   总被引:1,自引:0,他引:1       下载免费PDF全文
对隐私的保护性关注限制了参与各方对数据资源的共享使用,为此提出了从分布的缺失数据中保护隐私的贝叶斯网络学习方 法——PPHI-EM方法。该方法基于Pohlig-Hellman加密算法,使用安全有向边统计算法得到结构有向边的交集和并集。以交集作为初始网络结构,依次将并集中的其他边放入网络中,通过打分函数值的大小,判断该边是否应予保留。根据设定的适当权重,使用安全矩阵求和算法求解当前网络结构参数。循环计算直至确定网络的最优参数。该方法使用了期望统计来代替实际不存在的充分统计,使数据各方的打分函数便于分解,并基于AMS-EM方法分布迭代改进结构,使之收敛。实验结果验证了该方法的有效性。  相似文献
4.
Symmetric cryptographic protocols for extended millionaires’ problem   总被引:1,自引:0,他引:1  
Yao’s millionaires’ problem is a fundamental problem in secure multiparty computation, and its solutions have become building blocks of many secure multiparty computation solutions. Unfortunately, most protocols for millionaires’ problem are constructed based on public cryptography, and thus are inefficient. Furthermore, all protocols are designed to solve the basic millionaires’ problem, that is, to privately determine which of two natural numbers is greater. If the numbers are real, existing solutions do ...  相似文献
5.
We describe two algorithms, BiBoost (Bipartite Boosting) and MultBoost (Multiparty Boosting), that allow two or more participants to construct a boosting classifier without explicitly sharing their data sets. We analyze both the computational and the security aspects of the algorithms. The algorithms inherit the excellent generalization performance of AdaBoost. Experiments indicate that the algorithms are better than AdaBoost executed separately by the participants, and that, independently of the number of participants, they perform close to AdaBoost executed using the entire data set. Responsible Editor: Charu Aggarwal.  相似文献
6.
Internet computing technologies, like grid computing, enable a weak computational device connected to such a grid to be less limited by its inadequate local computational, storage, and bandwidth resources. However, such a weak computational device (PDA, smartcard, sensor, etc.) often cannot avail itself of the abundant resources available on the network because its data are sensitive. This motivates the design of techniques for computational outsourcing in a privacy-preserving manner, i.e., without revealing to the remote agents whose computational power is being used either one’s data or the outcome of the computation. This paper investigates such secure outsourcing for widely applicable sequence comparison problems and gives an efficient protocol for a customer to securely outsource sequence comparisons to two remote agents. The local computations done by the customer are linear in the size of the sequences, and the computational cost and amount of communication done by the external agents are close to the time complexity of the best known algorithm for solving the problem on a single machine.  相似文献
7.
Many distributed protocols require the participants to have secret shares of an RSA modulus in order to perform distributed cryptographic computations. Until recently, a trusted party was required to generate and distribute these secret shares before the start of the protocol. Recently, Boneh and Franklin introduced a protocol whereby participants could themselves generate the secret shares without revealing any information about their shares to each other. We experimentally evaluate the performance of their protocol and we recommend good choices for certain parameters of the protocol. Received November 10, 1998; revised November 22, 2000.  相似文献
8.
A new private set-operation problem is proposed.Suppose there are n parties with each owning a secret set.Let one of them,say P,be the leader,S be P's secret set,and t(less than n—1)be a threshold value.For each element w of S,if w appears more than t times in the rest parties' sets,then P learns which parties' sets include w, otherwise P cannot know whether w appears in any party's set.For this problem,a secure protocol is proposed in the senti-honest model based on semantically secure homomorphic encryption scheme,secure sharing scheme,and the polynomial representation of sets.The protocol only needs constant rounds of communication.  相似文献
9.
This paper is about distributed oblivious function evaluation (DOFE). In this setting one party (Alice) has a function f(x), and the other party (Bob) with an input α wants to learn f(α) in an oblivious way with the help of a set of servers. What Alice should do is to share her secret function f(x) among the servers.Bob obtains what he should get by interacting with the servers. This paper proposes the model and security requirements for DOFE and analyzes three distributed oblivious polynomial evaluation protocols presented in the paper.  相似文献
10.
数字作品的所有权证明允许在不泄漏任何秘密信息和防止所有者欺骗的前提下,对版权声明进行验证.提出一种基于Proactive可验证秘密共享和安全多方计算的数字作品所有权证明方案.在该方案中,可验证秘密共享,保证了所有权秘密的正确性,并防止对协议参与者的欺骗.通过Proactive安全提供自动恢复功能来保证协议生存周期内秘密的完整性和安全性.使用安全多方计算和同态承诺的零知识证明,实现了所有权验证.在不假设可信方存在的前提下,所提出方案能够在没有太多成员合谋的情况下,完成有效计算并发现不忠实成员.  相似文献
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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