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

拖債

Omniscient

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

colloquial

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

blister

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

fluffy

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

水槽

背書

惡臭

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

休息

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