نتایج جستجو برای: forgery
تعداد نتایج: 1967 فیلتر نتایج به سال:
The increasing trend of using e-versions document transmission and storage requires the electronic verification sender/author. This research presents an efficient robust online handwritten signature system targeting rates better than available state-of-the-art systems in presence skilled forgeries. Fourier analysis is employed on signatures to represent feature vectors higher dimensional space ...
The NTRU Signature Scheme (NSS) with enhanced document encoding and signature verification is described. Three areas of security are investigated: (1) It is proven (under a heuristic assumption) that direct forgery is equivalent to the solution of a closest vector problem, up to constant factor, in an NTRU convolution modular lattice. (2) The probability of forgery using partially preselected v...
LAC is one of the candidates to the CAESAR competition. In this paper we present a differential forgery attack on LAC. We study the collection of characteristics following a fixed truncated characteristic, in order to obtain a lower bound on the probability of a differential. We show that some differentials have a probability higher than 2−64, which allows a forgery attack on the full LAC. This...
We propose a new zero-knowledge undeniable signature scheme which is based on the intractability of computing high-order even powers modulo a composite. The new scheme has a number of desirable properties: (i) forgery of a signature (including existential forgery) is proven to be equivalent to factorisation, (ii) perfect zero-knowledge, (iii) e cient protocols for signature veri cation and nons...
In this paper, we improve an existing scheme of detecting the copy-move forgery. The main difference between our method and prior arts is that we seek spatial correlation in the test image. Our method has 4 stages. In the first stage, we segment test image. In second stage, we find the suspicious pairs and group them into suspicious groups by their spatial correlation, and then find a transform...
Techniques developed for synchronic text classification problems are applied to a significantly diachronic dataset. The scale of the temporal categories appears to matter. The problem addressed is that of using automated text classification methods to temporally locate The Donation of Constantine. The results reported do not contradict the analysis of Lorenzo Valla from 1440, claiming the docum...
The identity-based signature (IBS) scheme proposed by Sakai, Ohgishi and Kasahara in 2000, which we refer to as the SOK-IBS scheme, is the first pairing-based IBS scheme. Though most other existing IBS schemes, especially two modified SOK-IBS schemes, have already been proved secure recently, the security of the original SOKIBS scheme is still unclear. In this paper, we prove that the original ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید