
\begin{thebibliography}{ABC}

\bibitem{ASW} N.~Asokan, M.~Schunter and M.~Waidner. Optimistic
Protocols for Fair Exchange. In {\em $4$th CCS}, pages 8--17,
1997.

\bibitem{BG2} D.~Beaver and S.~Goldwasser.
\newblock Multiparty Computation with Faulty Majority.
\newblock In {\em $30$th FOCS}, pages 468--473, 1989.

\bibitem{BGW}
M.~Ben-Or, S.~Goldwasser and A.~Wigderson.
\newblock Completeness Theorems
for Non-Cryptographic Fault-Tolerant Distributed Computation.
\newblock In {\em $20$th STOC,} pages 1--10, 1988.

\bibitem{CC} C.~Cachin and J.~Camenisch. Optimistic Fair Secure
Computation. In {\em CRYPTO 2000}, Springer-Verlag (LNCS 1880),
pages 93--111, 2000.

\bibitem{C00} R.~Canetti.
\newblock Security and Composition of Multiparty Cryptographic Protocols.
\newblock {\em Journal of Cryptology}, 13(1):143--202, 2000.

\bibitem{C04}
R.~Canetti. Universally Composable Signature, Certification, and Authentication. In \emph{$17$th IEEE Computer Security Foundations Workshop} (CSFW), pages 219--235, 2004.

\bibitem{CR}
R.~Canetti and T.~Rabin. Universal Composition with Joint State. In \emph{CRYPTO 2003}, Springer-Verlag (LNCS 2729), pages 265--281, 2003.

\bibitem{CCD} D.~Chaum, C.~Cr\'{e}peau and I.~Damgard.
\newblock Multi-party Unconditionally Secure Protocols.
\newblock In {\em $20$th STOC}, pages 11--19, 1988.

\bibitem{CKP} L.~Chen, C.~Kudla and K.~Paterson. Concurrent
Signatures. In {\em EUROCRYPT 2004}, Springer-Verlag (LNCS 3027),
pages 287--305, 2004.

\bibitem{Cl} R.~Cleve.
\newblock Limits on the Security of Coin Flips when Half the Processors
are Faulty.
\newblock In {\em $18$th STOC,} pages 364--369, 1986.

\bibitem{GMPY} J.~Garay, P.~MacKenzie, M.~Prabhakaran and K.~Yang.
Resource Fairness and Composability of Cryptographic Protocols. IN
{\em TCC 2006}, Springer-Verlag (LNCS 3876), pages 404--428, 2006.

\bibitem{GHKL}
S.D.~Gordon, C.~Hazay, J.~Katz and Y.~Lindell.
Complete Fairness in Secure Two-Party Computation. Manuscript, 2007.

\bibitem{G04}
O.~Goldreich.
\newblock {\em Foundations of Cryptography: Volume 2 -- Basic Applications}.
\newblock Cambridge University Press, 2004.

\bibitem{GMW} O.~Goldreich, S.~Micali and A.~Wigderson.
\newblock How to Play any Mental Game --
A Completeness Theorem for Protocols with Honest Majority.
\newblock In {\em $19$th STOC,}  pages 218--229, 1987.

\bibitem{GoLe}
S.~Goldwasser and L.~Levin.
\newblock Fair Computation of General Functions
in Presence of Immoral Majority.
\newblock In {\em CRYPTO'90,} Springer-Verlag (LNCS 537), pages 77--93, 1990.

\bibitem{GoLi}
\newblock S.~Goldwasser and Y.~Lindell.
\newblock Secure Computation Without Agreement.
\newblock {\em Journal of Cryptology,} 18(3):247--287, 2005.

\bibitem{LLR}
Y.~Lindell, A.~Lysysanskaya and T.~Rabin.
\newblock On the Composition of Authenticated Byzantine Agreement.
\newblock In the {\em Journal of the ACM}, 53(6):881--917, 2006.

\bibitem{M98} S.~Micali. Secure Protocols with Invisible Trusted
Parties. Presentation on Multi-Party Secure Protocols, Weizmann
Institute of Science, Israel. June 1998.

\bibitem{M03}
Silvio Micali. Simple and Fast Optimistic Protocols for Fair Electronic Exchange. In \emph{$22$nd PODC}, pages 12--19, 2003.

\bibitem{P03} B.~Pinkas. Fair Secure Two-Party Computation. In {\em
EUROCRYPT 2003}, Springer-Verlag (LNCS 2656), pages 87--105, 2003.

\bibitem{Y} A.~Yao.
\newblock How to Generate and Exchange Secrets.
\newblock In {\em $27$th FOCS}, pages 162--167, 1986.

\end{thebibliography}