CSP/algorithm

        //tuple to send represetn m0, m1
        //N, d, e securely
        //x0, x1 randomly secure mod N
        //buffer e, N, x0, x1
        //k randomly secure mod N
        //b = Y[i]
        //v = ((b == 0)? x0: x1) + pow(k,e) %N
        //THESE ARE BUFFERED VERSIONS^
       //buffer v
        //k0 = (v - pow(x0,d))%N
        //k1 = (v - pow(x1,d))%N
        //n0 = k0 + m0
       //n1 = k1 + m1
        //buffer[n0,n1]
        //output ((b == 0)? n0 : n1) - k
        //^buffered