[DRAFT] Garbled Circuits: Commutative Encryption Protocol Problem definition and a naive protocol Definition Alice has secret bits $X = x_0\ldots x_{n - 1}$ and Bob has secret bits $Y = y_0\ldots y_{m - 1}$. Alice and Bob are interested in computing an arbitrary boolean function $f(X,Y)$ so that at the end they both know the outcome, but neither of them learn anything more than the value of $f(X,Y)$. Relationship to Oblivious Transfer