Skip to content

Perfect/Statistical 2-Party Computation with Improved Circuit Privacy

· 0 citations · 45 references

TL;DR

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.

View source

Similar papers

Preprint Oct 2026

Fully Homomorphic Encryption for Statistical Modeling

Fully homomorphic encryption allows arithmetic to be carried out on encrypted values, so that a party performing a computation need not see the data it operates on. This is useful wherever collaborating parties or sites cannot share data records or computed summaries yet need to do a joint analysis. We demonstrate the...

B. Narasimhan · 0 citations
Preprint Sep 2026

Keyless secrecy against bounded adversaries

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.

Anne Broadbent, Upendra S. Kapshikar, Denis Rochette · 0 citations
Preprint Oct 2026

Combining Error Verification and Privacy Amplification in Quantum Key Distribution

Quantum Key Distribution (QKD) protocols typically involve two separate steps of error-verification and privacy amplification. Both steps involve the application of a hash function sampled from a suitable hash family to classical data. A potentially simpler alternative is to implement a single-step hashing procedure, a...

Devashish Tupkary, Zhi-Yao Wang, Ernest Y.-Z. Tan · 0 citations

via Sparse Pseudorandom Generators

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.

Amit Agarwal, Elette Boyle, N. Gilboa et al. · 0 citations
Preprint Sep 2026

Semi-Quantum Cryptography with Certified Deletion

A classical-communication protocol and simulation technique that allows adapting purification-based security arguments for BB84-style states which are prepared through classical interaction to be made available in a hybrid experiment despite the classical transcript uniquely determining the prepared state in a real exe...

Y. Kalai, Justin Raizes · 0 citations

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