About CS&CE
Prospective Students
Research
Staff
Dept Comp Sci & Comp Eng
Contact Details
La Trobe University
Victoria 3086
AUSTRALIA
Tel: +61 3 9479 1107
Fax: +61 3 9479 3060
Email: info
@cs.latrobe.edu.au
|
 |
Research Publications - Abstract
Department of Computer Science & Computer Engineering
|
Soh, B., and Saxena, Amitabh |
| Publication Year: |
2009 |
| Paper Title: |
A Cryptographic primitive based on hidden-order groups |
| Journal Name: |
Journal of Mathematical Gryptology |
| Volume: |
3, August 2009 |
| Pages: |
89 - 132 |
| Abstract: |
Let G1 be a cyclic multiplicative group of order n. It is known that the computational Diffie–Hellman (CDH) problem is random self-reducible in G1 if φ(n) is known. That is, given g, gx G1 for some generator g and oracle access to a “Diffie-Hellman Problem solver” for g, it is possible to compute g1/x G1 in polynomial time (with which we can then solve the CDH problem w.r.t. any other generator). On the other hand, it is not clear if such a reduction exists when φ(n) is unknown. We exploit this “gap” to construct a novel cryptographic primitive, which we call an Oracle-based Group with Infeasible Inversion (O-GII). O-GIIs have applications in multiparty protocols. We demonstrate this by presenting a novel Infeasible Inversion (O-GII). O-GIIs have applications in multiparty protocols. We demonstrate this by presenting a novel multi-party key agreement protocol that does not require interaction between the parties. Instead, the protocol requires each party to query a remote stateless device. Our method relies on the observation that it is considerably more each party to query a remote stateless device. Our method relies on the observation that it is considerably more stateless devices, some of which may be located in a more reliable sub-network.
|
|
|
