A randomized protocol for signing contracts
Communications of the ACM
Founding crytpography on oblivious transfer
STOC '88 Proceedings of the twentieth 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
Protocols for secure computations
SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
Achieving oblivious transfer using weakened security assumptions
SFCS '88 Proceedings of the 29th Annual Symposium on Foundations of Computer Science
Oblivious Transfer from Weak Noisy Channels
TCC '09 Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography
Efficient cryptographic protocols based on noisy channels
EUROCRYPT'97 Proceedings of the 16th annual international conference on Theory and application of cryptographic techniques
Building oblivious transfer on channel delays
Inscrypt'10 Proceedings of the 6th international conference on Information security and cryptology
Optimal reductions between oblivious transfers using interactive hashing
EUROCRYPT'06 Proceedings of the 24th annual international conference on The Theory and Applications of Cryptographic Techniques
| Hi-index | 0.00 |
Without the use of computational assumptions, unconditionally secure oblivious transfer (OT) is impossible in the standard model where the parties are using a clear channel. Such impossibilities can be overcome by using a noisy channel. Recently, Palmieri and Pereira proposed a protocol based on random channel delays only. Their scheme is secure in the semi-honest model, but not in the general malicious model. In this paper we study oblivious transfer in the same setting but we improve the result to obtain a fully secure protocol in the malicious model.