A randomized protocol for signing contracts
Communications of the ACM
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
All-or-nothing disclosure of secrets
Proceedings on Advances in cryptology---CRYPTO '86
Founding crytpography on oblivious transfer
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Oblivious transfer and polynomial evaluation
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Equivalence Between Two Flavours of Oblivious Transfers
CRYPTO '87 A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology
Practical Quantum Oblivious Transfer
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
Precomputing Oblivious Transfer
CRYPTO '95 Proceedings of the 15th Annual International Cryptology Conference on Advances in Cryptology
How to generate and exchange secrets
SFCS '86 Proceedings of the 27th Annual Symposium on Foundations of Computer Science
Information theoretic reductions among disclosure problems
SFCS '86 Proceedings of the 27th Annual Symposium on Foundations of Computer Science
On the reversibility of oblivious transfer
EUROCRYPT'91 Proceedings of the 10th annual international conference on Theory and application of cryptographic techniques
| Hi-index | 0.00 |
We define a new cryptographic primitive which is called Oblivious n-variate Linear Function Evaluation with choice space C and denoted by C-OLFEn. The primitive captures a variety of well-known cryptographic primitives and is an interesting stepstone in secure protocol design. We present a statistically secure reduction from (n 1)-OT to kn invocations of C-OLFEn, where k is the security parameter and C contains all unit vectors of length n. The reduction allows us to reverse (n 1)-OT for any integer n ≥ 2.