{"@context":"https:\/\/schema.org\/","@type":"ScholarlyArticle","@id":"#article17540","name":"Is Untrusted Randomness Helpful?","abstract":"Randomized algorithms and protocols assume the availability of a perfect source of randomness. In real life, however, perfect randomness is rare and is almost never guaranteed. The gap between these two facts motivated much of the work on randomness and derandomization in theoretical computer science.\r\nIn this work, we define a new type of randomized algorithms (and protocols), that we call robustly-randomized algorithms (protocols). Such algorithms have access to two separate (read-once) random strings. The first string is trusted to be perfectly random, but its length is bounded by some parameter k = k(n) (where n is the length of the input). We think of k as relatively small, say sub-linear or poly-logarithmic in n. The second string is of unbounded length and is assumed to be random, but its randomness is not trusted.\r\nThe output of the algorithm is either an output in the set of possible outputs of the problem, or a special symbol, interpreted as do not know and denoted by \u22a5. On every input for the algorithm, the output of the algorithm must satisfy the following two requirements: \r\n1) If the second random string is perfectly random then the algorithm must output the correct answer with high probability. \r\n2) If the second random string is an arbitrary string, even adversarially chosen after seeing the input, the algorithm must output with high probability either the correct answer or the special symbol \u22a5. \r\nWe discuss relations of this new definition to several previously studied notions in randomness and derandomization. For example, when considering polynomial-time algorithms, if k is logarithmic we get the complexity class ZPP, while if k is unbounded we get the complexity class BPP, and for a general k, the algorithm can be viewed as an interactive proof with a probabilistic polynomial-time prover and a probabilistic polynomial-time verifier, where the prover is allowed an unlimited number of random bits and the verifier is limited to at most k random bits.\r\nEvery previously-studied class of randomized algorithms or protocols, and more generally, every previous use of randomness in theoretical computer science, can be revisited and redefined in light of our new definition, by replacing each random string with a pair of random strings, the first is trusted to be perfectly random but is relatively short and the second is of unlimited length but its randomness is not trusted. The main question that we ask is: In which settings and for which problems is the untrusted random string helpful?\r\nOur main technical observation is that every problem in the class BPL (of problems solvable by bounded-error randomized logspace algorithms) can be solved by a robustly-randomized logspace algorithm with k = O(log n), that is with just a logarithmic number of trusted random bits. We also give query complexity separations that show cases where the untrusted random string is provenly helpful. Specifically, we show that there are promise problems that can be solved by robustly-randomized protocols with only one query and just a logarithmic number of trusted random bits, whereas any randomized protocol requires either a linear number of random bits or an exponential number of queries, and any zero-error randomized protocol requires a polynomial number of queries.","keywords":["Untrusted","Randomness","Verifiable","ZPL","BPL","ZPP","BPP"],"author":[{"@type":"Person","name":"Girish, Uma","givenName":"Uma","familyName":"Girish","email":"mailto:ugirish@cs.princeton.edu","affiliation":"Princeton University, NJ, USA","funding":"IBM Phd Fellowship."},{"@type":"Person","name":"Raz, Ran","givenName":"Ran","familyName":"Raz","email":"mailto:ran.raz.mail@gmail.com","affiliation":"Princeton University, NJ, USA"},{"@type":"Person","name":"Zhan, Wei","givenName":"Wei","familyName":"Zhan","email":"mailto:weizhan@cs.princeton.edu","affiliation":"Princeton University, NJ, USA"}],"position":56,"pageStart":"56:1","pageEnd":"56:18","dateCreated":"2023-02-01","datePublished":"2023-02-01","isAccessibleForFree":true,"license":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode","copyrightHolder":[{"@type":"Person","name":"Girish, Uma","givenName":"Uma","familyName":"Girish","email":"mailto:ugirish@cs.princeton.edu","affiliation":"Princeton University, NJ, USA","funding":"IBM Phd Fellowship."},{"@type":"Person","name":"Raz, Ran","givenName":"Ran","familyName":"Raz","email":"mailto:ran.raz.mail@gmail.com","affiliation":"Princeton University, NJ, USA"},{"@type":"Person","name":"Zhan, Wei","givenName":"Wei","familyName":"Zhan","email":"mailto:weizhan@cs.princeton.edu","affiliation":"Princeton University, NJ, USA"}],"copyrightYear":"2023","accessMode":"textual","accessModeSufficient":"textual","creativeWorkStatus":"Published","inLanguage":"en-US","sameAs":"https:\/\/doi.org\/10.4230\/LIPIcs.ITCS.2023.56","funding":"Simons Investigator Award, National Science Foundation grants No. CCF-1714779 and CCF-2007462.","publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","citation":["https:\/\/pirsa.org\/18070057","http:\/\/arxiv.org\/abs\/2111.14846"],"isPartOf":{"@type":"PublicationVolume","@id":"#volume6454","volumeNumber":251,"name":"14th Innovations in Theoretical Computer Science Conference (ITCS 2023)","dateCreated":"2023-02-01","datePublished":"2023-02-01","editor":{"@type":"Person","name":"Tauman Kalai, Yael","givenName":"Yael","familyName":"Tauman Kalai","email":"mailto:yaelism@gmail.com","affiliation":"Microsoft Research New England, Cambridge, USA"},"isAccessibleForFree":true,"publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","hasPart":"#article17540","isPartOf":{"@type":"Periodical","@id":"#series116","name":"Leibniz International Proceedings in Informatics","issn":"1868-8969","isAccessibleForFree":true,"publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","hasPart":"#volume6454"}}}