TE
科技回声
首页24小时热榜最新最佳问答展示工作
GitHubTwitter
首页

科技回声

基于 Next.js 构建的科技新闻平台,提供全球科技新闻和讨论内容。

GitHubTwitter

首页

首页最新最佳问答展示工作

资源链接

HackerNews API原版 HackerNewsNext.js

© 2025 科技回声. 版权所有。

Secure Multi-Party Computations With Python

17 点作者 turnersr大约 13 年前

1 comment

AnIrishDuck大约 13 年前
This has been a subject that caught my interest recently. For those that don't know a lot about SMPC, this library can be used to implement distributed cryptographic applications [1].<p>In other words, a group of peers that don't trust each other with a key can perform RSA in a distributed matter that is Byzantine Fault Tolerant (BFT). Specifically, all parties can generate a distributed key pair and then decrypt a message without specific knowledge of the private key. A fixed number of attackers (usually less than one third of the total number of participating clients) can behave in an arbitrary manner during the process without affecting the ability of the trustworthy peers to correctly decrypt the message.<p>There are of course performance issues and caveats involved, but fascinating stuff.<p>1. <a href="http://viff.dk/doc/applications.html#distributed-rsa" rel="nofollow">http://viff.dk/doc/applications.html#distributed-rsa</a>