On Indifferentiable Deterministic Hashing into Elliptic Curves
Keywords:
deterministic encodings, elliptic curves, random oracle, indifferentiable hashingAbstract
In this paper, we give new deterministic encodings based on Elligator`s model, for some families of elliptic curves. These encodings are almost-injective and easily invertible. This allows to make points in the image set of the encoding indistinguishable from uniform string of bits, which is useful for applications in censorship circumvention. Following the idea of Farashahi et al., we show that our encodings are well-distributed. And thus they give rise to hash functions constructions indifferentiable from random oracles.
Downloads
Published
Issue
Section
License
Copyright (c) 2017 European Journal of Pure and Applied Mathematics
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
Upon acceptance of an article by the journal, the author(s) accept(s) the transfer of copyright of the article to European Journal of Pure and Applied Mathematics.
European Journal of Pure and Applied Mathematics will be Copyright Holder.