The gap-problems: A new class of problems for the security of cryptographic schemes
T Okamoto, D Pointcheval - … : 4th International Workshop on Practice and …, 2001 - Springer
T Okamoto, D Pointcheval
Public Key Cryptography: 4th International Workshop on Practice and Theory in …, 2001•SpringerThis paper introduces a novel class of computational problems, the gap problems, which
can be considered as a dual to the class of the decision problems. We show the relationship
among inverting problems, decision problems and gap problems. These problems find a
nice and rich practical instantiation with the Diffie-Hellman problems. Then, we see how the
gap problems find natural applications in cryptography, namely for proving the security of
very efficientsc hemes, but also for solving a more than 10-year old open security problem …
can be considered as a dual to the class of the decision problems. We show the relationship
among inverting problems, decision problems and gap problems. These problems find a
nice and rich practical instantiation with the Diffie-Hellman problems. Then, we see how the
gap problems find natural applications in cryptography, namely for proving the security of
very efficientsc hemes, but also for solving a more than 10-year old open security problem …
Abstract
This paper introduces a novel class of computational problems, the gap problems, which can be considered as a dual to the class of the decision problems. We show the relationship among inverting problems, decision problems and gap problems. These problems find a nice and rich practical instantiation with the Diffie-Hellman problems. Then, we see how the gap problems find natural applications in cryptography, namely for proving the security of very efficientsc hemes, but also for solving a more than 10-year old open security problem: the Chaum's undeniable signature.
Springer
以上显示的是最相近的搜索结果。 查看全部搜索结果