密码算法与协议7_安全多方计算协议.ppt

* * Addition gate c1 = a1+b1 c2 = a2+b2 c1+c2 = a1+a2+b1+b2 * * NOT gate NOT(a) = NOT(a1+a2) NOT(a) = NOT(a1)+a2 * * Multiplication gate c1+c2 = (a1+a2)(b1+b2) (c1,c2) should be uniformly chosen amongst all solutions We use Oblivious Transfer * * Oblivious transfer in the case of semi-honest parties Sender has t1, t2, …, tk (bits) Receiver chooses some 1 ≤ i ≤ k Goal: Receiver gets ti, Sender does not know i Learns nothing tj Alice j Bob t0, t1 1-out-of 2 Oblivious Transfer (OT12) * * OT Using RSA for semi-honest Sender chooses RSA keys, sends public key to Receiver Receiver chooses