Information theoretically secure oblivious polynomial evaluation: Model, bounds, and constructions

G Hanaoka, H Imai, J Mueller-Quade, ACA Nascimento, A Otsuka, AJ Winter

Research output: Contribution to journalArticle (Academic Journal)

4 Citations (Scopus)

Abstract

We introduce an information theoretical model for oblivious polynomial evaluation relying on predistributed data, and prove very general lower bounds on the size of the predistributed data, as well as the size of the communications in any (one-round) protocol. We then show that these bounds are tight by exhibiting a scheme for oblivious polynomial evaluation achieveing all the lower bounds simultaneously. We also present a natural generalisation to oblivious linear function evaluation.
Translated title of the contributionInformation theoretically secure oblivious polynomial evaluation: Model, bounds, and constructions
Original languageEnglish
Pages (from-to)62 - 73
JournalLecture Notes in Computer Science
Volume3108
Publication statusPublished - 2004

Bibliographical note

Publisher: Springer-Verlag Berlin
Other identifier: IDS Number: BAK11

Fingerprint Dive into the research topics of 'Information theoretically secure oblivious polynomial evaluation: Model, bounds, and constructions'. Together they form a unique fingerprint.

Cite this