Cryptology ePrint Archive: Report 2005/284

Foundations and Applications for Secure Triggers

Ariel Futoransky and Emiliano Kargieman and Carlos Sarraute and Ariel Waissbein

Abstract: Imagine there is certain content we want to maintain private until some particular event occurs, when we want to have it automatically disclosed. Suppose furthermore, that we want this done in a (possibly) malicious host. Say, the confidential content is a piece of code belonging to a computer program that should remain ciphered and then ``be triggered'' (i.e., deciphered and executed) when the underlying system satisfies a preselected condition which must remain secret after code inspection. In this work we present different solutions for problems of this sort, using different ``declassification'' criteria, based on a primitive we call {\em secure triggers}. We establish the notion of secure triggers in the universally-composable security framework of [Canetti~2001] and introduce several examples. Our examples demonstrate that a new sort of obfuscation is possible. Finally, we motivate its use with applications in realistic scenarios.

Category / Keywords: cryptographic protocols / Secure triggers, UC framework, malicious host problem, secure function evaluation.

Publication Info: The manuscript was presented in the rump sessions of Crypto 2005.

Date: received 23 Aug 2005

Contact author: ariel waissbein at coresecurity com

Available format(s): Postscript (PS) | Compressed Postscript (PS.GZ) | PDF | BibTeX Citation

Version: 20050825:074403 (All versions of this report)

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]