Academic
Publications
t-Out-of-n String/Bit Oblivious Transfers Revisited

t-Out-of-n String/Bit Oblivious Transfers Revisited,10.1007/978-3-540-31979-5_35,Qianhong Wu,Bo Qin,Changjie Wang,Xiaofeng Chen,Yumin Wang

t-Out-of-n String/Bit Oblivious Transfers Revisited   (Citations: 3)
BibTex | RIS | RefWorks Download
In this paper, we focus on lowering the complexity of t-out-of-n string/bit OTs for large t. The notion of oblivious public-key cryptosystem (OPKC) is introduced, in which Bob possesses n public keys but only t private keys and no one knows which t private keys Bob possesses. If the sender, say, Alice, encrypts each message using the n oblivious public keys, resp., the receiver, Bob, can obtain only t messages by t decryptions with his known t private keys. This approach can be directly applied to t-out-of-n bit OT. However, it is very inefficient due to heavy message expansion and many encryption/decryption operations. To construct t-out-of-n bit OT, we introduce bit oblivious public-key cryptosystem (BOPKC), which is a special public-key cryptosystem with a message space of n bits, and the private key only enables its owner to decrypt t bits of n secret bits. After an offline generation of such a BOPKC, it requires only one encryption, one decryption and one ciphertext. Finally, we show the concrete implementations of OPKC/BOPKC based on ElGamal/Paillier cryptosystem, and efficient t-out-of-n string/bit OTs are achieved.
Cumulative Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.
    • ...In [22], Wu et al. stated that k-out-of-n t-bit string OT can be achieved applying Rabin’s version of OT, O(ktlogn) times...
    • ...In another version, OT n k is achieved using a OT n 1 scheme O(k) times [22]...
    • ...The drawback of this scheme is that it works only when k � n 1/4 . In [22], efficient homomorphic based OT n k was proposed for a condition when k � n/logn...

    Mummoorthy Murugesanet al. k-out-of-n oblivious transfer based on homomorphic encryption and solv...

    • ...In [21], Wu et al. stated that k-out-of-n t-bit string OT can be achieved applying Rabin’s version of OT, O(ktlogn) times...
    • ...[21]. Although there are efficient reduction protocols [16],there are numerous proposed OTnk schemes [5] that do not rely on existing OT21 or OTn1 protocols,...
    • ...In [21], efficient homomorphic based OTnk was proposed for a condition when k ≥ n/logn...

    Mummoorthy Murugesanet al. Homomorphic Encryption based k-out-of-n Oblivious Transfer Protocols

Sort by: