Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1016/j.jnca.2008.03.004 | J. Network and Computer Applications |
Keywords | Field | DocType |
blind signature,novel method,OT mechanism,robust t-out-of-n oblivious transfer,novel OT,certified e-mail,novel mechanism,OT concept,Chinese remainder theorem,n mechanism,general OT mechanism | Computer science,Cryptography,Computer network,Blind signature,Oblivious transfer | Journal |
Volume | Issue | ISSN |
32 | 1 | Journal of Network and Computer Applications |
Citations | PageRank | References |
15 | 0.71 | 20 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Chin Chen Chang | 1 | 7849 | 725.95 |
| Jung-San Lee | 2 | 353 | 30.52 |