Authentication theory/coding theory
Proceedings of CRYPTO 84 on Advances in cryptology
How to prove yourself: practical solutions to identification and signature problems
Proceedings on Advances in cryptology---CRYPTO '86
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)
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
A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
A2-code = Affine resolvable = BIBD
ICICS '97 Proceedings of the First International Conference on Information and Communication Security
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
Quantum Cryptanalysis of Hidden Linear Functions (Extended Abstract)
CRYPTO '95 Proceedings of the 15th Annual International Cryptology Conference on Advances in Cryptology
HAVAL - A One-Way Hashing Algorithm with Variable Length of Output
ASIACRYPT '92 Proceedings of the Workshop on the Theory and Application of Cryptographic Techniques: 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
RIPEMD-160: A Strengthened Version of RIPEMD
Proceedings of the Third International Workshop on Fast Software Encryption
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
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
PKC '02 Proceedings of the 5th International Workshop on Practice and Theory in Public Key Cryptosystems: Public Key Cryptography
ICITS '08 Proceedings of the 3rd international conference on Information Theoretic Security
How to Solve Consensus in the Smallest Window of Synchrony
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
Unconditionally secure signature schemes revisited
ICITS'11 Proceedings of the 5th international conference on Information theoretic security
Universally composable private proximity testing
ProvSec'11 Proceedings of the 5th international conference on Provable 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
An authentication code against pollution attacks in network coding
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.00 |
A potentially serious problem with current digital signature schemes is that their underlying hard problems from number theory may be solved by an innovative technique or a new generation of computing devices such as quantum computers. Therefore while these signature schemes represent an efficient solution to the short term integrity (unforgeability and non-repudiation) of digital data, they provide no confidence on the long term (say of 20 years) integrity of data signed by these schemes. In this work, we focus on signature schemes whose security does not rely on any unproven assumption. More specifically, we establish a model for unconditionally secure digital signatures in a group, and demonstrate practical schemes in that model. An added advantage of the schemes is that they allow unlimited transfer of signatures without compromising the security of the schemes. Our scheme represents the first unconditionally secure signature that admits provably secure transfer of signatures.