Randomization techniques for secure computation

Yuval Ishai

doi:10.3233/978-1-61499-169-4-222

Randomization techniques for secure computation

Yuval Ishai

Computer Science

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

24 Scopus citations

Abstract

To what extent can a computation be made "simpler" by settling for computing a randomized encoding of the output? Originating from Yao's seminal idea of garbled circuits, answers to this question have found applications in cryptography and elsewhere. We will survey the state of the art on different flavors of this question that are motivated by different problems in secure computation and correspond to different notions of simplicity.

Original language	English
Title of host publication	Secure Multi-Party Computation
Pages	222-248
Number of pages	27
DOIs	https://doi.org/10.3233/978-1-61499-169-4-222
State	Published - 2013

Publication series

Name	Cryptology and Information Security Series
Volume	10
ISSN (Print)	1871-6431
ISSN (Electronic)	1879-8101

ASJC Scopus subject areas

Information Systems
Computer Science Applications
Electrical and Electronic Engineering

Access to Document

10.3233/978-1-61499-169-4-222

Cite this

@inbook{6bdd5ee6be9443ef847984a7b5a5bf28,

title = "Randomization techniques for secure computation",

abstract = "To what extent can a computation be made {"}simpler{"} by settling for computing a randomized encoding of the output? Originating from Yao's seminal idea of garbled circuits, answers to this question have found applications in cryptography and elsewhere. We will survey the state of the art on different flavors of this question that are motivated by different problems in secure computation and correspond to different notions of simplicity.",

author = "Yuval Ishai",

year = "2013",

doi = "10.3233/978-1-61499-169-4-222",

language = "אנגלית",

isbn = "9781614991687",

series = "Cryptology and Information Security Series",

pages = "222--248",

booktitle = "Secure Multi-Party Computation",

}

TY - CHAP

T1 - Randomization techniques for secure computation

AU - Ishai, Yuval

PY - 2013

Y1 - 2013

N2 - To what extent can a computation be made "simpler" by settling for computing a randomized encoding of the output? Originating from Yao's seminal idea of garbled circuits, answers to this question have found applications in cryptography and elsewhere. We will survey the state of the art on different flavors of this question that are motivated by different problems in secure computation and correspond to different notions of simplicity.

AB - To what extent can a computation be made "simpler" by settling for computing a randomized encoding of the output? Originating from Yao's seminal idea of garbled circuits, answers to this question have found applications in cryptography and elsewhere. We will survey the state of the art on different flavors of this question that are motivated by different problems in secure computation and correspond to different notions of simplicity.

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

U2 - 10.3233/978-1-61499-169-4-222

DO - 10.3233/978-1-61499-169-4-222

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.chapter???

AN - SCOPUS:84888171349

SN - 9781614991687

T3 - Cryptology and Information Security Series

SP - 222

EP - 248

BT - Secure Multi-Party Computation

ER -

Randomization techniques for secure computation

Abstract

Publication series

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this