Authentication theory/coding theory
Proceedings of CRYPTO 84 on Advances in cryptology
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)
SIAM Journal on Computing
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
SIAM Journal on Computing
Further results on asymmetric authentication schemes
Information and Computation
Multireceiver authentication code4: models, bounds, constructions, and extensions
Information and Computation
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
New Bound on Authentication Code with Arbitration
CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
Quantum Cryptanalysis of Hidden Linear Functions (Extended Abstract)
CRYPTO '95 Proceedings of the 15th Annual International Cryptology Conference on 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
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
Message authentication with arbitration of transmitter/receiver disputes
EUROCRYPT'87 Proceedings of the 6th annual international conference on Theory and application of cryptographic techniques
Factorization of a 512-bit RSA modulus
EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
Security Notions for Unconditionally Secure Signature Schemes
EUROCRYPT '02 Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques: Advances in Cryptology
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
Unconditionally secure signature schemes revisited
ICITS'11 Proceedings of the 5th international conference on Information theoretic security
| Hi-index | 0.00 |
Digital signatures whose security does not rely on any unproven computational assumption have recently received considerable attention. While these unconditionally secure digital signatures provide a foundation for long term integrity and non-repudiation of data, currently known schemes generally require a far greater amount of memory space for the storage of users' secret information than a traditional digital signature. The focus of this paper is on methods for reducing memory requirements of unconditionally secure digital signatures. A major contribution of this paper is to propose two novel unconditionally secure digital signature schemes that have significantly shortened secret information for users. As a specific example, with a typical parameter setting the required memory size for a user is reduced to approximately 1/10 of that in previously known schemes. Another contribution of the paper is to demonstrate an attack on a multireceiver authentication code proposed by Safavi-Naini and Wang, and present a method to fix the problem of the code.