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
Key storage in secure networks
Discrete Applied Mathematics
The dining cryptographers problem: unconditional sender and recipient untraceability
Journal of Cryptology
One-way functions are necessary and sufficient for secure signatures
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
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)
On Some Methods for Unconditionally Secure Key Distributionand Broadcast Encryption
Designs, Codes and Cryptography - Special issue: selected areas in cryptography I
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
SIAM Journal on Computing
Perfectly secure key distribution for dynamic conferences
Information and Computation
Some New Results on Key Distribution Patterns and BroadcastEncryption
Designs, Codes and Cryptography
Broadcast anti-jamming systems
Computer Networks: The International Journal of Computer and Telecommunications Networking
Characterisation of (k, n) Multi-receiver Authentication
ACISP '97 Proceedings of the Second Australasian Conference on Information Security and Privacy
Multisender authentication systems with unconditional security
ICICS '97 Proceedings of the First International Conference on Information and Communication Security
CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
Software-optimized universal hashing and message authentication
Software-optimized universal hashing and message authentication
Proceedings of the 11th ACM conference on Computer and communications security
A coding theory construction of new systematic authentication codes
Theoretical Computer Science - Insightful theory
Towards an information theoretic metric for anonymity
PET'02 Proceedings of the 2nd international conference on Privacy enhancing technologies
EUROCRYPT'03 Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques
Efficient secure group signatures with dynamic joins and keeping anonymity against group managers
Mycrypt'05 Proceedings of the 1st international conference on Progress in Cryptology in Malaysia
Non-interactive conference key distribution and its applications
Proceedings of the 2008 ACM symposium on Information, computer and communications security
| Hi-index | 0.00 |
We propose ring authentication in unconditionally secure setting. In a ring authentication system a sender can choose a set of users and construct an authenticated message for a receiver such that the receiver can verify authenticity of the message with respect to the user group chosen by the real sender. The sender will be unconditionally secure even if the receiver has corrupted up to c users and has access to up to ℓ past messages in the system. This functionality is similar to the one provided by ring signature systems with the difference that protection is against an adversary with unlimited power. (This also implies that the verification is not public and is by group members.) In ring signatures an adversary with unlimited computational power can always forge signed messages attributing them to groups of his choice. In our proposed systems the success chance of the adversary can be reduced to the required security of the system. We define model, propose a generic construction whose security is reduced to the security of its building blocks, and give concrete examples of this construction. The construction can also be used in computational setting resulting in ring authentication systems without public key cryptography.