Skip to content

via Sparse Pseudorandom Generators

· 0 citations · 78 references

TL;DR

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.

View source

Similar papers

Open access Oct 2026

Batched Oblivious Transfer with Square-Root Communication

Oblivious Transfer (OT) is a fundamental cryptographic primitive and a core building block for many multiparty cryptographic protocols. While existing OT extension techniques achieve excellent asymptotic efficiency for very large batches, their performance degrades when the total number of OTs is only moderate, since t...

Yi-Cheng Li, Claudio Orlandi, Lawrence Roy et al. · 0 citations
Preprint Oct 2026

On the Complexity of Symmetric Boolean Functions in Multiparty Private Simultaneous Messages

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...

Marshall Ball, Peter Crawford-Kahrl, V. Podolskii et al. · 0 citations
Preprint Oct 2026

Big Secrets Small Shares: Revisiting Secure Multi-Party Computation

A new modification of the ramp secret sharing scheme, called compact sharing, is introduced, and the MPC protocol is tailored to accommodate this modification, which provides perfect security against static semi-honest adversaries under an explicit tradeoff between the corruption threshold and the extension degree.

Wilton Kim, Van Long Phuoc Pham, S. Kruglik et al. · 0 citations
Open access Sep 2026

Enhanced private set union from secret-shared private membership test

This work introduces a new PSU protocol that is simple, efficient, and secure against known during-execution leakage and hashing-related leakage without relying on Cuckoo Hashing, and achieves linear complexity.

Sang-Min Lee, Jiseung Kim, Yong-Ha Son · 0 citations

Perfect/Statistical 2-Party Computation with Improved Circuit Privacy

A 2-party computation (2PC) protocol that also incorporates server inputs where the client has perfect privacy, assuming the server is semi-honest in the setup protocol and the server is malicious during the setup protocol is given.

Jonathan Trostle · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.