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
Efficient identification and signatures for smart cards
EUROCRYPT '89 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
CRYPTO '89 Proceedings on Advances in cryptology
The random oracle methodology, revisited (preliminary version)
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Designs, Codes and Cryptography - Special issue on towards a quarter-century of public key cryptography
Short Signatures in the Random Oracle Model
ASIACRYPT '02 Proceedings of the 8th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Design Validations for Discrete Logarithm Based Signature Schemes
PKC '00 Proceedings of the Third International Workshop on Practice and Theory in Public Key Cryptography: Public Key Cryptography
Lower bounds for discrete logarithms and related problems
EUROCRYPT'97 Proceedings of the 16th annual 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
On the power of claw-free permutations
SCN'02 Proceedings of the 3rd international conference on Security in communication networks
Multi-signatures in the plain public-Key model and a general forking lemma
Proceedings of the 13th ACM conference on Computer and communications security
Forward-secure signatures in untrusted update environments: efficient and generic constructions
Proceedings of the 14th ACM conference on Computer and communications security
Trapdoors for hard lattices and new cryptographic constructions
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
A More Natural Way to Construct Identity-Based Identification Schemes
ACNS '07 Proceedings of the 5th international conference on Applied Cryptography and Network Security
Multisignatures Using Proofs of Secret Key Possession, as Secure as the Diffie-Hellman Problem
SCN '08 Proceedings of the 6th international conference on Security and Cryptography for Networks
A new framework for the design and analysis of identity-based identification schemes
Theoretical Computer Science
A variant of Boneh-Franklin IBE with a tight reduction in the random oracle model
Designs, Codes and Cryptography
Efficient Identity-Based Encryption with Tight Security Reduction
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Provably Secure Multisignatures in Formal Security Model and Their Optimality
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Identity-Based Encryptions with Tight Security Reductions to the BDH Problem
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Adaptive Security in Broadcast Encryption Systems (with Short Ciphertexts)
EUROCRYPT '09 Proceedings of the 28th Annual International Conference on Advances in Cryptology: the Theory and Applications of Cryptographic Techniques
EUROCRYPT '09 Proceedings of the 28th Annual International Conference on Advances in Cryptology: the Theory and Applications of Cryptographic Techniques
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
How to Prove Security of a Signature with a Tighter Security Reduction
ProvSec '09 Proceedings of the 3rd International Conference on Provable Security
Efficient discrete logarithm based multi-signature scheme in the plain public key model
Designs, Codes and Cryptography
ACISP'07 Proceedings of the 12th Australasian conference on Information security and privacy
Miniature CCA2 PK encryption: tight security without redundancy
ASIACRYPT'07 Proceedings of the Advances in Crypotology 13th international conference on Theory and application of cryptology and information security
Efficient sequential aggregate signed data
EUROCRYPT'08 Proceedings of the theory and applications of cryptographic techniques 27th annual international conference on Advances in cryptology
Proving tight security for Rabin-Williams signatures
EUROCRYPT'08 Proceedings of the theory and applications of cryptographic techniques 27th annual international conference on Advances in cryptology
Key Evolution Systems in Untrusted Update Environments
ACM Transactions on Information and System Security (TISSEC)
Zero-knowledge argument for simultaneous discrete logarithms
COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics
Improvement of a proxy multi-signature scheme without random oracles
Computer Communications
Threshold public-key encryption with adaptive security and short ciphertexts
ICICS'10 Proceedings of the 12th international conference on Information and communications security
How (Not) to design strong-RSA signatures
Designs, Codes and Cryptography
Generic methods to achieve tighter security reductions for a category of IBE schemes
ISPEC'11 Proceedings of the 7th international conference on Information security practice and experience
A signature scheme with efficient proof of validity
IWCC'11 Proceedings of the Third international conference on Coding and cryptology
Fully distributed broadcast encryption
ProvSec'11 Proceedings of the 5th international conference on Provable security
High-speed high-security signatures
CHES'11 Proceedings of the 13th international conference on Cryptographic hardware and embedded systems
Formal security model of multisignatures
ISC'06 Proceedings of the 9th international conference on Information Security
Another look at “provable security”. II
INDOCRYPT'06 Proceedings of the 7th international conference on Cryptology in India
Designated verifier signature schemes: attacks, new security notions and a new construction
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
A generic scheme based on trapdoor one-way permutations with signatures as short as possible
PKC'05 Proceedings of the 8th international conference on Theory and Practice in Public Key Cryptography
Optimal asymmetric encryption and signature paddings
ACNS'05 Proceedings of the Third international conference on Applied Cryptography and Network Security
Identity based encryption without redundancy
ACNS'05 Proceedings of the Third international conference on Applied Cryptography and Network Security
Improved signcryption from q-Diffie-Hellman problems
SCN'04 Proceedings of the 4th international conference on Security in Communication Networks
Communication-efficient non-interactive proofs of knowledge with online extractors
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
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
Practical identity-based encryption without random oracles
EUROCRYPT'06 Proceedings of the 24th annual international conference on The Theory and Applications of Cryptographic Techniques
Efficient identity-based encryption with tight security reduction
CANS'06 Proceedings of the 5th international conference on Cryptology and Network Security
A practical optimal padding for signature schemes
CT-RSA'07 Proceedings of the 7th Cryptographers' track at the RSA conference on Topics in Cryptology
A practical and tightly secure signature scheme without hash function
CT-RSA'07 Proceedings of the 7th Cryptographers' track at the RSA conference on Topics in Cryptology
Concrete security of the blum-blum-shub pseudorandom generator
IMA'05 Proceedings of the 10th international conference on Cryptography and Coding
A variant of schnorr identity-based identification scheme with tight reduction
FGIT'11 Proceedings of the Third international conference on Future Generation Information Technology
Random oracles in a quantum world
ASIACRYPT'11 Proceedings of the 17th international conference on The Theory and Application of Cryptology and Information Security
Cryptography and Security
SAC'11 Proceedings of the 18th international conference on Selected Areas in Cryptography
On the public indifferentiability and correlation intractability of the 6-round feistel construction
TCC'12 Proceedings of the 9th international conference on Theory of 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
Provably secure threshold public-key encryption with adaptive security and short ciphertexts
Information Sciences: an International Journal
Waters signatures with optimal security reduction
PKC'12 Proceedings of the 15th international conference on Practice and Theory in Public Key Cryptography
Non-delegatable strong designated verifier signature on elliptic curves
ICISC'11 Proceedings of the 14th international conference on Information Security and Cryptology
Unrestricted aggregate signatures
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Sequential aggregate signatures with lazy verification from trapdoor permutations
ASIACRYPT'12 Proceedings of the 18th international conference on The Theory and Application of Cryptology and Information Security
A robust and plaintext-aware variant of signed elgamal encryption
CT-RSA'13 Proceedings of the 13th international conference on Topics in Cryptology
Hi-index | 0.00 |
Much recent work has focused on constructing efficient digital signature schemes whose security is tightly related to the hardness of some underlying cryptographic assumption. With this motivation in mind, we show here two approaches which improve both the computational efficiency and signature length of some recently-proposed schemes:Diffie-Hellman signatures. Goh and Jarecki [18] recently analyzed a signature scheme which has a tight security reduction to the computational Diffie-Hellman problem. Unfortunately, their scheme is less efficient in both computation and bandwidth than previous schemes relying on the (related) discrete logarithm assumption. We present a modification of their scheme in which signing is 33% more efficient and signatures are 75% shorter; the security of this scheme is tightly related to the decisional Diffie-Hellman problem.PSS. The probabilistic signature scheme (PSS) designed by Bellare and Rogaway [3] uses a random salt to enable a tight security reduction to, e.g., the RSA problem. Coron [12] subsequently showed that a shorter random salt can be used without impacting the security of the scheme. We show a variant of PSS which avoids the random salt altogether yet has an equally-tight security reduction. This furthermore yields a version of PSS-R (PSS with message recovery) with optimal message length. Our technique may also be used to improve the efficiency of a number of other schemes.