How to Compute in the Presence of Leakage
We address the following problem: how to execute any algorithm P, for an unbounded number of executions, in the presence of an adversary who observes partial information on the internal state of the computation during executions. The security guarantee is that the adversary learns nothing, beyond P&...
Main Authors: | Rothblum, Guy N. (Author), Goldwasser, Shafrira (Contributor) |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science (Contributor) |
Format: | Article |
Language: | English |
Published: |
Society for Industrial & Applied Mathematics (SIAM),
2018-05-17T18:42:43Z.
|
Subjects: | |
Online Access: | Get fulltext |
Similar Items
-
Securing computation against continuous leakage
by: Goldwasser, Shafi, et al.
Published: (2012) -
On Best-Possible Obfuscation
by: Goldwasser, Shafrira, et al.
Published: (2021) -
Population Stability: Regulating Size in the Presence of an Adversary
by: Goldwasser, Shafrira, et al.
Published: (2021) -
On Best-Possible Obfuscation
by: Goldwasser, Shafi, et al.
Published: (2014) -
Delegating computation reliably : paradigms and constructions
by: Rothblum, Guy N
Published: (2010)