✦ LIBER ✦

Completeness in Two-Party Secure Computation: A Computational View

✍ Scribed by Danny Harnik; Moni Naor; Omer Reingold; Alon Rosen

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Secure Two-Party Computational Geometry

✍ Shun-Dong Li; Yi-Qi Dai 📂 Article 📅 2005 🏛 Springer 🌐 English ⚖ 382 KB

Partial Fairness in Secure Two-Party Com

✍ S. Dov Gordon; Jonathan Katz 📂 Article 📅 2010 🏛 Springer 🌐 English ⚖ 425 KB

Minimal Complete Primitives for Secure M

✍ Matthias Fitzi; Juan A. Garay; Ueli Maurer; Rafail Ostrovsky 📂 Article 📅 2004 🏛 Springer 🌐 English ⚖ 251 KB

Parallel Coin-Tossing and Constant-Round

✍ Lindell 📂 Article 📅 2003 🏛 Springer 🌐 English ⚖ 325 KB

A Proof of Security of Yao’s Protocol fo

✍ Yehuda Lindell; Benny Pinkas 📂 Article 📅 2008 🏛 Springer 🌐 English ⚖ 450 KB

A management view: computer security as

✍ James A. Schweitzer 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 901 KB