Oblivious transfer and n-variate linear function evaluation

Yeow Meng Chee; Huaxiong Wang; Liang Feng Zhang

doi:10.1007/978-3-642-22685-4_54

Oblivious transfer and n-variate linear function evaluation

Yeow Meng Chee^*, Huaxiong Wang, Liang Feng Zhang

^*Corresponding author for this work

School of Computing

Research output: Chapter in Book/Report/Conference proceeding › Conference proceeding contribution › peer-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 (₁ ⁿ)-OT to kn invocations of C-OLFF_n, where k is the security parameter and C contains all unit vectors of length n. The reduction allows us to reverse ( ₁ ⁿ)-OT for any integer n ≥ 2.

Original language	English
Title of host publication	Computing and Combinatorics
Subtitle of host publication	17th Annual International Conference, COCOON 2011, Dallas, TX, USA, August 2011, Proceedings
Editors	Bin Fu, Ding-Zhu Du
Place of Publication	Berlin, Heidelberg
Publisher	Springer, Springer Nature
Pages	627-637
Number of pages	11
ISBN (Electronic)	9783642226854
ISBN (Print)	9783642226847
DOIs	https://doi.org/10.1007/978-3-642-22685-4_54
Publication status	Published - 2011
Event	17th Annual International Computing and Combinatorics Conference, COCOON 2011 - Dallas, TX, United States Duration: 14 Aug 2011 → 16 Aug 2011

Publication series

Name	Lecture Notes in Computer Science
Volume	6842
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Other

Other	17th Annual International Computing and Combinatorics Conference, COCOON 2011
Country/Territory	United States
City	Dallas, TX
Period	14/08/11 → 16/08/11

Access to Document

10.1007/978-3-642-22685-4_54

Cite this

Chee, Y. M., Wang, H., & Zhang, L. F. (2011). Oblivious transfer and n-variate linear function evaluation. In B. Fu, & D.-Z. Du (Eds.), Computing and Combinatorics: 17th Annual International Conference, COCOON 2011, Dallas, TX, USA, August 2011, Proceedings (pp. 627-637). (Lecture Notes in Computer Science; Vol. 6842). Springer, Springer Nature. https://doi.org/10.1007/978-3-642-22685-4_54

Chee, Yeow Meng ; Wang, Huaxiong ; Zhang, Liang Feng. / Oblivious transfer and n-variate linear function evaluation. Computing and Combinatorics: 17th Annual International Conference, COCOON 2011, Dallas, TX, USA, August 2011, Proceedings. editor / Bin Fu ; Ding-Zhu Du. Berlin, Heidelberg : Springer, Springer Nature, 2011. pp. 627-637 (Lecture Notes in Computer Science).

@inproceedings{6c7503fbc9a64f8990c556f15e031ac4,

title = "Oblivious transfer and n-variate linear function evaluation",

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.",

author = "Chee, {Yeow Meng} and Huaxiong Wang and Zhang, {Liang Feng}",

year = "2011",

doi = "10.1007/978-3-642-22685-4_54",

language = "English",

isbn = "9783642226847",

series = "Lecture Notes in Computer Science",

publisher = "Springer, Springer Nature",

pages = "627--637",

editor = "Bin Fu and Ding-Zhu Du",

booktitle = "Computing and Combinatorics",

address = "United States",

note = "17th Annual International Computing and Combinatorics Conference, COCOON 2011 ; Conference date: 14-08-2011 Through 16-08-2011",

}

Chee, YM, Wang, H & Zhang, LF 2011, Oblivious transfer and n-variate linear function evaluation. in B Fu & D-Z Du (eds), Computing and Combinatorics: 17th Annual International Conference, COCOON 2011, Dallas, TX, USA, August 2011, Proceedings. Lecture Notes in Computer Science, vol. 6842, Springer, Springer Nature, Berlin, Heidelberg, pp. 627-637, 17th Annual International Computing and Combinatorics Conference, COCOON 2011, Dallas, TX, United States, 14/08/11. https://doi.org/10.1007/978-3-642-22685-4_54

Oblivious transfer and n-variate linear function evaluation. / Chee, Yeow Meng; Wang, Huaxiong; Zhang, Liang Feng.
Computing and Combinatorics: 17th Annual International Conference, COCOON 2011, Dallas, TX, USA, August 2011, Proceedings. ed. / Bin Fu; Ding-Zhu Du. Berlin, Heidelberg: Springer, Springer Nature, 2011. p. 627-637 (Lecture Notes in Computer Science; Vol. 6842).

Research output: Chapter in Book/Report/Conference proceeding › Conference proceeding contribution › peer-review

TY - GEN

T1 - Oblivious transfer and n-variate linear function evaluation

AU - Chee, Yeow Meng

AU - Wang, Huaxiong

AU - Zhang, Liang Feng

PY - 2011

Y1 - 2011

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=80051991337&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-22685-4_54

DO - 10.1007/978-3-642-22685-4_54

M3 - Conference proceeding contribution

AN - SCOPUS:80051991337

SN - 9783642226847

T3 - Lecture Notes in Computer Science

SP - 627

EP - 637

BT - Computing and Combinatorics

A2 - Fu, Bin

A2 - Du, Ding-Zhu

PB - Springer, Springer Nature

CY - Berlin, Heidelberg

T2 - 17th Annual International Computing and Combinatorics Conference, COCOON 2011

Y2 - 14 August 2011 through 16 August 2011

ER -

Chee YM, Wang H, Zhang LF. Oblivious transfer and n-variate linear function evaluation. In Fu B, Du DZ, editors, Computing and Combinatorics: 17th Annual International Conference, COCOON 2011, Dallas, TX, USA, August 2011, Proceedings. Berlin, Heidelberg: Springer, Springer Nature. 2011. p. 627-637. (Lecture Notes in Computer Science). doi: 10.1007/978-3-642-22685-4_54

Oblivious transfer and n-variate linear function evaluation

Abstract

Publication series

Other

Access to Document

Other files and links

Fingerprint

Cite this