نتایج جستجو برای: one time signature
تعداد نتایج: 3503131 فیلتر نتایج به سال:
A bstract Thermal partition functions for gravitational systems have traditionally been studied using Euclidean path integrals. But in signature the action suffers from conformal factor problem, which renders unbounded below. This makes it difficult to take formulation as fundamental. However, despite their familiar association with periodic imaginary time, thermal can also be described by real...
random number generation is one of the human abilities. it is proven that the sequence of random numbers generated by people do not follow full randomness criteria. these numbers produced by brain activity seem to be completely non stationary. in this paper, we show that there is a distinction between the random numbers generated by different people who provides the discrimination capability, a...
At Asiacrypt 2014, Hanser and Slamanig presented a structure-preserving signatures and prove its EUF-CMA security. Very recently, Fuchsbauer gave a very surprising attack to point out their claim is flawed by showing how to generate a valid existential forgery with overwhelming probability with 4 chosen-message queries for l = 2. However, we go further in this paper to show that the Hanser-Slam...
The sharp increase in smartphone malware has become one of the most serious security problems. Since the Android platform has taken the dominant position in smartphone popularity, the number of Android malware has grown correspondingly and represents critical threat to the smartphone users. This rise in malware is primarily attributable to the occurrence of variants of existing malware. A set o...
the rationale behind the present study is that particular learning strategies produce more effective results when applied together. the present study tried to investigate the efficiency of the semantic-context strategy alone with a technique called, keyword method. to clarify the point, the current study seeked to find answer to the following question: are the keyword and semantic-context metho...
McEliece is one of the oldest known public key cryptosystems, however it was not quite as successful as RSA. One main reason is that it is widely believed that code-based cryptosystems like McEliece do not allow practical digital signatures. Although X.M. Wang presented a code-based signature scheme in 1990, some authors find that it is not secure. Recently, T.Courtois et al. show a new way to ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید