Random oracles are practical: a paradigm for designing efficient protocols
CCS '93 Proceedings of the 1st ACM conference on Computer and communications security
Strong password-only authenticated key exchange
ACM SIGCOMM Computer Communication Review
Elliptic Curve Based Password Authenticated Key Exchange Protocols
ACISP '01 Proceedings of the 6th Australasian Conference on Information Security and Privacy
Identity-Based Encryption from the Weil Pairing
CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
Toward Hierarchical Identity-Based Encryption
EUROCRYPT '02 Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques: Advances in Cryptology
Short Signatures from the Weil Pairing
ASIACRYPT '01 Proceedings of the 7th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Hierarchical ID-Based Cryptography
ASIACRYPT '02 Proceedings of the 8th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
ID-Based Blind Signature and Ring Signature from Pairings
ASIACRYPT '02 Proceedings of the 8th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
An Identity-Based Signature from Gap Diffie-Hellman Groups
PKC '03 Proceedings of the 6th International Workshop on Theory and Practice in Public Key Cryptography: Public Key Cryptography
PKC '03 Proceedings of the 6th International Workshop on Theory and Practice in Public Key Cryptography: Public Key Cryptography
The random oracle methodology, revisited
Journal of the ACM (JACM)
How to Hash into Elliptic Curves
CRYPTO '09 Proceedings of the 29th Annual International Cryptology Conference on Advances in Cryptology
Provably secure password-authenticated key exchange using Diffie-Hellman
EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
Aggregate and verifiably encrypted signatures from bilinear maps
EUROCRYPT'03 Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques
Estimating the size of the image of deterministic hash functions to elliptic curves
LATINCRYPT'10 Proceedings of the First international conference on Progress in cryptology: cryptology and information security in Latin America
Construction of rational points on elliptic curves over finite fields
ANTS'06 Proceedings of the 7th international conference on Algorithmic Number Theory
Merkle-Damgård revisited: how to construct a hash function
CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
An efficient CDH-based signature scheme with a tight security reduction
CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
Estimating the size of the image of deterministic hash functions to elliptic curves
LATINCRYPT'10 Proceedings of the First international conference on Progress in cryptology: cryptology and information security in Latin America
Deterministic encoding and hashing to odd hyperelliptic curves
Pairing'10 Proceedings of the 4th international conference on Pairing-based cryptography
Encoding points on hyperelliptic curves over finite fields in deterministic polynomial time
Pairing'10 Proceedings of the 4th international conference on Pairing-based cryptography
AFRICACRYPT'11 Proceedings of the 4th international conference on Progress in cryptology in Africa
Verifiable security of Boneh-Franklin identity-based encryption
ProvSec'11 Proceedings of the 5th international conference on Provable security
Non-interactive distributed encryption: a new primitive for revocable privacy
Proceedings of the 10th annual ACM workshop on Privacy in the electronic society
Verified indifferentiable hashing into elliptic curves
POST'12 Proceedings of the First international conference on Principles of Security and Trust
Indifferentiable hashing to barreto---naehrig curves
LATINCRYPT'12 Proceedings of the 2nd international conference on Cryptology and Information Security in Latin America
Proceedings of the 8th ACM SIGSAC symposium on Information, computer and communications security
Elligator: elliptic-curve points indistinguishable from uniform random strings
Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security
Verified indifferentiable hashing into elliptic curves
Journal of Computer Security - Security and Trust Principles
| Hi-index | 0.00 |
We provide the first construction of a hash function into ordinary elliptic curves that is indifferentiable from a random oracle, based on Icart's deterministic encoding from Crypto 2009. While almost as efficient as Icart's encoding, this hash function can be plugged into any cryptosystem that requires hashing into elliptic curves, while not compromising proofs of security in the random oracle model. We also describe a more general (but less efficient) construction that works for a large class of encodings into elliptic curves, for example the Shallue-Woestijne-Ulas (SWU) algorithm. Finally we describe the first deterministic encoding algorithm into elliptic curves in characteristic 3.