Achieving oblivious transfer using weakened security assumptions
暂无分享,去创建一个
[1] Manuel Blum,et al. Non-interactive zero-knowledge and its applications , 1988, STOC '88.
[2] Gilles Brassard,et al. Information theoretic reductions among disclosure problems , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).
[3] Gilles Brassard,et al. All-or-Nothing Disclosure of Secrets , 1986, CRYPTO.
[4] Moti Yung,et al. Direct Minimum-Knowledge Computations , 1987, CRYPTO.
[5] A. Yao,et al. Fair exchange with a semi-trusted third party (extended abstract) , 1997, CCS '97.
[6] Gilles Brassard,et al. Quantum Cryptography, or Unforgeable Subway Tokens , 1982, CRYPTO.
[7] Claude Crépeau,et al. Equivalence Between Two Flavours of Oblivious Transfers , 1987, CRYPTO.
[8] Andrew Chi-Chih Yao,et al. How to Generate and Exchange Secrets (Extended Abstract) , 1986, FOCS.
[9] Claude Cripeaut. Equivalence Between Two Flavours of Oblivious Transfers , 1988 .
[10] Avi Wigderson,et al. Completeness theorems for non-cryptographic fault-tolerant distributed computation , 1988, STOC '88.
[11] Oded Goldreich,et al. A randomized protocol for signing contracts , 1985, CACM.
[12] David Chaum,et al. Multiparty unconditionally secure protocols , 1988, STOC '88.