Michael Ben-Or, Shafi Goldwasser, Avi Wigderson, Completeness
theorems for non-cryptographic fault-tolerant distributed computation,
Proc. 20-th ACM Symposium on Theory of Computing, 1988. pp 1-10.
Philippe Oechslin, Making a faster cryptanalytic time-memory trade-off,
Crypto 03. (cached)
Equivalence between two flavours of oblivious transfers
(PDF)
Completeness Theoerms for Fault Tolerant Distributed Computing
(PDF)
Parallel Reducibility for Information-Theoretically Secure Computation
(PDF)