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
Oblivious transfer and polynomial evaluation
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
A database encryption system with subkeys
ACM Transactions on Database Systems (TODS)
Signature schemes based on the strong RSA assumption
CCS '99 Proceedings of the 6th ACM conference on Computer and communications security
Untraceable electronic mail, return addresses, and digital pseudonyms
Communications of the ACM
A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
Efficient oblivious transfer protocols
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Non-Interactive Oblivious Transfer and Spplications
CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Efficient 1-Out-of-n Oblivious Transfer Schemes with Universally Usable Parameters
IEEE Transactions on Computers
Information theoretic reductions among disclosure problems
SFCS '86 Proceedings of the 27th Annual Symposium on Foundations of Computer Science
Single database private information retrieval implies oblivious transfer
EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
A public key cryptosystem and a signature scheme based on discrete logarithms
IEEE Transactions on Information Theory
A novel CRT-based watermarking technique for authentication of multimedia contents
Digital Signal Processing
A novel DCT domain CRT-based watermarking scheme for image authentication surviving JPEG compression
Digital Signal Processing
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.00 |
Providing private communications for involved participants, the oblivious transfer (OT) mechanism is an important component in many cryptography applications such as e-commerce, secret exchange, coin flipping by telephone and sending certified e-mail. Recently, Mu et al. extended the OT concept to a t-out-of-n version (denoted as OT"t^n). They claim that the novel method allows the chooser to simultaneously obtain t messages from the sender in each protocol run. Wu et al.'s improvements make an OT mechanism more flexible and efficient. Unfortunately, we propose a strategy to demonstrate that their method is unable to provide the privacy of the sender in this article. Furthermore, we present a novel OT"t^n mechanism based on the concepts of blind signature and the Chinese remainder theorem. This novel mechanism achieves the essentials of general OT mechanisms.