A randomized protocol for signing contracts
Communications of the ACM
All-or-nothing disclosure of secrets
Proceedings on Advances in cryptology---CRYPTO '86
Non-interactive oblivious transfer and applications
CRYPTO '89 Proceedings on Advances in cryptology
New Results on Unconditionally Secure Distributed Oblivious Transfer
SAC '02 Revised Papers from the 9th Annual International Workshop on Selected Areas in Cryptography
Oblivious Transfer with Adaptive Queries
CRYPTO '99 Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology
On Unconditionally Secure Distributed Oblivious Transfer
INDOCRYPT '02 Proceedings of the Third International Conference on Cryptology: Progress in Cryptology
Distributed Oblivious Transfer
ASIACRYPT '00 Proceedings of the 6th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Efficient distributed 1 out of n oblivious transfer
Efficient distributed 1 out of n oblivious transfer
On Unconditionally Secure Distributed Oblivious Transfer
Journal of Cryptology
Strengthening the Security of Distributed Oblivious Transfer
ACISP '09 Proceedings of the 14th Australasian Conference on Information Security and Privacy
Distributed Oblivious Transfer with Adaptive Queries
CMC '10 Proceedings of the 2010 International Conference on Communications and Mobile Computing - Volume 01
Hi-index | 0.00 |
The unconditionally secure Distributed Oblivious Transfer (DOT) protocol introduced by Naor and Pinkas allows a receiver to contact k servers and obtain one out of two secrets held by a sender. In its generalized version presented by Blundo, D'Arco, De Santis, and Stinson, a receiver can choose one out of n secrets. In this paper, we introduce three unconditionally secure DOT protocols which allow a receiver to obtain t out of n secrets. The first protocol allows the receiver to obtain t secrets in one round only, provided she is able to communicate with k+t−1 servers. The settings of the second and third protocols are adaptive, i.e., the receiver sequentially sends t queries to the servers to obtain t secrets. In the second protocol, the number of receiver's queries is limited unlike in the third one, where the contacted servers need to communicate with each other. These three protocols, like other unconditionally secure oblivious transfer protocols, guarantee the security of the sender and the privacy of the receiver. In addition, the sender's security is guaranteed against a coalition of the receiver and k−1 servers and, similarly, the receiver's privacy is guaranteed against a coalition of k−1 servers.