TL;DR
The result shortens the gap between the information-theoretic setting and the computational setting, and between the optimal communication protocol and the optimal round protocol in the information-theoretic setting for t < n .
Multiparty Private Simultaneous Messages (PSM), also known as Decomposable Randomized Encoding (DRE) or information-theoretic garbling, is a model for non-interactive secure computation. Each party encodes its input using shared randomness and sends a message to an evaluator who does not know that randomness. The evalu...
This work presents a new approach for constructing a pseudorandom correlation generator (PCG) for securely generating n independent instances of UV correlations of any polynomial length B, and reduces such sparse PRGs to local PRGs over large alpha-bets.
The first efficient non-malleable code secure against global quantum tampering, with no split-state restriction, is obtained, whereas the current constructions in the literature require the codeword to be split into non-communicating shares.
We present Tulva, a practical threshold FHE scheme which equips a base FHE scheme with an asynchronous threshold decryption mechanism in a modular way. Our scheme simultaneously (1) is compatible with virtually any base FHE scheme and leaves its ciphertexts unchanged apart from an appended random tag, (2) supports a wi...
The results guarantee security against fixed-target forgery under a single-signature-exposure model under the assumption of a finite supply of quadratic-stabilizer public-key states over an odd-prime field.
Asynchronous Byzantine Reliable Broadcast (BRB) is a fundamental primitive that guarantees agreement and validity in distributed systems subject to Byzantine faults, but it lacks ordering guarantees. In this paper, we address Byzantine Causal Reliable Broadcast (BCRB), which builds on BRB to enforce causal message orde...
We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.
