Search
 
loader loading subjects...
cover
Randomization Techniques for Secure Computation
Yuval Ishai
222 - 248
10.3233/978-1-61499-169-4-222
Cryptology and Information Security Series
Volume 10: Secure Multi-Party 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.

$35.00 / €27.50 / £22.00
Add PDF to cart