Security of Signature Schemes in a Multi-User Setting

Authors:
Alfred Menezes;Nigel Smart
Affiliations:
Department of Combinatorics and Optimization, University of Waterloo, Canada ajmeneze@uwaterloo.ca;Department of Computer Science, University of Bristol, U.K. nigel@cs.bristol.ac.uk
Venue:
Designs, Codes and Cryptography
Year:
2004

Citing 14
Cited 10

A digital signature scheme secure against adaptive chosen-message attacks

SIAM Journal on Computing - Special issue on cryptography
Solving simultaneous modular equations of low degree

SIAM Journal on Computing - Special issue on cryptography
Authentication and authenticated key exchanges

Designs, Codes and Cryptography
Entity authentication and key distribution

CRYPTO '93 Proceedings of the 13th annual international cryptology conference on Advances in cryptology
Flaws in Applying Proof Methodologies to Signature Schemes

CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
A Simple and Secure Way to Show the Validity of Your Public Key

CRYPTO '87 A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology
A Practical Public Key Cryptosystem Provably Secure Against Adaptive Chosen Ciphertext Attack

CRYPTO '98 Proceedings of the 18th Annual International Cryptology Conference on Advances in Cryptology
Key Agreement Protocols and Their Security Analysis

Proceedings of the 6th IMA International Conference on Cryptography and Coding
DIGITALIZED SIGNATURES AND PUBLIC-KEY FUNCTIONS AS INTRACTABLE AS FACTORIZATION

DIGITALIZED SIGNATURES AND PUBLIC-KEY FUNCTIONS AS INTRACTABLE AS FACTORIZATION
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
Lower bounds for discrete logarithms and related problems

EUROCRYPT'97 Proceedings of the 16th annual international conference on Theory and application of cryptographic techniques
Proving in zero-knowledge that a number is the product of two safe primes

EUROCRYPT'99 Proceedings of the 17th 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
Public-key encryption in a multi-user setting: security proofs and improvements

EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques

A new signature scheme without random oracles

International Journal of Security and Networks
Research on anonymous signatures and group signatures

Computer Communications
Forgery of Provable Secure Short Signcryption Scheme

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Anonymous Signatures Revisited

ProvSec '09 Proceedings of the 3rd International Conference on Provable Security
A closer look at PKI: security and efficiency

PKC'07 Proceedings of the 10th international conference on Practice and theory in public-key cryptography
Key substitution in the symbolic analysis of cryptographic protocols

FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
How (Not) to design strong-RSA signatures

Designs, Codes and Cryptography
Completely non-malleable schemes

ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Another look at tightness

SAC'11 Proceedings of the 18th international conference on Selected Areas in Cryptography
How to achieve non-repudiation of origin with privacy protection in cloud computing

Journal of Computer and System Sciences

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper initiates the study of the security of signature schemes in the multi-user setting. We argue that the well-accepted notion of security for signature schemes, namely existential unforgeability against adaptive chosen-message attacks, is not adequate for the multi-user setting. We propose an extension of this security notion to the multi-user setting and show that signature schemes proven secure in the single-user setting can, under reasonable constraints, also be proven secure in the multi-user setting.