In recent years, DC microgrid has attracted considerable attention of the research community because of the wide usage of DC power-based appliances. However, the acceptance of DC microgrid by power utilities is still limited due to the issues associated with the development of a reliable protection scheme. The high magnitude of DC fault current, its rapid rate of rising and absence of zero cros...

This paper presents a three-move interactive identification scheme and proves it to be as secure as t h e discrete logarithm problem. This provably secure scheme is almost as efficient as t,he Schnorr identification scheme, while the Schnorr scheme is not provably secure. This paper also presents another practical identification scheme which is proven to be as secure as the factoring problem ar...

Most current security and authentication systems are based on personal biometrics. The problem is a major issue in the field of biometric systems. This due to use databases original Then biometrics will forever be lost if these attacked. Protecting privacy most important goal cancelable In order protect privacy, therefore, should non-invertible such way that no information can inverted from tem...

In this paper, a new identity-based identification scheme based on error-correcting codes is proposed. Two well known code-based schemes are combined : the signature scheme by Courtois, Finiasz and Sendrier and an identification scheme by Stern. A proof of security for the scheme in the Random Oracle

Cryptographic identification schemes allow a remote user to prove his/her identity to a verifier who holds some public information of the user, such as the user public key or identity. Most of the existing cryptographic identification schemes are based on number-theoretic hard problems such as Discrete Log and Factorization. This paper focuses on the design and analysis of identity based identi...

We introduce a new identification scheme based on the Gap Diffie-Hellman problem. Our identification scheme makes use of the fact that the computational Diffie-Hellman problem is hard in the additive group of points of an elliptic curve over a finite field, on the other hand, the decisional Diffie-Hellman problem is easy in the multiplicative group of the finite field mapped by a bilinear map. ...