找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Secure Multi-Party Computation Against Passive Adversaries; Ashish Choudhury,Arpita Patra Book 2022 The Editor(s) (if applicable) and The

[复制链接]
查看: 32253|回复: 55
发表于 2025-3-21 17:45:44 | 显示全部楼层 |阅读模式
书目名称Secure Multi-Party Computation Against Passive Adversaries
编辑Ashish Choudhury,Arpita Patra
视频video
概述Includes detailed security proofs for seminal protocols and state-of-theart efficiency improvement techniques.Presents protocols against computationally bounded as well as computationally unbounded ad
丛书名称Synthesis Lectures on Distributed Computing Theory
图书封面Titlebook: Secure Multi-Party Computation Against Passive Adversaries;  Ashish Choudhury,Arpita Patra Book 2022 The Editor(s) (if applicable) and The
描述This book focuses on multi-party computation (MPC) protocols in the passive corruption model (also known as the semi-honest or honest-but-curious model). The authors present seminal possibility and feasibility results in this model and includes formal security proofs. Even though the passive corruption model may seem very weak, achieving security against such a benign form of adversary turns out to be non-trivial and demands sophisticated and highly advanced techniques. MPC is a fundamental concept, both in cryptography as well as distributed computing. On a very high level, an MPC protocol allows a set of mutually-distrusting parties with their private inputs to jointly and securely perform any computation on their inputs. Examples of such computation include, but not limited to, privacy-preserving data mining; secure e-auction; private set-intersection; and privacy-preserving machine learning. MPC protocols emulate the role of an imaginary, centralized trusted third party (TTP) that collects the inputs of the parties, performs the desired computation, and publishes the result. Due to its powerful abstraction, the MPC problem has been widely studied over the last four decades.
出版日期Book 2022
关键词Multi-party Computation; Secret-sharing; Oblivious Transfer; Garbling; Cryptographic Protocols; Simulatio
版次1
doihttps://doi.org/10.1007/978-3-031-12164-7
isbn_softcover978-3-031-12166-1
isbn_ebook978-3-031-12164-7Series ISSN 2155-1626 Series E-ISSN 2155-1634
issn_series 2155-1626
copyrightThe Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Switzerl
The information of publication is updating

书目名称Secure Multi-Party Computation Against Passive Adversaries影响因子(影响力)




书目名称Secure Multi-Party Computation Against Passive Adversaries影响因子(影响力)学科排名




书目名称Secure Multi-Party Computation Against Passive Adversaries网络公开度




书目名称Secure Multi-Party Computation Against Passive Adversaries网络公开度学科排名




书目名称Secure Multi-Party Computation Against Passive Adversaries被引频次




书目名称Secure Multi-Party Computation Against Passive Adversaries被引频次学科排名




书目名称Secure Multi-Party Computation Against Passive Adversaries年度引用




书目名称Secure Multi-Party Computation Against Passive Adversaries年度引用学科排名




书目名称Secure Multi-Party Computation Against Passive Adversaries读者反馈




书目名称Secure Multi-Party Computation Against Passive Adversaries读者反馈学科排名




单选投票, 共有 0 人参与投票
 

0票 0%

Perfect with Aesthetics

 

0票 0%

Better Implies Difficulty

 

0票 0%

Good and Satisfactory

 

0票 0%

Adverse Performance

 

0票 0%

Disdainful Garbage

您所在的用户组没有投票权限
发表于 2025-3-21 23:17:28 | 显示全部楼层
发表于 2025-3-22 03:28:59 | 显示全部楼层
The GMW MPC Protocol,All the MPC protocols discussed so far offer . against . adversaries. For the next few chapters, we shift our attention to . (also known as . or . security), where the security is provided only against . adversaries.
发表于 2025-3-22 06:46:58 | 显示全部楼层
发表于 2025-3-22 11:34:24 | 显示全部楼层
Perfectly-Secure MPC in the Pre-processing Model,correlated randomness in advance, independent of the circuit-evaluation. We discuss two classes of protocols in the pre-processing model, one based on Beaver’s random multiplication-triples and another based on random double-shared values.
发表于 2025-3-22 15:21:05 | 显示全部楼层
发表于 2025-3-22 17:25:34 | 显示全部楼层
发表于 2025-3-23 01:10:58 | 显示全部楼层
978-3-031-12166-1The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Switzerl
发表于 2025-3-23 04:09:32 | 显示全部楼层
发表于 2025-3-23 06:11:08 | 显示全部楼层
Synthesis Lectures on Distributed Computing Theoryhttp://image.papertrans.cn/s/image/863314.jpg
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-18 18:56
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表