Efficient Indifferentiable Hashing into Ordinary Elliptic Curves
From MaRDI portal
Publication:3582757
DOI10.1007/978-3-642-14623-7_13zbMath1261.94025MaRDI QIDQ3582757
Mehdi Tibouchi, Éric Brier, Thomas Icart, Jean-Sébastien Coron, Hugues Randriambololona, David A. Madore
Publication date: 24 August 2010
Published in: Advances in Cryptology – CRYPTO 2010 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-14623-7_13
11T71: Algebraic coding theory; cryptography (number-theoretic aspects)
94A60: Cryptography
14H52: Elliptic curves
Related Items
Indifferentiable deterministic hashing to elliptic and hyperelliptic curves, On Indifferentiable Hashing into the Jacobian of Hyperelliptic Curves of Genus 2, Security Analysis of CPace, MuSig-L: lattice-based multi-signature with single-round online phase, Zero-knowledge for homomorphic key-value commitments with applications to privacy-preserving ledgers, \textsc{SwiftEC}: Shallue-van de Woestijne indifferentiable function to elliptic curves. Faster indifferentiable hashing to elliptic curves, Batching base oblivious transfers, How to sample a discrete Gaussian (and more) from a random oracle, Improved elliptic curve hashing and point representation, Uniform encodings to elliptic curves and indistinguishable point representation, A short non-delegatable strong designated verifier signature, Injective encodings to binary ordinary elliptic curves, Indifferentiable hashing to ordinary elliptic \(\mathbb{F}_{q} \)-curves of \(j=0\) with the cost of one exponentiation in \(\mathbb{F}_{q} \), Hashing to elliptic curves of \(j\)-invariant 1728, KHAPE: Asymmetric PAKE from key-hiding key exchange, Efficient hash maps to \(\mathbb{G}_2\) on BLS curves, Asymmetric PAKE with low computation \textit{and} communication, The most efficient indifferentiable hashing to elliptic curves of \(j\)-invariant 1728, Deterministic Encoding into Twisted Edwards Curves, Unnamed Item, Elligator Squared: Uniform Points on Elliptic Curves of Prime Order as Uniform Random Strings, NIZKs with an Untrusted CRS: Security in the Face of Parameter Subversion, Hashing into Hessian Curves, Verifiable Security of Boneh-Franklin Identity-Based Encryption, Unnamed Item, EMBEDDING FINITE FIELDS INTO ELLIPTIC CURVES, Decaf: Eliminating Cofactors Through Point Compression
Uses Software
