Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Aln, Dodis and Wichs first formulated the security notions of identification ID schemes resilient to key-leakage attacks, which is called leakage-resilient ID schemes. In fact, the notions they considered are the so-called active security where the adversary is only allod to interact with the prover before the impersonation attempt. Hover, recently, there has been a huge emphasis on stronger attacks, such as man-in-the-middle MIM attacks. So can  extend the results about leakage-resilient ID schemes to man-in-the-middle security? Besides,  consider the setting where the adversary is allod to perform leakage attacks on the entire state of the honest prover during the lifetime of the system, which is called fullleakageattacks. Clearly, this type of leakage attacks is stronger and more meaningful than key-leakage attacks.#R##N##R##N#In conclusion,  study the design of ID schemes resilient to MIM attacks and fullyleakageattacks at the same time, which means that while attempting to impersonate a prover, the adversary can interact with an honest prover and obtain arbitrary bounded leakage on the entire state of the honest prover during the lifetime of the system. Informal speaking, an ID scheme secure against this type of attacks is said to be fullyleakage-resilientnon-malleable.#R##N##R##N#To obtain fully leakage-resilient non-malleable ID schemes,  propose two variants of the so-called Knowledge-of-Exponent Assumption $${\mathsf {KEA}}$$KEA over bilinear groups, called tag based Knowledge-of-Exponent Assumption $${\mathsf {TagKEA}}$$TagKEA and Selective-tag based Knowledge-of-Exponent Assumption $${\mathsf {Selective}}$$Selective-$${\mathsf {TagKEA}}$$TagKEA. To argue for believing in these two assumptions,  demonstrate that $${\mathsf {KEA}}$$KEA implies $${\mathsf {TagKEA}}$$TagKEA and is equivalent to $${\mathsf {Selective}}\text {-}{\mathsf {TagKEA}}$$Selective-TagKEA.
['Tingting Zhang', 'Hongda Li']
I am writing a research paper on a idea Fully Leakage-Resilient Non-malleable Identification Schemes in the Bounded-Retrieval Model
[{"from": "human", "value": "I am writing a research paper on a idea Fully Leakage-Resilient Non-malleable Identification Schemes in the Bounded-Retrieval Model"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Aln, Dodis and Wichs first formulated the security notions of identification ID schemes resilient to key-leakage attacks, which is called leakage-resilient ID schemes. In fact, the notions they considered are the so-called active security where the adversary is only allod to interact with the prover before the impersonation attempt. Hover, recently, there has been a huge emphasis on stronger attacks, such as man-in-the-middle MIM attacks. So can  extend the results about leakage-resilient ID schemes to man-in-the-middle security? Besides,  consider the setting where the adversary is allod to perform leakage attacks on the entire state of the honest prover during the lifetime of the system, which is called fullleakageattacks. Clearly, this type of leakage attacks is stronger and more meaningful than key-leakage attacks.#R##N##R##N#In conclusion,  study the design of ID schemes resilient to MIM attacks and fullyleakageattacks at the same time, which means that while attempting to impersonate a prover, the adversary can interact with an honest prover and obtain arbitrary bounded leakage on the entire state of the honest prover during the lifetime of the system. Informal speaking, an ID scheme secure against this type of attacks is said to be fullyleakage-resilientnon-malleable.#R##N##R##N#To obtain fully leakage-resilient non-malleable ID schemes,  propose two variants of the so-called Knowledge-of-Exponent Assumption $${\\mathsf {KEA}}$$KEA over bilinear groups, called tag based Knowledge-of-Exponent Assumption $${\\mathsf {TagKEA}}$$TagKEA and Selective-tag based Knowledge-of-Exponent Assumption $${\\mathsf {Selective}}$$Selective-$${\\mathsf {TagKEA}}$$TagKEA. To argue for believing in these two assumptions,  demonstrate that $${\\mathsf {KEA}}$$KEA implies $${\\mathsf {TagKEA}}$$TagKEA and is equivalent to $${\\mathsf {Selective}}\\text {-}{\\mathsf {TagKEA}}$$Selective-TagKEA."}]