Abstract
We present three novel constructions of m out of n oblivious transfer, which demonstrate significant improvement over the existing schemes in terms of completeness, robustness and flexibility. We also show how to construct a non-interactive m out of n oblivious transfer, based on discrete logarithm. These constructions have potential applicability in electronic commerce.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
M. O. Rabin, “How exchange secrets by oblivious transfer,” tech. rep., TR-81, Computer Science Laboratory, Harvard, 1981.
S. Even, O. Goldreich, and A. Lempel, “A randomized protocol for signing contracts,” in Advances in cryptology-CRYPTO’82, Lecture Notes in Computer Science, pp. 205–210, Springer Verlag, Berlin, 1982.
C. Crepeau, “Equivalence between two flavours of oblivious transfers,” in Advances in cryptology-CRYPTO’87, Lecture Notes in Computer Science 1403, pp. 350–354, Springer-Verlag, Berlin, 1987.
C. Crepeau and J. Kilian, “Weakening security assumptions and oblivious tranfer,” in Advances in cryptology-CRYPTO’88, Lecture Notes in Computer Science 1403, pp. 2–7, Springer-Verlag, Berlin, 1988.
G. Brassard, C. Crepeau, and J.-M. Robert, “Information theoretic reductions among disclose problem,” in Symp. of Found of computer science, pp. 168–173, IEEE, 1986.
B. den Boer, “Oblivious transfer protecting secrecy,” in Advances in cryptology-EUROCRYPT’90, Lecture Notes in Computer Science 1403, pp. 31–46, Springer-Verlag, Berlin, 1990.
G. Brassard and C. Crepeau, “All or nothing disclosure of secrets,” in Advances in cryptology-CRYPTO’86, Lecture Notes in Computer Science 1403, Springer-Verlag, Berlin, 1987.
A. D. Santis and G. Persiano, “Public-randomness in public-key cryptography,” in Advances in cryptology-EUROCRYPTO’90, Lecture Notes in Computer Science 1403, pp. 46–61, Springer-Verlag, Berlin, 1990.
B. Aiello, Y. Ishai, and O. Reingold, “Priced oblivious transfer: how to sell digital goods,” in Advances in cryptology-EUROCRYPTO 2001, Lecture Notes in Computer Science 2045, pp. 119–135, Springer-Verlag, Berlin, 2001.
M. Bellare and S. Micali, “Non-interactive oblivious transfer and application,” in Advances in cryptology-CRYPTO’89, Lecture Notes in Computer Science 1403, pp. 547–557, Springer-Verlag, Berlin, 1989.
K. Nyberg and R. A. Rueppel, “Message recovery for signature schemes based on the discrete logarithm problem,” pp. 182–193, Springer-Verlag, 1994.
T. ElGamal, “A public-key cryptosystem and a signature scheme based on discrete logarithms,” pp. 10–18, Springer-Verlag, Berlin, 1985.
M. Stadler and J.-M. Piveteau, “Fair blind signature,” in Advances in cryptology-CRYPTO’95, Lecture Notes in Computer Science 1403, pp. 209–219, Springer-Verlag, Berlin, 1995.
J. Kilian, “Basing cryptography on oblivious transfer,” in Proc. of STOC, 1988.
O. Goldreich, S. Micali, and A. Wigderson, “How to play any mental game,” in Proc. of STOC, 1987.
A. C. Yao, “How to generate and exchange secrets,” in Proc. of STOC, 1986.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mu, Y., Zhang, J., Varadharajan, V. (2002). m out of n Oblivious Transfer. In: Batten, L., Seberry, J. (eds) Information Security and Privacy. ACISP 2002. Lecture Notes in Computer Science, vol 2384. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45450-0_30
Download citation
DOI: https://doi.org/10.1007/3-540-45450-0_30
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43861-8
Online ISBN: 978-3-540-45450-2
eBook Packages: Springer Book Archive