Authentication theory/coding theory
Proceedings of CRYPTO 84 on Advances in cryptology
A digital signature scheme secure against adaptive chosen-message attacks
SIAM Journal on Computing - Special issue on cryptography
Authentication codes with multiple arbiters
Lecture Notes in Computer Science on Advances in Cryptology-EUROCRYPT'88
Multi-receiver/multi-sender network security: efficient authenticated multicast/feedback
IEEE INFOCOM '92 Proceedings of the eleventh annual joint conference of the IEEE computer and communications societies on One world through communications (Vol. 3)
CCS '93 Proceedings of the 1st ACM conference on Computer and communications security
Further results on asymmetric authentication schemes
Information and Computation
Multireceiver authentication code4: models, bounds, constructions, and extensions
Information and Computation
Signature schemes based on the strong RSA assumption
CCS '99 Proceedings of the 6th ACM conference on Computer and communications security
A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
CRYPTO '90 Proceedings of the 10th Annual International Cryptology Conference on Advances in Cryptology
Unconditionally Secure Digital Signatures
CRYPTO '90 Proceedings of the 10th Annual International Cryptology Conference on Advances in Cryptology
Cryptographically Strong Undeniable Signatures, Unconditionally Secure for the Signer
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
New Bound on Authentication Code with Arbitration
CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
Bounds and Constructions for Multireceiver Authentication Codes
ASIACRYPT '98 Proceedings of the International Conference on the Theory and Applications of Cryptology and Information Security: Advances in Cryptology
A3-Codes under Collusion Attacks
ASIACRYPT '99 Proceedings of the International Conference on the Theory and Applications of Cryptology and Information Security: Advances in Cryptology
Broadcast Authentication in Group Communication
ASIACRYPT '99 Proceedings of the International Conference on the Theory and Applications of Cryptology and Information Security: Advances in Cryptology
A Signature Scheme with Message Recovery as Secure as Discrete Logarithm
ASIACRYPT '99 Proceedings of the International Conference on the Theory and Applications of Cryptology and Information Security: Advances in Cryptology
Unconditionally Secure Digital Signature Schemes Admitting Transferability
ASIACRYPT '00 Proceedings of the 6th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
PKC '02 Proceedings of the 5th International Workshop on Practice and Theory in Public Key Cryptosystems: Public Key Cryptography
CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
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
Combinatorial bounds for authentication codes with arbitration
EUROCRYPT'95 Proceedings of the 14th annual international conference on Theory and application of cryptographic techniques
Message authentication with arbitration of transmitter/receiver disputes
EUROCRYPT'87 Proceedings of the 6th 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
Unconditionally Secure Anonymous Encryption and Group Authentication
ASIACRYPT '02 Proceedings of the 8th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
ICITS '08 Proceedings of the 3rd international conference on Information Theoretic Security
Unconditionally Secure Blind Authentication Codes: The Model, Constructions, and Links to Commitment
Formal to Practical Security
Efficient Byzantine agreement with faulty minority
ASIACRYPT'07 Proceedings of the Advances in Crypotology 13th international conference on Theory and application of cryptology and information security
Unconditionally secure signature schemes revisited
ICITS'11 Proceedings of the 5th international conference on Information theoretic security
Unconditionally secure chaffing-and-winnowing: a relationship between encryption and authentication
AAECC'06 Proceedings of the 16th international conference on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Symmetric authentication codes with secrecy and unconditionally secure authenticated encryption
INDOCRYPT'04 Proceedings of the 5th international conference on Cryptology in India
Information-theoretically secure key-insulated multireceiver authentication codes
AFRICACRYPT'10 Proceedings of the Third international conference on Cryptology in Africa
| Hi-index | 0.00 |
This paper focuses on notions for the security of digital signature schemes whose resistance against forgery is not dependent on unproven computational assumptions. We establish successfully a sound and strong notion for such signature schemes. We arrive at the sound notion by examining carefully the more established security notions for digital signatures based on public-key cryptography, and taking into account desirable requirements of signature schemes in the unconditional security setting. We also reveal an interesting relation among relevant security notions which have appeared in the unconditionally setting, and significantly, prove that our new security notion is the strongest among all those for unconditionally secure authentication and signature schemes known to date. Furthermore, we show that our security notion encompasses that for public-key signature schemes, namely, existential unforgeability under adaptive chosen-message attack. Finally we propose a construction method for signature schemes that are provably secure in our strong security notion.