A proof of yao's protocol for secure two-party computation Export

@misc{citeulike:3039933, abstract = {In the mid 1980's, Yao presented a constant-round protocol for securely computing any two-party functionality in the presence of semi-honest adversaries (FOCS 1986). In this paper, we provide a complete description of Yao's protocol, along with a rigorous proof of security.}, author = {Lindell, Y. and Pinkas, B.}, citeulike-article-id = {3039933}, citeulike-linkout-0 = {http://citeseer.ist.psu.edu/699756.html}, citeulike-linkout-1 = {http://citeseer.lcs.mit.edu/699756.html}, citeulike-linkout-2 = {http://citeseer.ifi.unizh.ch/699756.html}, citeulike-linkout-3 = {http://citeseer.comp.nus.edu.sg/699756.html}, keywords = {multiparty, secure}, posted-at = {2008-09-25 23:40:05}, priority = {2}, title = {A proof of yao's protocol for secure two-party computation}, url = {http://citeseer.ist.psu.edu/699756.html}, year = {2004} }

TY - GEN ID - citeulike:3039933 L3 - citeulike-article-id:3039933 N2 - In the mid 1980's, Yao presented a constant-round protocol for securely computing any two-party functionality in the presence of semi-honest adversaries (FOCS 1986). In this paper, we provide a complete description of Yao's protocol, along with a rigorous proof of security. TI - A proof of yao's protocol for secure two-party computation KW - multiparty KW - secure AU - Lindell, Y AU - Pinkas, B PY - 2004/// UR - http://citeseer.ist.psu.edu/699756.html ER -