A novel k-out-of-n oblivious transfer protocol from bilinear pairing

Authors:
Jue-Sam Chou
Affiliations:
Department of Information Management, Nanhua University, Taiwan
Venue:
Advances in Multimedia - Special issue on Web Services in Multimedia Communication
Year:
2012

Citing 26
Cited 0

A randomized protocol for signing contracts

Communications of the ACM
All-or-nothing disclosure of secrets

Proceedings on Advances in cryptology---CRYPTO '86
Oblivious transfer and polynomial evaluation

STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Privacy preserving auctions and mechanism design

Proceedings of the 1st ACM conference on Electronic commerce
Efficient oblivious transfer protocols

SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Mental poker game based on a bit commitment scheme through network

Computer Networks: The International Journal of Computer and Telecommunications Networking
Cryptography and Network Security: Principles and Practice

Cryptography and Network Security: Principles and Practice
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
Identity-Based Encryption from the Weil Pairing

CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
Non-Interactive Oblivious Transfer and Spplications

CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
Distributed Oblivious Transfer

ASIACRYPT '00 Proceedings of the 6th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
The Power of RSA Inversion Oracles and the Security of Chaum's RSA-Based Blind Signature Scheme

FC '01 Proceedings of the 5th International Conference on Financial Cryptography
Threshold Signatures, Multisignatures and Blind Signatures Based on the Gap-Diffie-Hellman-Group Signature Scheme

PKC '03 Proceedings of the 6th International Workshop on Theory and Practice in Public Key Cryptography: Public Key Cryptography
Probabilistic encryption & how to play mental poker keeping secret all partial information

STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Oblivious keyword search

Journal of Complexity - Special issue on coding and cryptography
A New Design for Efficient t-out-n Oblivious Transfer Scheme

AINA '05 Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 2
Oblivious Transfer Using Elliptic Curves

CIC '06 Proceedings of the 15th International Conference on Computing
Simulatable Adaptive Oblivious Transfer

EUROCRYPT '07 Proceedings of the 26th annual international conference on Advances in Cryptology
Robust t-out-of-n oblivious transfer mechanism based on CRT

Journal of Network and Computer Applications
Secure verifiable non-interactive oblivious transfer protocol using RSA and Bit commitment on distributed environment

Future Generation Computer Systems
The Essential Design Principles of Verifiable Non-interactive OT Protocols

ISDA '08 Proceedings of the 2008 Eighth International Conference on Intelligent Systems Design and Applications - Volume 03
Comments on the 'm out of n oblivious transfer'

Information Processing Letters
Privacy-preserving computation of benchmarks on item-level data using RFID

Proceedings of the third ACM conference on Wireless network security
Oblivious transfer with timed-release receiver's privacy

Journal of Systems and Software
Efficient k-out-of-n oblivious transfer schemes with adaptive and non-adaptive queries

PKC'05 Proceedings of the 8th international conference on Theory and Practice in Public Key Cryptography

Quantified Score

Hi-index	0.00

Visualization

Abstract

Oblivious transfer (OT) protocols mainly contain three categories: 1-out-of-2 OT, 1-out-of-n OT, and k-out-of-n OT. In most cases, they are treated as cryptographic primitives and are usually executed without consideration of possible attacks that might frequently occur in an open network, such as an impersonation, replaying, or man-in-the-middle attack. Therefore, when used in certain applications, such as mental poker games and fair contract signings, some extra mechanisms must be combined to ensure the security of the protocol. However, after a combination, we found that very few of the resulting schemes are efficient enough in terms of communicational cost, which is a significant concern for generic commercial transactions. Therefore, we propose a novel k-out-of-n oblivious transfer protocol based on bilinear pairing, which not only satisfies the requirements of a k-out-of-n OT protocol, but also provides mutual authentication to resist malicious attacks. Meanwhile, it is efficient in terms of communication cost.