A remark concerning m-divisibility and the discrete logarithm in the divisor class group of curves
Mathematics of Computation
A new elliptic curve based analogue of RSA
EUROCRYPT '93 Workshop on the theory and application of cryptographic techniques on Advances in cryptology
A new public key cryptosystem based on higher residues
CCS '98 Proceedings of the 5th ACM conference on Computer and communications security
Designing and Detecting Trapdoors for Discrete Log Cryptosystems
CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on 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
Computation of Discrete Logarithms in F2607
ASIACRYPT '01 Proceedings of the 7th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
SAC '00 Proceedings of the 7th Annual International Workshop on Selected Areas in Cryptography
Advances in Elliptic Curve Cryptography (London Mathematical Society Lecture Note Series)
Advances in Elliptic Curve Cryptography (London Mathematical Society Lecture Note Series)
An Elliptic Curve Trapdoor System
Journal of Cryptology
Public-key cryptosystems based on composite degree residuosity classes
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Evaluating 2-DNF formulas on ciphertexts
TCC'05 Proceedings of the Second international conference on Theory of Cryptography
Pairings on elliptic curves over finite commutative rings
IMA'05 Proceedings of the 10th international conference on Cryptography and Coding
Elliptic curve cryptosystems using curves of smooth order over the ring Zn
IEEE Transactions on Information Theory
Designs, Codes and Cryptography
CT-RSA '09 Proceedings of the The Cryptographers' Track at the RSA Conference 2009 on Topics in Cryptology
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
Self-correctors for cryptographic modules
IMACC'11 Proceedings of the 13th IMA international conference on Cryptography and Coding
Efficient pairing computation on ordinary elliptic curves of embedding degree 1 and 2
IMACC'11 Proceedings of the 13th IMA international conference on Cryptography and Coding
A short non-delegatable strong designated verifier signature
ACISP'12 Proceedings of the 17th Australasian conference on Information Security and Privacy
Non-delegatable strong designated verifier signature on elliptic curves
ICISC'11 Proceedings of the 14th international conference on Information Security and Cryptology
Additively homomorphic encryption with a double decryption mechanism, revisited
ISC'12 Proceedings of the 15th international conference on Information Security
Deniability and forward secrecy of one-round authenticated key exchange
The Journal of Supercomputing
| Hi-index | 0.00 |
This paper suggests a new building block for cryptographic protocols and gives two instantiations of it. The concept is to generate two descriptions of the same group: a public description that allows a user to perform group operations, and a private description that allows a user to also compute a bilinear pairing on the group. A user who has the private information can therefore solve decisional Diffie-Hellman (DDH) problems, and potentially also discrete logarithm problems. Some cryptographic applications of this idea are given. Both instantiations are based on elliptic curves. The first relies on the factoring assumption for hiding the pairing. The second relies on the difficulty of solving a system of multivariate equations. The second method also potentially gives rise to a practical trapdoor discrete logarithm system.