Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Direct Anonymous Attestation DAA is one of the most complex cryptographic algorithms that has been deployed in practice. In spite of this and the long body of work on the subject, there is still no fully satisfactory security definition for DAA. This was already acknowledged by Bernard et al. IJIC'13 who shod that in existing models insecure protocols can be proved secure. Bernard et al. therefore proposed an extensive set of security games which, hover, aim only at a simplified setting termed pre-DAA. In pre-DAA, the host platform that runs the TPM is assumed to be trusted. Consequently, their notion does not guarantee any security if the TPM is embedded in a potentially corrupt host which is a significant restriction. ,  give a comprehensive security definition for full DAA in the form of an ideal functionality in the Universal Composability model. Our definition considers the host and TPM to be separate entities that can be in different corruption states. None of the existing DAA schemes satisfy our strong security notion.  therefore propose a realization that is based on a DAA scheme supported by the TPMi¾?2.0 standard and prove it secure in our model.
['Jan Camenisch', 'Manu Drijvers', 'Anja Lehmann']
I am writing a research paper on a idea Universally Composable Direct Anonymous Attestation
[{"from": "human", "value": "I am writing a research paper on a idea Universally Composable Direct Anonymous Attestation"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Direct Anonymous Attestation DAA is one of the most complex cryptographic algorithms that has been deployed in practice. In spite of this and the long body of work on the subject, there is still no fully satisfactory security definition for DAA. This was already acknowledged by Bernard et al. IJIC'13 who shod that in existing models insecure protocols can be proved secure. Bernard et al. therefore proposed an extensive set of security games which, hover, aim only at a simplified setting termed pre-DAA. In pre-DAA, the host platform that runs the TPM is assumed to be trusted. Consequently, their notion does not guarantee any security if the TPM is embedded in a potentially corrupt host which is a significant restriction. ,  give a comprehensive security definition for full DAA in the form of an ideal functionality in the Universal Composability model. Our definition considers the host and TPM to be separate entities that can be in different corruption states. None of the existing DAA schemes satisfy our strong security notion.  therefore propose a realization that is based on a DAA scheme supported by the TPMi\u00be?2.0 standard and prove it secure in our model."}]