A one round protocol for tripartite Diffie-Hellman (Q1772225): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / Wikidata QID | |||
Property / Wikidata QID: Q55952480 / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/s00145-004-0312-y / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1998368731 / rank | |||
Normal rank |
Latest revision as of 23:02, 19 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A one round protocol for tripartite Diffie-Hellman |
scientific article |
Statements
A one round protocol for tripartite Diffie-Hellman (English)
0 references
15 April 2005
0 references
The paper studies an analog of the Diffie-Hellman protocol that involves three participants, A, B and C. It requires a single pass of communication and allows a common secret to be constructed. The main idea is to start from some elliptic curve and some torsion point. Then A, B and C each choose a random number and respectively use this number to compute a point from the torsion point. These points will be broadcasted. Then each participant computes a value from the three points. It is shown that there are various ways to compute this value, using the Weil and Tate pairing. For the tripartite Diffie-Hellman to be efficient, it is shown how to choose a finite field and an elliptic curve such that the chosen pairing can be efficiently computed. Finally, the security issue is addressed.
0 references
cryptosystem
0 references
key exchange
0 references
discrete logarithm
0 references
elliptic curve
0 references
pairing
0 references