Name
Abstract | ||
|---|---|---|
We propose a Diffie-Hellman-like key agreement protocol based on the computational intractability of reversing group action. The concept of a group action generalizes exponentiation and provides an algorithmic problem harder than the discrete logarithm problem. Using the action of the general linear group on the direct product of two cyclic groups, we invent a key agreement protocol secure against an attacker who has power to solve the discrete logarithm problem. We discuss a semantic secure asymmetric encryption scheme as well. Its security is evaluated in terms of a generic algorithm, which is a model of probabilistic algorithms over black box groups (similar to a straight-line program) and does not depend on any specific property of the group representation. |
Year | DOI | Venue |
|---|---|---|
2001 | 10.1007/3-540-45678-3_19 | ISAAC |
Keywords | Field | DocType |
key agreement protocol,black box group,cyclic group,group action,group actions,algorithmic problem,discrete logarithm problem,group action generalizes exponentiation,diffie-hellman-like key agreement protocol,generic algorithms,group representation,key agreement,general linear group,direct product,diffie hellman,generic algorithm,semantic security,probabilistic algorithm,it security | Discrete mathematics,Group representation,XTR,Cryptography,Computer science,Baby-step giant-step,Algorithm,Key-agreement protocol,Exponentiation,Public-key cryptography,Distributed computing,Discrete logarithm | Conference |
Volume | ISSN | ISBN |
2223 | 0302-9743 | 3-540-42985-9 |
Citations | PageRank | References |
2 | 0.40 | 8 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Akihiro Yamamura | 1 | 96 | 13.29 |
| Kaoru Kurosawa | 2 | 2372 | 197.90 |