Efficient reduction of 1 out of n oblivious transfers in random oracle model
暂无分享,去创建一个
Bao Li | Haixia Xu | Hongda Li | Guangwu Xu
[1] Sampath Kannan,et al. The relationship between public key encryption and oblivious transfer , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.
[2] Ran Canetti,et al. Security and Composition of Multiparty Cryptographic Protocols , 2000, Journal of Cryptology.
[3] Donald Beaver,et al. Correlated pseudorandomness and the complexity of private computations , 1996, STOC '96.
[4] Tal Malkin,et al. On the impossibility of basing trapdoor functions on trapdoor predicates , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.
[5] Valtteri Niemi,et al. Cryptographic Protocols and Voting , 1994, Results and Trends in Theoretical Computer Science.
[6] Lila Kari,et al. Secret Selling of Secrets with Several Buyers , 1990, Bull. EATCS.
[7] Wen-Guey Tzeng. Efficient oblivious transfer schemes , 2001, IACR Cryptol. ePrint Arch..
[8] Yuval Ishai,et al. Extending Oblivious Transfers Efficiently , 2003, CRYPTO.
[9] Julien P. Stern. A new and efficient all-or-nothing disclosure of secrets protocol , 1998 .
[10] Russell Impagliazzo,et al. Limits on the provable consequences of one-way permutations , 1988, STOC '89.
[11] Gilles Brassard,et al. All-or-Nothing Disclosure of Secrets , 1986, CRYPTO.
[12] Moni Naor,et al. Efficient oblivious transfer protocols , 2001, SODA '01.