Lower and Upper Bounds on the Randomness Complexity of Private Computations of AND

Eyal Kushilevitz, Rafail Ostrovsky, Emmanuel Prouff, Adi Rosén, Adrian Thillard, Damien Vergnaud. Lower and Upper Bounds on the Randomness Complexity of Private Computations of AND. SIAM J. Discrete Math., 35(1):465-484, 2021. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.