找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Advances in Cryptology – CRYPTO 2024; 44th Annual Internat Leonid Reyzin,Douglas Stebila Conference proceedings 2024 International Associat

[复制链接]
楼主: HEIR
发表于 2025-3-30 09:30:29 | 显示全部楼层
发表于 2025-3-30 14:11:46 | 显示全部楼层
Secure Multiparty Computation with Identifiable Abort via Vindicating Release one cheating party if the protocol does not produce an output. Known MPC constructions with IA rely on generic zero-knowledge proofs, adaptively secure oblivious transfer (OT) protocols, or homomorphic primitives, and thus incur a substantial penalty with respect to protocols that abort without ide
发表于 2025-3-30 19:34:22 | 显示全部楼层
MPC for Tech Giants (GMPC): Enabling Gulliver and the Lilliputians to Cooperate Amicablyice provider is often interested in computing various data analyses over the private data of its users, which in turn have their incentives to cooperate, but do not necessarily trust the service provider..In this work, we introduce the . (GMPC) to realistically capture the above scenario. The GMPC m
发表于 2025-3-30 23:45:49 | 显示全部楼层
Robust Additive Randomized Encodings from IO and Pseudo-Non-linear Codesgs . of each input . and then adding them together over some Abelian group into an output encoding ., which reveals nothing but the result. In . ARE (RARE) the sum of any subset of ., reveals only the residual function obtained by restricting the corresponding inputs. The appeal of (R)ARE comes from
发表于 2025-3-31 03:32:58 | 显示全部楼层
Fully Secure MPC and zk-FLIOP over Rings: New Constructions, Improvements and Extensionsks have closed the gap between full security and semi-honest security, by introducing protocols where the parties first compute the circuit using a semi-honest protocol and then run a verification step with sublinear communication in the circuit size. However, in these works the number of interactio
发表于 2025-3-31 08:43:47 | 显示全部楼层
发表于 2025-3-31 09:46:51 | 显示全部楼层
发表于 2025-3-31 14:08:33 | 显示全部楼层
Doubly Efficient Cryptography: Commitments, Arguments and RAM MPChe entire witness? Can a set of parties run a multiparty computation (MPC) protocol in the RAM model, without necessarily even reading their entire inputs? We show how to construct such “doubly efficient” schemes in a setting where parties can preprocess their input offline, but subsequently they ca
发表于 2025-3-31 20:55:28 | 显示全部楼层
Improved Alternating-Moduli PRFs and Post-quantum Signatureste them using secure multi-party computation (MPC). The alternating moduli paradigm of Boneh et al. (TCC 2018) enables the construction of various symmetric key primitives with the common characteristic that the inputs are multiplied by two linear maps over different moduli, first over . and then ov
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-7-11 16:27
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表