Efficient oblivious transfer schemes (2002) [1 citations — 0 self]
Download:
|
|
by Wen-guey Tzeng
In Proceedings of 2002 International Workshop on Practice and Theory in Public-Key Cryptography (PKC 02), Lecture Notes in Computer Science 2274
http://eprint.iacr.org/2001/073.ps.gz
Add To MetaCart
Abstract:
In this paper we propose a very e#cient (string) OT
Citations
| 468 | Completeness Theorems for Noncryptographic Fault-Tolerant Distributed Computations – Ben-Or, Goldwasser, et al. |
| 34 | Locally random reductions: Improvements and applications – Beaver, Feigenbaum, et al. - 1997 |
| 13 | A provably secure oblivious transfer protocol – Berger, Peralta, et al. - 1985 |
| 11 | Precomputing oblivious transfer – Beaver - 1995 |
| 6 | How to break a ”secure” oblivious transfer protocol – Beaver - 1992 |
| 5 | Non-interactive oblivious transfer – Bellare, Micali - 1990 |
