External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

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]

Authors

Eyal Kushilevitz

This author has not been identified. Look up 'Eyal Kushilevitz' in Google

Rafail Ostrovsky

This author has not been identified. Look up 'Rafail Ostrovsky' in Google

Emmanuel Prouff

This author has not been identified. Look up 'Emmanuel Prouff' in Google

Adi Rosén

This author has not been identified. Look up 'Adi Rosén' in Google

Adrian Thillard

This author has not been identified. Look up 'Adrian Thillard' in Google

Damien Vergnaud

This author has not been identified. Look up 'Damien Vergnaud' in Google
runs on