Use of elliptic curves in cryptography
Lecture notes in computer sciences; 218 on Advances in cryptology---CRYPTO 85
How to prove yourself: practical solutions to identification and signature problems
Proceedings on Advances in cryptology---CRYPTO '86
A digital signature scheme secure against adaptive chosen-message attacks
SIAM Journal on Computing - Special issue on cryptography
An identity-based identification scheme based on discrete logarithms modulo a composite number
EUROCRYPT '90 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
Random oracles are practical: a paradigm for designing efficient protocols
CCS '93 Proceedings of the 1st ACM conference on Computer and communications security
On the fly signatures based on factoring
CCS '99 Proceedings of the 6th ACM conference on Computer and communications security
Elliptic curves in cryptography
Elliptic curves in cryptography
Signature schemes based on the strong RSA assumption
ACM Transactions on Information and System Security (TISSEC)
A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
Improved Online/Offline Signature Schemes
CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
Wallet Databases with Observers
CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
Optimal Security Proofs for PSS and Other Signature Schemes
EUROCRYPT '02 Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques: Advances in Cryptology
Efficient Oblivious Proofs of Correct Exponentiation
CMS '99 Proceedings of the IFIP TC6/TC11 Joint Working Conference on Secure Information Networks: Communications and Multimedia Security
DIGITALIZED SIGNATURES AND PUBLIC-KEY FUNCTIONS AS INTRACTABLE AS FACTORIZATION
DIGITALIZED SIGNATURES AND PUBLIC-KEY FUNCTIONS AS INTRACTABLE AS FACTORIZATION
Efficiency improvements for signature schemes with tight security reductions
Proceedings of the 10th ACM conference on Computer and communications security
Short Signatures from the Weil Pairing
Journal of Cryptology
A "Paradoxical" Solution To The Signature Problem
SFCS '84 Proceedings of the 25th Annual Symposium onFoundations of Computer Science, 1984
Security proofs for signature schemes
EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques
The exact security of digital signatures-how to sign with RSA and Rabin
EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques
Secure hash-and-sign signatures without the random oracle
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
A signature scheme as secure as the Diffie-Hellman problem
EUROCRYPT'03 Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques
An efficient CDH-based signature scheme with a tight security reduction
CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
On the Security of Tag-KEM for Signcryption
Electronic Notes in Theoretical Computer Science (ENTCS)
Identity-Based Encryptions with Tight Security Reductions to the BDH Problem
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Multisignatures as Secure as the Diffie-Hellman Problem in the Plain Public-Key Model
Pairing '09 Proceedings of the 3rd International Conference Palo Alto on Pairing-Based Cryptography
ACISP'07 Proceedings of the 12th Australasian conference on Information security and privacy
Efficient indifferentiable hashing into ordinary elliptic curves
CRYPTO'10 Proceedings of the 30th annual conference on Advances in cryptology
Zero-knowledge argument for simultaneous discrete logarithms
COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics
A signature scheme with efficient proof of validity
IWCC'11 Proceedings of the Third international conference on Coding and 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
How to generate universally verifiable signatures in ad-hoc networks
MADNES'05 Proceedings of the First international conference on Secure Mobile Ad-hoc Networks and Sensors
Building better signcryption schemes with Tag-KEMs
PKC'06 Proceedings of the 9th international conference on Theory and Practice of Public-Key Cryptography
On the exact security of schnorr-type signatures in the random oracle model
EUROCRYPT'12 Proceedings of the 31st Annual international conference on Theory and Applications of Cryptographic Techniques
Tightly-Secure signatures from lossy identification schemes
EUROCRYPT'12 Proceedings of the 31st Annual international conference on Theory and Applications of Cryptographic Techniques
Indifferentiable hashing to barreto---naehrig curves
LATINCRYPT'12 Proceedings of the 2nd international conference on Cryptology and Information Security in Latin America
Exposure-resilient one-round tripartite key exchange without random oracles
ACNS'13 Proceedings of the 11th international conference on Applied Cryptography and Network Security
Hi-index | 0.00 |
At Eurocrypt '03, Goh and Jarecki showed that, contrary to other signature schemes in the discrete-log setting, the EDL signature scheme has a tight security reduction, namely to the Computational Diffie-Hellman (CDH) problem, in the Random Oracle (RO) model. They also remarked that EDL can be turned into an off-line/on-line signature scheme using the technique of Shamir and Tauman, based on chameleon hash functions. In this paper, we propose a new signature scheme that also has a tight security reduction to CDH but whose resulting signatures are smaller than EDL signatures. Further, similarly to the Schnorr signature scheme (but contrary to EDL), our signature is naturally efficient on-line: no additional trick is needed for the off-line phase and the verification process is unchanged. For example, in elliptic curve groups, our scheme results in a 25% improvement on the state-of-the-art discrete-log based schemes, with the same security level. This represents to date the most efficient scheme of any signature scheme with a tight security reduction in the discrete-log setting.