A New Cryptosystem Based On Hidden Order Groups
| dc.creator | Saxena, Amitabh | |
| dc.creator | Soh, Ben | |
| dc.date | 2006-04-30 | |
| dc.date | 2006-05-03 | |
| dc.date.accessioned | 2026-07-07T07:09:26Z | |
| dc.date.available | 2026-07-07T07:09:26Z | |
| dc.description | Let $G_1$ be a cyclic multiplicative group of order $n$. It is known that the Diffie-Hellman problem is random self-reducible in $G_1$ with respect to a fixed generator $g$ if $ϕ(n)$ is known. That is, given $g, g^x\in G_1$ and having oracle access to a `Diffie-Hellman Problem' solver with fixed generator $g$, it is possible to compute $g^{1/x} \in G_1$ in polynomial time (see theorem 3.2). On the other hand, it is not known if such a reduction exists when $ϕ(n)$ is unknown (see conjuncture 3.1). We exploit this ``gap'' to construct a cryptosystem based on hidden order groups and present a practical implementation of a novel cryptographic primitive called an \emph{Oracle Strong Associative One-Way Function} (O-SAOWF). O-SAOWFs have applications in multiparty protocols. We demonstrate this by presenting a key agreement protocol for dynamic ad-hoc groups. | |
| dc.description | removed examples for multiparty key agreement and join protocols, since they are redundant | |
| dc.identifier | https://arxiv.org/abs/cs/0605003 | |
| dc.identifier | http://arxiv.org/abs/cs/0605003 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/111064 | |
| dc.subject | Cryptography and Security | |
| dc.subject | Computational Complexity | |
| dc.title | A New Cryptosystem Based On Hidden Order Groups | |
| dc.type | text |