On the (Im)possibility of Obfuscating Programs
CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
Towards Realizing Random Oracles: Hash Functions That Hide All Partial Information
CRYPTO '97 Proceedings of the 17th Annual International Cryptology Conference on Advances in Cryptology
On the Security of Joint Signature and Encryption
EUROCRYPT '02 Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques: Advances in Cryptology
On obfuscating point functions
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
On the Impossibility of Obfuscation with Auxiliary Input
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
TCC '09 Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography
Fully homomorphic encryption using ideal lattices
Proceedings of the forty-first annual ACM symposium on Theory of computing
Obfuscation for Cryptographic Purposes
Journal of Cryptology
Securely obfuscating re-encryption
TCC'07 Proceedings of the 4th conference on Theory of cryptography
Obfuscating point functions with multibit output
EUROCRYPT'08 Proceedings of the theory and applications of cryptographic techniques 27th annual international conference on Advances in cryptology
Obfuscation of hyperplane membership
TCC'10 Proceedings of the 7th international conference on Theory of Cryptography
Secure obfuscation for encrypted signatures
EUROCRYPT'10 Proceedings of the 29th Annual international conference on Theory and Applications of Cryptographic Techniques
A note on (im)possibilities of obfuscating programs of zero-knowledge proofs of knowledge
CANS'11 Proceedings of the 10th international conference on Cryptology and Network Security
| Hi-index | 0.00 |
Obfuscating programs has been a fascinating area of theoretical cryptography in recent years. Hohenberger et al. in TCC'07 and Hada in EUROCRYPT'10 showed that re-encryption and encrypted signature are obfuscateable and their constructions are dedicated and the security proofs are complicated. Whereas, obfuscation for other complicated cryptographic functionalities still remains unknown. In a recent breakthrough on fully homomorphic encryption in STOC'09, Gentry noted that one algorithm in his construction, called Recrypt, is a re-encryption program. Along Gentry's sight, we observe that with fully homomorphic encryption, we can obfuscate a category of functionalities, including re-encryption and encrypted signature and even signature-then-encryption, which can be characterized as first secret operation and then public encryption. We formally demonstrate the obfuscation for this category of functionalities, in which the construction and security proof are general and simple. We then show the applicability of this obfuscation that it is secure in the contexts of the three functionalities.