k-out-of-n oblivious transfer based on homomorphic encryption and solvability of linear equations

Authors:
Mummoorthy Murugesan;Wei Jiang;Ahmet Erhan Nergiz;Serkan Uzunbaz
Affiliations:
Teradata Corporation, El Segundo, CA, USA;Missouri University of Science and Technology, Rolla, MO, USA;Purdue University, W. Lafayette, IN, USA;Purdue University, W. Lafayette, IN, USA
Venue:
Proceedings of the first ACM conference on Data and application security and privacy
Year:
2011

Citing 14
Cited 0

The knowledge complexity of interactive proof-systems

STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
All-or-nothing disclosure of secrets

Proceedings on Advances in cryptology---CRYPTO '86
Secret sharing homomorphisms: keeping shares of a secret secret

Proceedings on Advances in cryptology---CRYPTO '86
Weakening security assumptions and oblivious transfer

CRYPTO '88 Proceedings on Advances in cryptology
Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems

Journal of the ACM (JACM)
A new public key cryptosystem based on higher residues

CCS '98 Proceedings of the 5th ACM conference on Computer and communications security
Oblivious transfer and polynomial evaluation

STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
On the distribution of rank of a random matrix over a finite field

Proceedings of the ninth international conference on on Random structures and algorithms
Equivalence Between Two Flavours of Oblivious Transfers

CRYPTO '87 A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology
Foundations of Cryptography: Volume 2, Basic Applications

Foundations of Cryptography: Volume 2, Basic Applications
Information theoretic reductions among disclosure problems

SFCS '86 Proceedings of the 27th Annual Symposium on Foundations of Computer Science
Public-key cryptosystems based on composite degree residuosity classes

EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Fair secure two-party computation

EUROCRYPT'03 Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques
t-out-of-n string/bit oblivious transfers revisited

ISPEC'05 Proceedings of the First international conference on Information Security Practice and Experience

Quantified Score

Hi-index	0.00

Visualization

Abstract

Oblivious Transfer (OT) is an important cryptographic tool, which has found its usage in many crypto protocols, such as Secure Multiparty Computations, Certified E-mail and Simultaneous Contract Signing . In this paper, we propose three k-out-of-n OT (OT_k^n) protocols based on additive homomorphic encryption. Two of these protocols prohibit malicious behaviors from a receiver. We also achieve efficient communication complexity bounded by O(l* n) in bits, where l is the size of the encryption key. The computational complexity is comparable to the most efficient existing protocols. Due to the semantic security property, the sender cannot get receiver's selection. When the receiver tries to retrieve more than k values, the receiver is caught cheating with 1-(1/m) probability (Protocol II) or the receiver is unable to get any value at all (Protocol III). We introduce a novel technique based on the solvability of linear equations, which could find its way into other applications. We also provide an experimental analysis to compare the efficiency of the protocols.