On the Randomness Complexity of Interactive Proofs and Statistical Zero-Knowledge Proofs - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Benny Applebaum, Eyal Golombek. On the Randomness Complexity of Interactive Proofs and Statistical Zero-Knowledge Proofs. In Stefano Tessaro, editor, 2nd Conference on Information-Theoretic Cryptography, ITC 2021, July 23-26, 2021, Virtual Conference. Volume 199 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021. [doi]

This author has not been identified. Look up 'Benny Applebaum' in GoogleThis author has not been identified. Look up 'Eyal Golombek' in Google

runs on WebDSL