Paper 2026/2208 Original: eprint.iacr.org/2026/2208 ↗
A Note on CDS for Random Functions
Abstract
We record the following bound: almost all Boolean functions $f : \{0,1\}^n \times \{0,1\}^n \to \{0,1\}$ require $2n - 2\log n - O(1)$ bits of communication for perfect two-party conditional disclosure of secrets with a one-bit secret. This only gives a factor 2 improvement over the previous best bound due to Applebaum, Holenstein, Mishra and Shayevitz [EUROCRYPT 2018], but at least (nearly) matches the input length. The proof is a straightforward compression argument that uses the birthday bound to give a succinct representation of transcript collisions (the latter being a technique from Feige, Kilian and Naor [STOC 1994], refined in Applebaum et al.). Viewing transcript-collision testing as an elementary case of distribution testing extends the argument to imperfect correctness and privacy. We do not currently know how to extend the argument to an explicit hard predicate.
Metadata
- Available format(s)
PDF- Category
- Foundations
- Publication info
- Preprint.
- History
- 2026-09-24: last updated
- 2026-09-24: published
- Short URL
- https://ia.cr/2026/2208
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2026/2208,
author = {Marshall Ball},
title = {A Note on CDS for Random Functions},
howpublished = {Cryptology {ePrint} Archive, Paper 2026/2208},
year = {2026},
url = {https://eprint.iacr.org/2026/2208}
}