Efficient signature schemes with tight reductions to the Diffie-Hellman problems (Q2463446): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s00145-007-0549-3 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2012986054 / rank | |||
Normal rank | |||
Latest revision as of 23:52, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient signature schemes with tight reductions to the Diffie-Hellman problems |
scientific article |
Statements
Efficient signature schemes with tight reductions to the Diffie-Hellman problems (English)
0 references
6 December 2007
0 references
This paper presents an analysis of two efficient signature schemes whose security is tightly related to the Diffie-Hellman problems in the random oracle model. The technique is developed with sound theoretical details and it can be applied to a wide variety of settings to yield more efficient cryptographic schemes. No experiments are performed for illustration.
0 references
signature schemes
0 references
Diffie-Hellman assumption
0 references
discrete algorithm
0 references
efficient schemes
0 references
