Securely Obfuscating Re-encryption

  • Susan Hohenberger
  • Guy N. Rothblum
  • abhi shelat
  • Vinod Vaikuntanathan
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4392)

Abstract

We present the first positive obfuscation result for a traditional cryptographic functionality. This positive result stands in contrast to well-known negative impossibility results [BGI + 01] for general obfuscation and recent negative impossibility and improbability [GK05] results for obfuscation of many cryptographic functionalities.

Whereas other positive obfuscation results in the standard model apply to very simple point functions, our obfuscation result applies to the significantly more complicated and widely-used re-encryption functionality. This functionality takes a ciphertext for message m encrypted under Alice’s public key and transforms it into a ciphertext for the same message m under Bob’s public key.

To overcome impossibility results and to make our results meaningful for cryptographic functionalities, we use a new definition of obfuscation. This new definition incorporates more security-aware provisions.

Copyright information

© Springer Berlin Heidelberg 2007

Authors and Affiliations

  • Susan Hohenberger
    • 1
    • 2
  • Guy N. Rothblum
    • 3
  • abhi shelat
    • 2
  • Vinod Vaikuntanathan
    • 3
  1. 1.Johns Hopkins University 
  2. 2.IBM Zurich Research 
  3. 3.MIT CSAIL 

Personalised recommendations