Abstract
We define a new cryptographic primitive which is called Oblivious n-variate Linear Function Evaluation with choice space \(\mathcal{C}\) and denoted by \(\mathcal{C}\text{-}{\rm OLFE}_{n}\). The primitive captures a variety of well-known cryptographic primitives and is an interesting stepstone in secure protocol design. We present a statistically secure reduction from \({n\choose 1}\)-OT to kn invocations of \(\mathcal{C}\text{-}{\rm OLFE}_{n}\), where k is the security parameter and \(\mathcal{C}\) contains all unit vectors of length n. The reduction allows us to reverse \({n\choose 1}\)-OT for any integer nāā„ā2.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Beaver, D.: Precomputing oblivious transfer. In: Coppersmith, D. (ed.) CRYPTO 1995. LNCS, vol. 963, pp. 97ā109. Springer, Heidelberg (1995)
Bennett, C.H., Brassard, G., CrĆ©peau, C., Skubiszewska, H.: Practical quantum oblivious transfer. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol. 576, pp. 351ā366. Springer, Heidelberg (1992)
Brassard, G., CrĆ©peau, C., Robert, J.M.: Information theoretic reductions among disclosure problems. In: FOCS 1986, pp. 168ā173. IEEE, Los Alamitos (1986)
Brassard, G., CrĆ©peau, C., Robert, J.M.: All-or-nothing disclosure of secrets. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol. 263, pp. 234ā238. Springer, Heidelberg (1987)
Brassard, G., CrĆ©peau, C., Wolf, S.: Oblivious transfers and privacy amplification. Journal of Cryptology 16(4), 219ā237 (2003)
Cachin, C.: On the foundations of oblivious transfer. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol. 1403, pp. 361ā374. Springer, Heidelberg (1998)
Canetti, R.: Security and composition of multiparty cryptographic protocols. Journal of Cryptology 13(1), 143ā202 (2000)
CrĆ©peau, C.: Equivalence between two flavors of oblivious transfers. In: Pomerance, C. (ed.) CRYPTO 1987. LNCS, vol. 293, pp. 350ā354. Springer, Heidelberg (1988)
CrĆ©peau, C., SĆ”ntha, M.: On the reversibility of oblivious transfer. In: Davies, D.W. (ed.) EUROCRYPT 1991. LNCS, vol. 547, pp. 106ā113. Springer, Heidelberg (1991)
Even, S., Goldreich, O., Lempel, A.: A randomized protocol for signing contracts. Communications of the ACM 28(6), 637ā647 (1985)
Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game or a completeness theorem for protocols with honest majority. In: STOC 1987, pp. 218ā229. ACM, New York (1987)
Kilian, J.: Founding cryptography on oblivious transfer. In: STOC 1988, pp. 20ā31. ACM, New York (1988)
Naor, M., Pinkas, B.: Oblivious transfer and polynomial evaluation. In: STOC 1999, pp. 245ā354. ACM, New York (1999)
Rabin, M.O.: How to exchange secrets by oblivious transfer. Technical Report TR-81, Aiken Computation Laboratory, Harvard University (1981)
Yao, A.C.C.: How to generate and exchange secrets. In: FOCS 1986, pp. 162ā167. IEEE, Los Alamitos (1986)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
Ā© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chee, Y.M., Wang, H., Zhang, L.F. (2011). Oblivious Transfer and n-Variate Linear Function Evaluation. In: Fu, B., Du, DZ. (eds) Computing and Combinatorics. COCOON 2011. Lecture Notes in Computer Science, vol 6842. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22685-4_54
Download citation
DOI: https://doi.org/10.1007/978-3-642-22685-4_54
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-22684-7
Online ISBN: 978-3-642-22685-4
eBook Packages: Computer ScienceComputer Science (R0)