A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2014; you can also visit the original URL.
The file type is application/pdf
.
Secure Multi-Party Proof and its Applications
2010
Journal of Software Engineering and Applications
We define a new type cryptographical model called secure multi-party proof that allows any t players and a verifier to securely compute a function ) ,..., ( 1 t x x f : each of the players learns nothing about other players' input and about the value of f , and the verifier obtains the value of f and it's validity but learns nothing about the input of any of the players. It is implemented by a protocol using oblivious transfer and Yao's scrambled circuit. We prove that our protocol is secure if
doi:10.4236/jsea.2010.37081
fatcat:rkjuxlsgnzadlkqgoi6ahfdzjm