Identification of data, devices, documents and individuals

The author mainly examines the information integrity aspects of the problem of identification, although some of the applications are primarily concerned with the physical aspects of identification. He is concerned with indirect identification, where the verifier (who may be either a person or a device) is dependent on information provided by the object of the identification (who again may be either a person or a device) and perhaps some supplemental information from another source. Aspects of the identification of individuals, devices, and documents are examined, with appropriate protocols given.<<ETX>>

[1]  Jean-Jacques Quisquater,et al.  A Practical Zero-Knowledge Protocol Fitted to Security Microprocessor Minimizing Both Transmission and Memory , 1988, EUROCRYPT.

[2]  Adi Shamir,et al.  How to share a secret , 1979, CACM.

[3]  Claus-Peter Schnorr,et al.  Signatures through Approximate Representation by Quadratic Forms , 1983, CRYPTO.

[4]  Adi Shamir,et al.  A method for obtaining digital signatures and public-key cryptosystems , 1978, CACM.

[5]  Gustavus J. Simmons A protocol to provide verifiable proof of identity and unforgeable transaction receipts , 1989, IEEE J. Sel. Areas Commun..

[6]  C. Pomerance Fast, Rigorous Factorization and Discrete Logarithm Algorithms , 1987 .

[7]  Gustavus J. Simmons,et al.  A survey of information authentication , 1988, Proc. IEEE.

[8]  J. Levine,et al.  The Hill cryptographic system with unknown cipher alphabet but known plaintext , 1984 .

[9]  P. D. Merillat Secure stand alone positive personnel identity verification system (SSA-PPIV) , 1979 .

[10]  Gustavus J. Simmons,et al.  The Smart Card: A Standardized Security Device Dedicated to Public Cryptology , 1992 .

[11]  Adi Shamir,et al.  An efficient signature scheme based on quadratic equations , 1984, STOC '84.

[12]  Samy Bengio,et al.  Special Uses and Abuses of the Fiat-Shamir Passport Protocol , 1987, CRYPTO.

[13]  Arjen K. Lenstra,et al.  Algorithms in Number Theory , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.

[14]  Gustavus J. Simmons,et al.  Forward Search as a Cryptanalytic Tool Against a Public Key , 1982, 1982 IEEE Symposium on Security and Privacy.

[15]  Amos Fiat,et al.  How to Prove Yourself: Practical Solutions to Identification and Signature Problems , 1986, CRYPTO.

[16]  Adi Shamir,et al.  Identity-Based Cryptosystems and Signature Schemes , 1984, CRYPTO.

[17]  Abraham Lempel,et al.  Compression of individual sequences via variable-rate coding , 1978, IEEE Trans. Inf. Theory.

[18]  E. Brickell,et al.  Cryptanalysis: a survey of recent results , 1988, Proc. IEEE.

[19]  H. Lenstra,et al.  Algorithms in algebraic number theory , 1992, math/9204234.

[20]  Gustavus J. Simmons,et al.  An Impersonation-Proof Identity Verfication Scheme , 1987, CRYPTO.

[21]  Gustavus J. Simmons,et al.  Zero-Knowledge Proofs of Identity And Veracity of Transaction Receipts , 1988, EUROCRYPT.

[22]  G. R. BLAKLEY Safeguarding cryptographic keys , 1979, 1979 International Workshop on Managing Requirements Knowledge (MARK).