Proceedings of CRYPTO 84 on Advances in cryptology
A provably secure oblivious transfer protocol
Proc. of the EUROCRYPT 84 workshop on Advances in cryptology: theory and application of cryptographic techniques
The cryptographic security of truncated linearly related variables
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
ACM Transactions on Computer Systems (TOCS)
The Art of Computer Programming Volumes 1-3 Boxed Set
The Art of Computer Programming Volumes 1-3 Boxed Set
Gradual and Verifiable Release of a Secret
CRYPTO '87 A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology
Controlled Gradual Disclosure Schemes for Random Bits and Their Applications
CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
Non-Interactive Oblivious Transfer and Spplications
CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
On Oblivious Transfer Protocol and Its Application for the Exchange of Secrets
ASIACRYPT '91 Proceedings of the International Conference on the Theory and Applications of Cryptology: Advances in Cryptology
How to simultaneously exchange a secret bit by flipping a symmetrically-biased coin
SFCS '83 Proceedings of the 24th Annual Symposium on Foundations of Computer Science
A novel k-out-of-n oblivious transfer protocol from bilinear pairing
Advances in Multimedia - Special issue on Web Services in Multimedia Communication
| Hi-index | 0.02 |
In this paper, we have discussed the issues concerning the basic concept and classification of OT (Oblivious Transfer). We have proposed secure verifiable non-interactive oblivious transfer protocols for the exchange of secrets on distributed environments. One is a new secure verifiable non-interactive oblivious transfer protocol using RSA, the other is that with bit commitment using one-way functions. The structure of the protocols is similar to that of the original protocols proposed by Bellare and Micali. Their protocols are based on the difficulty of the discrete logarithm problem. Our protocols are also based on the difficulty of the discrete logarithm problem. The secret in their protocol could be chosen as a random number. The security in our protocols also can be chosen as a random number. These methods have the additional functions that enable us to authenticate the sender and to protect one's denial of what he/she has sent the messages to the other. The traffic amount of transfer of the proposed methods is less than or equal to that of the conventional interactive method.