.png){kind=icon}
返回
Fairness in secure computing protocols based on incentives
.png){kind=icon}
PRE
AI
DOI：10.1007/s00500-015-1974-0.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Cloud computing is based on utility and consumption of computer resources. To solve the security issues in cloud computing, secure computing protocols are often used. Recently, rational parties as a new kind of parties are proposed, who wish to maximize their utilities in secure computing protocols. The utility definitions in most previous rational secure computing protocols derive from prisoner's dilemma game (PD game). In two-party rational computing protocols, parties decide to send their shares according to their utilities. Recently, we revisit the incentives for rational parties in secure computing protocols and give new utility definitions according to them. We find that the new utility definition is not similar to PD game any more. We discuss two-party and multi-party cases, respectively, and prove that parties have incentives to send their share to others. Furthermore, we also prove that parties can maximize their utilities in both cases.
Keyword:
Fairness
Rational computing
Modularization
Nash equilibrium
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
2.5
论文数:
1.0W
被引数:
2.1W
机构
引用论文
Enabling efficient approximate nearest neighbor search for outsourced database in cloud computing实现云计算中外包数据库的高效近似最近邻搜索.png)
SOFT COMPUTING
SOFT COMPUTINGIF2.5
PREAI
分享收藏Profiling cellular diversity in sponges informs animal cell type and nervous system evolution
OAAI
IF0
OAAI分享收藏Measurement method of microwave surface resistance of high Tc superconductive thin films高温超导薄膜微波表面电阻的测量方法
PREAI
分享收藏分享收藏
查看更多内容