An XTR-based constant round key agreement scheme (Q474414): Difference between revisions

Summary: A new XTR-based key agreement scheme with constant rounds is presented. Three theorems are formulated to reveal the logarithmic computational complexity of this scheme. Furthermore, the computation framework of XTR-based key agreement scheme is introduced, and security of the scheme is proven under the formal model.

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1155/2013/596868

0 references

cites work

Information Security and Privacy

0 references

Constant-Round Authenticated Group Key Exchange with Logarithmic Computation Complexity

0 references

Q5491200

0 references

Q2739458

0 references

ID-based authenticated group key agreement from bilinear maps

0 references

A new two-round certificateless authenticated key agreement protocol without bilinear pairings

0 references

0 references

0 references

0 references

0 references

0 references

A round-optimal three-party ID-based authenticated key agreement protocol

0 references

Identifiers

zbMATH Open document ID

1299.94098

0 references

DOI

10.1155/2013/596868

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:474414

@@ Property / full work available at URL @@
+https://doi.org/10.1155/2013/596868
+Normal rank
@@ Property / OpenAlex ID @@
+W2079354678
@@ Property / OpenAlex ID: W2079354678 / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q59027099
@@ Property / Wikidata QID: Q59027099 / rank @@
+Normal rank
@@ Property / cites work @@
+Information Security and Privacy
@@ Property / cites work: Information Security and Privacy / rank @@
+Normal rank
@@ Property / cites work @@
+Constant-Round Authenticated Group Key Exchange with Logarithmic Computation Complexity
+Normal rank
@@ Property / cites work @@
+Q5491200
@@ Property / cites work: Q5491200 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2739458
@@ Property / cites work: Q2739458 / rank @@
+Normal rank
@@ Property / cites work @@
+ID-based authenticated group key agreement from bilinear maps
+Normal rank
@@ Property / cites work @@
+A new two-round certificateless authenticated key agreement protocol without bilinear pairings
+Normal rank
@@ Property / cites work @@
+Q4474181
@@ Property / cites work: Q4474181 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4536791
@@ Property / cites work: Q4536791 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2764241
@@ Property / cites work: Q2764241 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4474169
@@ Property / cites work: Q4474169 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2778850
@@ Property / cites work: Q2778850 / rank @@
+Normal rank
@@ Property / cites work @@
+A round-optimal three-party ID-based authenticated key agreement protocol
+Normal rank