A cartesian product construction for unconditionally secure authentication codes that permit arbitration
- 1 January 1990
- journal article
- Published by Springer Nature in Journal of Cryptology
- Vol. 2 (2) , 77-104
- https://doi.org/10.1007/bf00204449
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- A protocol to provide verifiable proof of identity and unforgeable transaction receiptsIEEE Journal on Selected Areas in Communications, 1989
- A Digital Signature Scheme Secure Against Adaptive Chosen-Message AttacksSIAM Journal on Computing, 1988
- A public key cryptosystem and a signature scheme based on discrete logarithmsIEEE Transactions on Information Theory, 1985
- A SYSTEM FOR VERIFYING USER IDENTITY AND AUTHORIZATION AT THE POINT-OF SALE OR ACCESSCryptologia, 1984
- A modification of the RSA public-key encryption procedure (Corresp.)IEEE Transactions on Information Theory, 1980
- Secure stand alone positive personnel identity verification system (SSA-PPIV)Published by Office of Scientific and Technical Information (OSTI) ,1979
- A method for obtaining digital signatures and public-key cryptosystemsCommunications of the ACM, 1978
- Codes Which Detect DeceptionBell System Technical Journal, 1974
- Finite nets. II. Uniqueness and imbeddingPacific Journal of Mathematics, 1963
- Finite Nets, I. Numerical InvariantsCanadian Journal of Mathematics, 1951