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]

@article{KushilevitzOPRT21,
  title = {Lower and Upper Bounds on the Randomness Complexity of Private Computations of AND},
  author = {Eyal Kushilevitz and Rafail Ostrovsky and Emmanuel Prouff and Adi Rosén and Adrian Thillard and Damien Vergnaud},
  year = {2021},
  doi = {10.1137/20M1314197},
  url = {https://doi.org/10.1137/20M1314197},
  researchr = {https://researchr.org/publication/KushilevitzOPRT21},
  cites = {0},
  citedby = {0},
  journal = {SIAM J. Discrete Math.},
  volume = {35},
  number = {1},
  pages = {465-484},
}