Timeline for Can we use Pohlig-Hellman Exponentiation Cipher with a PRG to achieve an oblivious PRF
Current License: CC BY-SA 4.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 25, 2018 at 14:56 | comment | added | SEJPM | @zetaprime I have expanded my explanations in the parameters section accordingly. | |
| Jul 25, 2018 at 14:55 | history | edited | SEJPM | CC BY-SA 4.0 |
addressed the questions from the comments
|
| Jul 25, 2018 at 11:25 | comment | added | SEJPM | @zetaprime yes, if you use $\mathbb Z_p$ as your group then the exponentiation is indeed standard exponentiation modulo $p$. The matter of how to instantiate $H(\cdot,\cdot)$ is a bit more complex and I'll address it later. | |
| Jul 24, 2018 at 23:01 | comment | added | zetaprime | I assume the exponentiation is simply the DH exponentiation with the same modulo p. However, I couldn't really understand the function H(.,.) with two arguments. Can I simply assume it's a hash with salt, which concatates the inputs given? | |
| Jul 24, 2018 at 12:37 | vote | accept | zetaprime | ||
| Jul 24, 2018 at 12:12 | history | answered | SEJPM | CC BY-SA 4.0 |