General public key m-out-of-n oblivious transfer

Authors:
Zhide Chen;Hong Zhu
Affiliations:
Department of Computer Science, Fudan University, Shanghai, P. R. China;Key Laboratory of Intelligent Information Processing, Fudan University, Shanghai, P. R. China
Venue:
CIS'04 Proceedings of the First international conference on Computational and Information Science
Year:
2004

Citing 9
Cited 0

A randomized protocol for signing contracts

Communications of the ACM
How to play ANY mental game

STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Founding crytpography on oblivious transfer

STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Efficient oblivious transfer protocols

SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Introduction to Algorithms

Introduction to Algorithms
m out of n Oblivious Transfer

ACISP '02 Proceedings of the 7th Australian Conference on Information Security and Privacy
Oblivious Transfer with Adaptive Queries

CRYPTO '99 Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology
Committed Oblivious Transfer and Private Multi-Party Computation

CRYPTO '95 Proceedings of the 15th Annual International Cryptology Conference on Advances in Cryptology
Priced Oblivious Transfer: How to Sell Digital Goods

EUROCRYPT '01 Proceedings of the International Conference on the Theory and Application of Cryptographic Techniques: Advances in Cryptology

Quantified Score

Hi-index	0.00

Visualization

Abstract

In the m-out-of-n oblivious transfer model, Alice has n messages, Bob has m choices. After the interaction between the two parties, Bob can get m but only m messages from the n messages, Alice cannot know which m messages Bob gets. In this paper, for the first time, we construct a m-out-of-n OT protocol based on the general secure public key system.