articleMay 31, 2014Closed access

How to use indistinguishability obfuscation

ASAmit SahaiBWBrent Waters

UCLA Health · The University of Texas at Austin

Indexed incrossref

Abstract

We introduce a new technique, that we call punctured programs, to apply indistinguishability obfuscation towards cryptographic problems. We use this technique to carry out a systematic study of the applicability of indistinguishability obfuscation to a variety of cryptographic goals. Along the way, we resolve the 16-year-old open question of Deniable Encryption, posed by Canetti, Dwork, Naor, and Ostrovsky in 1997: In deniable encryption, a sender who is forced to reveal to an adversary both her message and the randomness she used for encrypting it should be able to convincingly provide "fake" randomness that can explain any alternative message that she would like to pretend that she sent. We resolve this…

Citation impact

621
total citations
FWCI
123.03
Percentile
100%
References
28
Citations per year

Authors

2

Topics & keywords

Topics
Keywords
  • Obfuscation
  • Encryption
  • Computer science
  • Cryptography
  • Computer security
  • Randomness
  • Adversary
  • Communication source
No related works found for this paper.

Funding