نتایج جستجو برای: identification scheme

تعداد نتایج: 625502  

2007
Julien Cathalo

Identification schemes are public-key cryptographic primitives that allow an entity (called the prover) to prove his or her identity to another entity. An identification scheme is secure if no attacker can impersonate the prover. Digital signature schemes allow an entity to produce a signature on a message; given the message and the signature, another entity can check the identity of the signer...

2004
Zeen Kim Kwangjo Kim

In this paper we construct a new interactive identification scheme based on the conjugacy problem. We prove that this scheme is secure against passive attacks if the matching triple search problem (MTSP) is intractable. Our proof is based on the fact that the conjugacy search problem (CSP) is hard in braid group, on the other hand, the conjugacy decision problem (CDP) is easy in braid group by ...

Journal: :CoRR 2010
Pierre-Louis Cayrel Pascal Véron

We revisit the 3-pass code-based identification scheme proposed by Stern at Crypto’93, and give a new 5-pass protocol for which the probability of the cheater is ≈ 1/2 (instead of 2/3 in the original Stern’s proposal). Furthermore, we propose to use quasi-cyclic construction in order to dramatically reduce the size of the public key. The proposed scheme is zero-knowledge and relies on an NPcomp...

2011
Sidi Mohamed El Yousfi Alaoui Pierre-Louis Cayrel Mohammed Meziani

In this paper, we present an improved version of an identity-based identification scheme based on error-correcting codes. Our scheme combines the Courtois-Finiasz-Sendrier signature scheme using quasi-dyadic codes (QD-CFS) proposed in [2] and the identification scheme by Stern [18]. Following the construction proposed in [5], we obtain an identity-based identification scheme which has the advan...

2004
Jih-Gau Juang

Nonlinear system identification using recurrent neural network with genetic algorithm is presented. A continuous-time model of Hopfield neural network is used in this study. Its convergence properties are first evaluated. Then the model is implemented to identify nonlinear systems. Recurrent network‘s operational factors of the system identification scheme are obtained by genetic algorithm. Mat...

Journal: :IACR Cryptology ePrint Archive 2013
Umar Mujahid M.Najam-ul-islam Jameel Ahmed Usman Mujahid Tieyan Li Hung-Min Sun Wei-Chih Ting

Radio frequency identification (RFID) technology is one of the most emerging technologies in the field of pervasive systems, which provides the automatic identification of the object with non-line of sight capability. RFID is much better than its contending identification scheme (Bar code) in terms of efficiency and functional haste. Although it offers many advantages over other identification ...

2009
Christoph Nagl Michael Hutter

One of the most important challenges in the last few years has been the integration of authentication services to low-cost RFID tags. Especially elliptic-curve-based implementations have proven to be a good option for asymmetric and light-weight cryptography. In this article, we evaluate two elliptic-curve based versions of the Schnorr and GPS identification schemes that have been designed for ...

Journal: :Inf. Process. Lett. 2005
Fangguo Zhang Xiaofeng Chen

An ad-hoc anonymous identification scheme is a new multiuser cryptographic primitive that allows participants from a user population to form ad hoc groups, and then prove membership anonymously in such groups. Recently, Nguyen [11] proposed an ID-based ad-hoc anonymous identification scheme from bilinear pairings. However, in this paper, we propose an attack on Nguyen’s ID-based ad-hoc anonymou...

2012
Atul Chaturvedi Varun Shukla Debiao He Sahadeo Padhye L. Law A. Menezes M. Qu J. Solinas

Identification protocols have an important role for building secure communications amongst two or more entities over the internet. In this paper we introduce a new identification scheme (or money transaction protocol) based on the elliptic curve Diffie Hellman problem. We show that our protocol meets the security attributes under the assumption that the elliptic curve discrete logarithm problem...

2005
Fangguo Zhang Xiaofeng Chen

An ad-hoc anonymous identification scheme is a new multiuser cryptographic primitive that allows participants from a user population to form ad hoc groups, and then prove membership anonymously in such groups. Recently, Nguyen [11] proposed an ID-based ad-hoc anonymous identification scheme from bilinear pairings. However, in this paper, we propose an attack on Nguyen’s ID-based ad-hoc anonymou...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید