找回密碼
 To register

QQ登錄

只需一步，快速開始

掃一掃，訪問微社區(qū)

打印 上一主題 下一主題

Titlebook: Compilation for Secure Multi-party Computation; Niklas Büscher,Stefan Katzenbeisser Book 2017 The Author(s) 2017 Compiler construction.Sec

[復(fù)制鏈接]
查看: 53400|回復(fù): 42
樓主
發(fā)表于 2025-3-21 16:58:01 | 只看該作者 |倒序?yàn)g覽 |閱讀模式
書目名稱Compilation for Secure Multi-party Computation
編輯Niklas Büscher,Stefan Katzenbeisser
視頻videohttp://file.papertrans.cn/232/231237/231237.mp4
叢書名稱SpringerBriefs in Computer Science
圖書封面Titlebook: Compilation for Secure Multi-party Computation; Niklas Büscher,Stefan Katzenbeisser Book 2017 The Author(s) 2017 Compiler construction.Sec
描述.This book presents a holistic view on compiler assisted practical secure multi-party computation (MPC) over Boolean circuits. It discusses that two or more parties jointly evaluate a function over their inputs in such a way that each party keeps its input unknown to the other parties in MPC. MPC provides a generic way to construct Privacy-Enhancing Technologies, which protect sensitive data during processing steps in untrusted environments. A major obstacle in the past was to generate MPC applications by hand. Recently, special compilers have been developed to build all kinds of applications...This book also explains in detail how efficient MPC applications can be created automatically from ANSI-C, thus, bridging the areas of cryptography, compilation and hardware synthesis. It ?also gives an insight into the requirements for creating efficient applications for MPC and is hence of interest to not only researchers in the area of MPC but also developers realizing practical applications with MPC. For a better understanding of the complete compile chain from ANSI-C to circuits, which is the ‘machine code’ of MPC, the authors first give the necessary background information on MPC proto
出版日期Book 2017
關(guān)鍵詞Compiler construction; Secure computation; Secure Multi-party Computation; Parallelization; Cryptography
版次1
doihttps://doi.org/10.1007/978-3-319-67522-0
isbn_softcover978-3-319-67521-3
isbn_ebook978-3-319-67522-0Series ISSN 2191-5768 Series E-ISSN 2191-5776
issn_series 2191-5768
copyrightThe Author(s) 2017
The information of publication is updating

書目名稱Compilation for Secure Multi-party Computation影響因子(影響力)




書目名稱Compilation for Secure Multi-party Computation影響因子(影響力)學(xué)科排名




書目名稱Compilation for Secure Multi-party Computation網(wǎng)絡(luò)公開度




書目名稱Compilation for Secure Multi-party Computation網(wǎng)絡(luò)公開度學(xué)科排名




書目名稱Compilation for Secure Multi-party Computation被引頻次




書目名稱Compilation for Secure Multi-party Computation被引頻次學(xué)科排名




書目名稱Compilation for Secure Multi-party Computation年度引用




書目名稱Compilation for Secure Multi-party Computation年度引用學(xué)科排名




書目名稱Compilation for Secure Multi-party Computation讀者反饋




書目名稱Compilation for Secure Multi-party Computation讀者反饋學(xué)科排名




單選投票, 共有 1 人參與投票
 

0票 0.00%

Perfect with Aesthetics
 

0票 0.00%

Better Implies Difficulty
 

0票 0.00%

Good and Satisfactory
 

1票 100.00%

Adverse Performance
 

0票 0.00%

Disdainful Garbage
您所在的用戶組沒有投票權(quán)限
沙發(fā)
發(fā)表于 2025-3-21 23:17:10 | 只看該作者
板凳
發(fā)表于 2025-3-22 01:47:49 | 只看該作者
Erinnern und Entwerfen im Spielc protocols. This is because the manual construction of efficient applications, which need to be represented as Boolean or arithmetic circuits, is a complex, error-prone, and time-consuming task. For the practical use of MPC, and thus, the development of further privacy-enhancing technologies, compi
地板
發(fā)表于 2025-3-22 05:21:08 | 只看該作者
5#
發(fā)表于 2025-3-22 09:13:13 | 只看該作者
Spiel, Satz und Sieg für die Mathematikr. To improve the efficiency of secure computation protocol, we describe a practical and compiler assisted parallelization scheme (This chapter is based on our paper “Faster Secure Computation through Automatic Parallelization”?Büscher and Katzenbeisser (24th USENIX Security Symposium, USENIX Securi
6#
發(fā)表于 2025-3-22 13:39:43 | 只看該作者
https://doi.org/10.1007/978-3-662-60602-5ld network settings, with network latencies in the range of tens or hundreds of milliseconds, the round complexity quickly becomes a significant performance bottleneck. In this chapter, we describe compiler extension to CBMC-GC (This chapter is based on our paper “Compiling Low Depth Circuits for Pr
7#
發(fā)表于 2025-3-22 17:02:50 | 只看該作者
https://doi.org/10.1007/978-3-662-60602-5esearch for MPC focussed either on the development of scalable compilers or on the optimization of smaller circuits. In this section, we give a design of a scalable optimizing MPC compiler (This chapter is based on our paper “Scalable Secure Computation from ANSI-C”?(Büscher et al. IEEE Internationa
8#
發(fā)表于 2025-3-23 01:16:33 | 只看該作者
SpringerBriefs in Computer Sciencehttp://image.papertrans.cn/c/image/231237.jpg
9#
發(fā)表于 2025-3-23 01:30:56 | 只看該作者
Background, describe Boolean circuits, two secure computation protocols, namely Yao’s garbled circuits and GMW, which are prototypic for constant-round and multi-round MPC protocols over Boolean circuits. Furthermore, we discuss multiple applications that are used for benchmarking purposes.
10#
發(fā)表于 2025-3-23 06:10:58 | 只看該作者
https://doi.org/10.1007/978-3-319-67522-0Compiler construction; Secure computation; Secure Multi-party Computation; Parallelization; Cryptography
 關(guān)于派博傳思  派博傳思旗下網(wǎng)站  友情鏈接
派博傳思介紹 公司地理位置 論文服務(wù)流程 影響因子官網(wǎng) 吾愛論文網(wǎng) 大講堂 北京大學(xué) Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點(diǎn)評(píng) 投稿經(jīng)驗(yàn)總結(jié) SCIENCEGARD IMPACTFACTOR 派博系數(shù) 清華大學(xué) Yale Uni. Stanford Uni.
QQ|Archiver|手機(jī)版|小黑屋| 派博傳思國(guó)際 ( 京公網(wǎng)安備110108008328) GMT+8, 2025-10-5 21:30
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復(fù) 返回頂部 返回列表
仙居县| 田阳县| 酒泉市| 大悟县| 泽普县| 揭西县| 曲周县| 张家口市| 湛江市| 五家渠市| 来凤县| 宁蒗| 南澳县| 邵阳县| 台州市| 海安县| 平潭县| 宜都市| 铁力市| 武川县| 陈巴尔虎旗| 长寿区| 马龙县| 海南省| 内乡县| 兴隆县| 建水县| 东明县| 乌恰县| 定远县| 西昌市| 淅川县| 沾益县| 新营市| 增城市| 桐柏县| 通山县| 黄冈市| 大足县| 新宁县| 永嘉县|