Abhilasha Bhargav-Spantzel, Anna Squicciarini, Elisa Bertino
An emerging approach to the problem of reducing the identity theft is represented by the adoption of biometric authentication systems. Such systems however present however several challenges, related to privacy, reliability, security of the biometric data. Inter-operability is also required among the devices used for the authentication. Moreover, very often biometric authentication in itself is not sufficient as a conclusive proof of identity and has to be complemented with multiple other proofs of identity like passwords, SSN, or other user identifiers. Multi-factor authentication mechanisms are thus required to enforce strong authentication based on the biometric and identifiers of other nature.In this paper we provide a two-phase authentication mechanism for federated identity management systems. The first phase consists of a two-factor biometric authentication based on zero knowledge proofs. We employ techniques from vector-space model to generate cryptographic biometric keys. These keys are kept secret, thus preserving the confidentiality of the biometric data, and at the same time exploit the advantages of a biometric authentication. The second authentication combines several authentication factors in conjunction with the biometric to provide a strong authentication. A key advantage of our approach is that any unanticipated combination of factors can be used. Such authentication system leverages the information of the user that are available from the federated identity management system.
Biometric Identification and Security
User Authentication and Security Systems
Advanced Steganography and Watermarking Techniques
Because of the possibility of collusion attack,a powerful identification scheme which can guarantee the information be interviewed and drawn by authorized persons is proposed.By using ElGamal signature scheme combined with zero-knowledge proof scheme and Shamir secret sharing technique,a group-oriented identification scheme that consists of n confirmers is designed.Its security is also proved by analysis.
A zero-knowledge proof scheme of identity authentication based on ElGamal digital signature is proposed,across zero-knowledge proof and smart card technology,we authenticate the user's identity efficiently and secretly.The scheme is secure under the assumption of the intractability of logarithm problems and the random oracle model.
In this paper, we are concerned with a digital fingerprinting scheme for multi-purchase where a buyer wants to buy more than a digital content. If we apply previous schemes to multi-purchase protocol, the number of execution of registration step and decryption key should be increased in proportion to that of digital contents to be purchased in order to keep unlinkability. More worse, most of fingerprinting schemes in the literature are based on either secure multi-party computation or general zero-knowledge proofs with very high computational complexity. These high complexities complicate materialization of fingerprinting protocol more and more. In this paper, we propose a multi-purchase fingerprinting scheme with lower computational complexity. In the proposed scheme, a buyer executes just one-time registration step regardless of the number of contents to be purchased. The number of decryption key is constant and independent of the number of contents to be purchased. We can also reduce the computational costs of buyers by introducing a concept of proxy-based fingerprinting protocol.
Advanced Steganography and Watermarking Techniques
We suggest a systematic way to design secure password-based authentication protocols, which is the password verifier model. The method makes use of zero-knowledge interactive proof (ZKIP), which has been known not to be useful for the protection of passwords. For the proper usage of ZKIP, we introduce a specialized form of ZKIP, which has a secret coin tossing stage.
An interactive zero-knowledge proof based protocol of identification and digital signature is proposed in this paper. The security of protocol is based on large number factorization and security of RSA problems. This protocol can be applied to smart cards. This scheme requires minimal amount of computation and communications information. Compared with Nyang's scheme, the scheme is more likely to win higher security. The k , which is the cycle number in order to achieve zero-knowledge, is smaller than Nyang's. On one cycle, the highest security degree, which the protocol can achieve, is independent of the user's identity. The protocol is versatile enough to be applied to digital signature, multiple digital signature, and (N, T) threshold digital signature.