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

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

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

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

School of Mathematics

Research output: Contribution to journal › Article (Academic Journal) › peer-review

9 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 contribution	Information theoretically secure oblivious polynomial evaluation: Model, bounds, and constructions
Original language	English
Pages (from-to)	62 - 73
Journal	Lecture Notes in Computer Science
Volume	3108
Publication status	Published - 2004

Bibliographical note

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

Handle.net

Persistent link

Cite this

@article{8d75aee9c9854f3089e3bc246e4cbf9b,

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

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

author = "G Hanaoka and H Imai and J Mueller-Quade and ACA Nascimento and A Otsuka and AJ Winter",

note = "Publisher: Springer-Verlag Berlin Other identifier: IDS Number: BAK11 ",

year = "2004",

language = "English",

volume = "3108",

pages = "62 -- 73",

journal = "Lecture Notes in Computer Science",

issn = "1611-3349",

publisher = "Springer Science and Business Media Deutschland GmbH",

}

TY - JOUR

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

AU - Hanaoka, G

AU - Imai, H

AU - Mueller-Quade, J

AU - Nascimento, ACA

AU - Otsuka, A

AU - Winter, AJ

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

PY - 2004

Y1 - 2004

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

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

M3 - Article (Academic Journal)

SN - 1611-3349

VL - 3108

SP - 62

EP - 73

JO - Lecture Notes in Computer Science

JF - Lecture Notes in Computer Science

ER -

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

Abstract

Bibliographical note

Handle.net

Fingerprint

Cite this