Oblivious transfer and n-variate linear function evaluation

Yeow Meng Chee*, Huaxiong Wang, Liang Feng Zhang

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference proceeding contributionpeer-review

Abstract

We define a new cryptographic primitive which is called Oblivious n-variate Linear Function Evaluation with choice space C and denoted by C-OLFF 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 (1 n)-OT to kn invocations of C-OLFFn, where k is the security parameter and C contains all unit vectors of length n. The reduction allows us to reverse ( 1 n)-OT for any integer n ≥ 2.

Original languageEnglish
Title of host publicationComputing and Combinatorics
Subtitle of host publication17th Annual International Conference, COCOON 2011, Dallas, TX, USA, August 2011, Proceedings
EditorsBin Fu, Ding-Zhu Du
Place of PublicationBerlin, Heidelberg
PublisherSpringer, Springer Nature
Pages627-637
Number of pages11
ISBN (Electronic)9783642226854
ISBN (Print)9783642226847
DOIs
Publication statusPublished - 2011
Event17th Annual International Computing and Combinatorics Conference, COCOON 2011 - Dallas, TX, United States
Duration: 14 Aug 201116 Aug 2011

Publication series

NameLecture Notes in Computer Science
Volume6842
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other17th Annual International Computing and Combinatorics Conference, COCOON 2011
CountryUnited States
CityDallas, TX
Period14/08/1116/08/11

Fingerprint Dive into the research topics of 'Oblivious transfer and n-variate linear function evaluation'. Together they form a unique fingerprint.

Cite this