نتایج جستجو برای: identification scheme
تعداد نتایج: 625502 فیلتر نتایج به سال:
In [KK], a new identification scheme based on the Gap Diffie-Hellman problem was proposed at SCIS 2002, and it is shown that the scheme is secure against active attacks under the Gap Diffie-Hellman Intractability Assumption. Paradoxically, this identification scheme is totally breakable under passive attacks. In this paper, we show that any adversary holding only public parameters of the scheme...
time-delay identification is one of the most important parameters in designing controllers. in the cases where the number of inputs and outputs in a system are more than one, this identification is of great concern. in this paper, a novel autocorrelation-based scheme for the state variable time-delay identification for multi-input multi-output (mimo) system has been presented. this method is ba...
There are three well-known identification schemes: Fiat-Shamir, GQ and Schnorr identification schemes. All of them are proven secure against passive or active attacks under number theoretic assumptions. However, the efficiencies of reductions in those proofs are not tight, since they need “rewinding.” We show an identification scheme IDKEA1. Although it needs four exchanges of messages and slig...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید