A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Statistical Randomized Encodings: A Complexity Theoretic View
[chapter]
2015
Lecture Notes in Computer Science
A randomized encoding of a function f (x) is a randomized functionf (x, r), such that the "encoding"f (x, r) reveals f (x) and essentially no additional information about x. Randomized encodings of functions have found many applications in different areas of cryptography, including secure multiparty computation, efficient parallel cryptography, and verifiable computation. We initiate a complexity-theoretic study of the class SRE of languages (or boolean functions) that admit an efficient
doi:10.1007/978-3-662-47672-7_1
fatcat:orihdksr3fa25mx2okutbgjqoe