Authentication Without Secrecy
- ISBN-10
- 0949269034
- ISBN-13
- 9780949269034
- Category
- Electronic surveillance
- Pages
- 11
- Language
- English
- Published
- 1985
- Authors
- Jennifer Seberry, Terry C. Jones
Get the book
Similar books
-
Combinatorial Designs for Authentication and Secrecy Codes
By Michael Huber[14, 177]): Is it possible to give combinatorial characterizations as well as constructions of optimal codes (with and without secrecy requirements)? We study authentication codes with splitting in this section. In such a code, ...
-
Advances in Cryptology: Proceedings of Crypto 83
By David ChaumAUTHENTICATION WITHOUT SECRECY Superficially, the problem resembles the "authentication without secrecy" problem discussed by the author in a series of earlier papers [1, 2, 3]. While it is true that the prisoners (transmitter/receiver) ...
-
Advances in Cryptology – EUROCRYPT '85: Proceedings of a Workshop on the Theory and Application of Cryptographic Techniques. Linz, Austria,...
By Franz PichlerWe first note that the total effective equivocation to the opponent playing the substitution game but without knowledge of the source state, i.e., authentication with secrecy, is no greater than H(E|M) and as remarked earlier, ...
-
Authentication Codes and Combinatorial Designs
By Dingyi Peibetween different units in a military organization often need both secrecy and authentication. Let us look at an example of authentication without secrecy. A company that owns a lot of parking meters has an employee who collects the ...
-
Surveys in Combinatorics, 1993
By K. WalkerAuthentication codes with splitting The term splitting refers to the situation where there can be more than one ... In the case of authentication without secrecy, it can be shown that Pd, Z 1/ [Al for 0 3 i 3 t (see, for example, [63]).
-
Sequences and Their Applications - SETA 2010: 6th International Conference, Paris, France, September 13-17, 2010. Proceedings
By Claude Carlet, Alexander PottIn this paper, we present two classes of optimal authentication codes without secrecy from difference balanced functions. The new codes are as good as or have more flexible parameters than the optimal codes from perfect nonlinear ...
-
Advances in Cryptology - CRYPTO '87: Proceedings
By Carl PomeranceSince we wish to use the problem of authenticating seismic data to verify compliance with a comprehensive nuclear weapons test ... The obvious solution to the authentication without secrecy problem exploits the authentication channel.
-
Cryptography and Security in Computing
By Jaydip Sennot necessary the secrecy. This part corresponds to the area of Authentication Without Secrecy (or AWS). An authentication code without secrecy is a code where an observed message can correspond to a unique source state.
-
Algorithms and Theory of Computation Handbook - 2 Volume Set
By Mikhail J. Atallah, Marina BlantonTraditionally, it was assumed that a secrecy system provides authentication by the virtue of the secret key being only known to the intended ... Similarly, a system can provide perfect authentication without concealing messages.
-
CRC Handbook of Combinatorial Designs
By Charles J. ColbournAuthentication without Secrecy The three participants are again Alice , Bob , and Oscar . Suppose that Oscar has the ability to introduce his own messages into the channel and / or to modify existing messages .