Name
Abstract | ||
|---|---|---|
The study presents a new efficient way to construct the one-round key exchange (ORKE) without random oracles based on standard hard complexity assumptions. The authors propose a (PKI-based) ORKE protocol which is more computational efficient than existing pairing-based ORKE protocols without random oracles in the post-specified peer setting. The core idea of this construction is to integrate the c... |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1049/iet-ifs.2016.0320 | IET Information Security |
Keywords | Field | DocType |
cryptography | Key exchange,Computer science,Pairing,Theoretical computer science,Ephemeral key,Public-key cryptography,Session key,Computer security model | Journal |
Volume | Issue | ISSN |
11 | 5 | 1751-8709 |
Citations | PageRank | References |
1 | 0.35 | 11 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| zheng yang | 1 | 25 | 8.02 |
| Junyu Lai | 2 | 6 | 2.56 |
| Wanping Liu | 3 | 52 | 8.13 |
| Chao Liu | 4 | 51 | 6.69 |
| Song Luo | 5 | 74 | 6.44 |