Randomization techniques for secure computation

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review


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 languageEnglish
Title of host publicationSecure Multi-Party Computation
Number of pages27
StatePublished - 2013

Publication series

NameCryptology and Information Security Series

All Science Journal Classification (ASJC) codes

  • Information Systems
  • Computer Science Applications
  • Electrical and Electronic Engineering


Dive into the research topics of 'Randomization techniques for secure computation'. Together they form a unique fingerprint.

Cite this