Verification of Treaty Compliance -- Revisited
SP '83 Proceedings of the 1983 IEEE Symposium on Security and Privacy
The practice of authentication
Proc. of a workshop on the theory and application of cryptographic techniques on Advances in cryptology---EUROCRYPT '85
Some constructions and bounds for authentication codes
Proceedings on Advances in cryptology---CRYPTO '86
Some constructions for authentication-secrecy codes
Lecture Notes in Computer Science on Advances in Cryptology-EUROCRYPT'88
Bounds and constructions for authentication-secrecy codes with splitting
CRYPTO '88 Proceedings on Advances in cryptology
Essentially ℓ -fold secure authentication systems
EUROCRYPT '90 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
On the relation between A-codes and codes correcting independent errors
EUROCRYPT '93 Workshop on the theory and application of cryptographic techniques on Advances in cryptology
Optimal authentication systems
EUROCRYPT '93 Workshop on the theory and application of cryptographic techniques on Advances in cryptology
Combinatorial Characterizations of Authentication Codes II
Designs, Codes and Cryptography
Authentication Codes in Plaintext and Chosen-Content Attacks
Designs, Codes and Cryptography - Special issue dedicated to Gustavus J. Simmons
Authentication Schemes, Perfect Local Randomizers, Perfect Secrecy and Secret Sharing Schemes
Designs, Codes and Cryptography - Special issue dedicated to Gustavus J. Simmons
Bounds and Characterizations of Authentication/SecrecySchemes
Designs, Codes and Cryptography
Bounds and Combinatorial Structure of (k,n)Multi-Receiver A-Codes
Designs, Codes and Cryptography
Multiround Unconditionally Secure Authentication
Designs, Codes and Cryptography
Combinatorial Bounds on Authentication Codes with Arbitration
Designs, Codes and Cryptography
Almost Independent and Weakly Biased Arrays: Efficient Constructions and Cryptologic Applications
CRYPTO '00 Proceedings of the 20th Annual International Cryptology Conference on Advances in Cryptology
On the Cost of Reconstructing a Secret, or VSS with Optimal Reconstruction Phase
CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
Unconditionally Secure Authentication Schemes and Practical and Theoretical Consequences
CRYPTO '85 Advances in Cryptology
A Natural Taxonomy for Digital Information Authentication Schemes
CRYPTO '87 A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology
A Construction for Authentication/Secrecy Codes from Certain Combinatorial Designs
CRYPTO '87 A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology
Combinatorial Characterizations of Authentication Codes
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
On the Construction of Perfect Authentication Codes that Permit Arbitration
CRYPTO '93 Proceedings of the 13th 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
LFSR-based Hashing and Authentication
CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
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
Fail-Stop Signature for Long Messages
INDOCRYPT '00 Proceedings of the First International Conference on Progress in Cryptology
Linear Authentication Codes: Bounds and Constructions
INDOCRYPT '01 Proceedings of the Second International Conference on Cryptology in India: Progress 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
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
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
Universal Hash Functions from Exponential Sums over Finite Fields and Galois Rings
CRYPTO '96 Proceedings of the 16th Annual International Cryptology Conference on Advances in Cryptology
Efficient multicast stream authentication using erasure codes
ACM Transactions on Information and System Security (TISSEC)
Cartesian authentication codes from functions with optimal nonlinearity
Theoretical Computer Science
Logarithm Cartesian authentication codes
Information and Computation
Constructions of difference covering arrays
Journal of Combinatorial Theory Series A
Three Constructions of Authentication Codes with Perfect Secrecy
Designs, Codes and Cryptography
A coding theory construction of new systematic authentication codes
Theoretical Computer Science - Insightful theory
A New Class of Optimal 3-splitting Authentication Codes
Designs, Codes and Cryptography
Trading Inversions for Multiplications in Elliptic Curve Cryptography
Designs, Codes and Cryptography
Authentication Schemes from Highly Nonlinear Functions
Designs, Codes and Cryptography
ICML '06 Proceedings of the 23rd international conference on Machine learning
GOB designs for authentication codes with arbitration
Designs, Codes and Cryptography
Some constructions of systematic authentication codes using galois rings
Designs, Codes and Cryptography
Unconditionally secure ring authentication
ASIACCS '07 Proceedings of the 2nd ACM symposium on Information, computer and communications security
Combinatorial characterizations of authentication codes in verification oracle model
ASIACCS '07 Proceedings of the 2nd ACM symposium on Information, computer and communications security
Subspaces in d-bounded distance-regular graphs and their applications
European Journal of Combinatorics
Authentication codes and bipartite graphs
European Journal of Combinatorics
Systematic authentication codes using additive polynomials
Designs, Codes and Cryptography
ICITS '08 Proceedings of the 3rd international conference on Information Theoretic Security
User-aided data authentication
International Journal of Security and Networks
New Family of Non-Cartesian Perfect Authentication Codes
IWCC '09 Proceedings of the 2nd International Workshop on Coding and Cryptology
Unconditionally Secure Approximate Message Authentication
IWCC '09 Proceedings of the 2nd International Workshop on Coding and Cryptology
Information Theoretic Security
Foundations and Trends in Communications and Information Theory
Authentication over noisy channels
IEEE Transactions on Information Theory
Authenticated error-correcting codes with applications to multicast authentication
ACM Transactions on Information and System Security (TISSEC)
Authentication and secrecy codes for equiprobable source probability distributions
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 2
A coding theorem for cheating-detectable (2, 2)-threshold blockwise secret sharing schemes
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 2
Commitment and authentication systems
Designs, Codes and Cryptography
Bucket hashing with a small key size
EUROCRYPT'97 Proceedings of the 16th annual international conference on Theory and application of cryptographic techniques
Information-theoretically secure secret-key agreement by NOT authenticated public discussion
EUROCRYPT'97 Proceedings of the 16th annual international conference on Theory and application of cryptographic techniques
Almost k-wise independent sample spaces and their cryptologic applications
EUROCRYPT'97 Proceedings of the 16th 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
Three constructions of authentication/secrecy codes
AAECC'03 Proceedings of the 15th international conference on Applied algebra, algebraic algorithms and error-correcting codes
On efficient message authentication via block cipher design techniques
ASIACRYPT'07 Proceedings of the Advances in Crypotology 13th international conference on Theory and application of cryptology and information security
Detection of algebraic manipulation with applications to robust secret sharing and fuzzy extractors
EUROCRYPT'08 Proceedings of the theory and applications of cryptographic techniques 27th annual international conference on Advances in cryptology
Combinatorial Designs for Authentication and Secrecy Codes
Foundations and Trends in Communications and Information Theory
Combinatorial bounds and characterizations of splitting authentication codes
Cryptography and Communications
Optimal authentication codes from difference balanced functions
SETA'10 Proceedings of the 6th international conference on Sequences and their applications
A class of authentication codes with secrecy
Designs, Codes and Cryptography
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
Tight bounds for unconditional authentication protocols in the manual channel and shared key models
CRYPTO'06 Proceedings of the 26th annual international conference on Advances in Cryptology
Information-theoretically secure key-insulated multireceiver authentication codes
AFRICACRYPT'10 Proceedings of the Third international conference on Cryptology in Africa
CT-RSA'07 Proceedings of the 7th Cryptographers' track at the RSA conference on Topics in Cryptology
Unconditionally secure information authentication in presence of erasures
IMA'05 Proceedings of the 10th international conference on Cryptography and Coding
WSEAS Transactions on Mathematics
Information-Theoretic timed-release security: key-agreement, encryption, and authentication codes
ICITS'12 Proceedings of the 6th international conference on Information Theoretic Security
Wireless Personal Communications: An International Journal
Hi-index | 0.06 |
We consider a communications scenario in which a transmitter attempts to inform a remote receiver of the state of a source by sending messages through an imperfect communications channel. There are two fundamentally different ways in which the receiver can end up being misinformed. The channel may be noisy so that symbols in the transmitted message can be received in error, or the channel may be under the control of an opponent who can either deliberately modify legitimate messages or else introduce fraudulent ones to deceive the receiver, i.e., what Wyner has called an "active wiretapper" [1]. The device by which the receiver improves his chances of detecting error (deception) is the same in either case: the deliberate introduction of redundant information into the transmitted message. The way in which this redundant information is introduced and used, though, is diametrically opposite in the two cases.For a statistically described noisy channel, coding theory is concerned with schemes (codes) that introduce redundancy in such a way that the most likely alterations to the encoded messages are in some sense close to the code they derive from. The receiver can then use a maximum likelihood detector to decide which (acceptable) message he should infer as having been transmitted from the (possibly altered) code that was received. In other words, the object in coding theory is to cluster the most likely alterations of an acceptable code as closely as possible (in an appropriate metric) to the code itself, and disjoint from the corresponding clusters about other acceptable codes.