Founding crytpography on oblivious transfer
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Constant-rate oblivious transfer from noisy channels
CRYPTO'11 Proceedings of the 31st annual conference on Advances in cryptology
Oblivious transfer is symmetric
EUROCRYPT'06 Proceedings of the 24th annual international conference on The Theory and Applications of Cryptographic Techniques
Broadcast channels with confidential messages
IEEE Transactions on Information Theory
Estimating Mutual Information Via Kolmogorov Distance
IEEE Transactions on Information Theory
On the Oblivious-Transfer Capacity of Noisy Resources
IEEE Transactions on Information Theory
Common randomness in information theory and cryptography. I. Secret sharing
IEEE Transactions on Information Theory
Secret key agreement by public discussion from common information
IEEE Transactions on Information Theory
Achieving Oblivious Transfer Capacity of Generalized Erasure Channels in the Malicious Model
IEEE Transactions on Information Theory
| Hi-index | 0.00 |
Upper and lower bounds to the oblivious transfer (OT) capacity of discrete memoryless channels and multiple sources are obtained, for 1 of 2 strings OT with honest but curious participants. The upper bounds hold also for one-string OT. The results provide the exact value of OT capacity for a specified class of models, and the necessary and sufficient condition of its positivity, in general.