Foundations and applications for secure triggers

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 progr...

Descripción completa

Guardado en:

Detalles Bibliográficos
Publicado:	2006
Materias:	Malicious host problem Mobile code security Obfuscation Secure triggers Universally composable security Codes (symbols) Computer programming Problem solving System Security Security of data
Acceso en línea:	https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_10949224_v9_n1_p94_Futoransky http://hdl.handle.net/20.500.12110/paper_10949224_v9_n1_p94_Futoransky
Aporte de:	Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA) de Universidad de Buenos Aires

id	paper:paper_10949224_v9_n1_p94_Futoransky
record_format	dspace
spelling	paper:paper_10949224_v9_n1_p94_Futoransky2023-06-08T16:06:58Z Foundations and applications for secure triggers Malicious host problem Mobile code security Obfuscation Secure triggers Universally composable security Codes (symbols) Computer programming Problem solving Malicious host problem Mobile code security Obfuscation System Security Universally composable security Security of data 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 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. © 2006 ACM. 2006 https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_10949224_v9_n1_p94_Futoransky http://hdl.handle.net/20.500.12110/paper_10949224_v9_n1_p94_Futoransky
institution	Universidad de Buenos Aires
institution_str	I-28
repository_str	R-134
collection	Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA)
topic	Malicious host problem Mobile code security Obfuscation Secure triggers Universally composable security Codes (symbols) Computer programming Problem solving Malicious host problem Mobile code security Obfuscation System Security Universally composable security Security of data
spellingShingle	Malicious host problem Mobile code security Obfuscation Secure triggers Universally composable security Codes (symbols) Computer programming Problem solving Malicious host problem Mobile code security Obfuscation System Security Universally composable security Security of data Foundations and applications for secure triggers
topic_facet	Malicious host problem Mobile code security Obfuscation Secure triggers Universally composable security Codes (symbols) Computer programming Problem solving Malicious host problem Mobile code security Obfuscation System Security Universally composable security Security of data
description	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 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. © 2006 ACM.
title	Foundations and applications for secure triggers
title_short	Foundations and applications for secure triggers
title_full	Foundations and applications for secure triggers
title_fullStr	Foundations and applications for secure triggers
title_full_unstemmed	Foundations and applications for secure triggers
title_sort	foundations and applications for secure triggers
publishDate	2006
url	https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_10949224_v9_n1_p94_Futoransky http://hdl.handle.net/20.500.12110/paper_10949224_v9_n1_p94_Futoransky
_version_	1768546172709896192

Foundations and applications for secure triggers

Ejemplares similares