Signature barcodes for online verification

2021 ◽  
pp. 108426
Author(s):  
Orcan Alpar
Keyword(s):  
Author(s):  
JINHONG KATHERINE GUO ◽  
DAVID DOERMANN ◽  
AZRIEL ROSENFELD

Signatures may be stylish or unconventional and have many personal characteristics that are challenging to reproduce by anyone other than the original author. For this reason, signatures are used and accepted as proof of authorship or consent on personal checks, credit purchases and legal documents. Currently signatures are verified only informally in many environments, but the rapid development of computer technology has stimulated great interest in research on automated signature verification and forgery detection. In this paper, we focus on forgery detection of offline signatures. Although a great deal of work has been done on offline signature verification over the past two decades, the field is not as mature as online verification. Temporal information used in online verification is not available offline and the subtle details necessary for offline verification are embedded at the stroke level and are hard to recover robustly. We approach the offline problem by establishing a local correspondence between a model and a questioned signature. The questioned signature is segmented into consecutive stroke segments that are matched to the stroke segments of the model. The cost of the match is determined by comparing a set of geometric properties of the corresponding substrokes and computing a weighted sum of the property value differences. The least invariant features of the least invariant substrokes are given the biggest weights, thus emphasizing features that are highly writer-dependent. Random forgeries are detected when a good correspondence cannot be found, i.e. the process of making the correspondence yields a high cost. Many simple forgeries can also be identified in this way. The threshold for making these decisions is determined by a Gaussian statistical model. Using the local correspondence between the model and a questioned signature, we perform skilled forgery detection by examining the writer-dependent information embedded at the substroke level and try to capture unballistic motion and tremor information in each stroke segment, rather than as global statistics. Experiments on random, simple and skilled forgery detection are presented.


2010 ◽  
Vol 2010 ◽  
pp. 1-11 ◽  
Author(s):  
Stephanie Drzevitzky ◽  
Uwe Kastens ◽  
Marco Platzner

Dynamically reconfigurable hardware combines hardware performance with software-like flexibility and finds increasing use in networked systems. The capability to load hardware modules at runtime provides these systems with an unparalleled degree of adaptivity but at the same time poses new challenges for security and safety. In this paper, we elaborate on the presentation of proof carrying hardware (PCH) as a novel approach to reconfigurable system security. PCH takes a key concept from software security, known as proof-carrying code, into the reconfigurable hardware domain. We outline the PCH concept and discuss runtime combinational equivalence checking as a first online verification problem applying the concept. We present a prototype tool flow and experimental results demonstrating the feasibility and potential of the PCH approach.


2014 ◽  
Vol 1070-1072 ◽  
pp. 829-834
Author(s):  
Yu Tao Qiu ◽  
Jian Zi Zheng ◽  
Yi Wang ◽  
Tie Jun Hu ◽  
Yi Dong ◽  
...  

In order to make the relay protection setting value online checking work more scientific and perfect, this paper studies the integration of county of relay protection setting value online verification scheme based on. Firstly, the county to achieve the integration constant value on-line check the general introduction, focuses on the display data acquisition and the checking calculation; then the county integration interface setting strategy of online check, describes the intelligent interface of intelligent don't know County, interface verification principle and interface design check the principle of selection; finally summing junction surface setting technique of on-line verification.


10.29007/slnn ◽  
2018 ◽  
Author(s):  
Timothy L. Hinrichs ◽  
A. Prasad Sistla ◽  
Lenore D. Zuck

Model checking and runtime verification are pillars of formal verification but for the most part are used independently. In this position paper we argue that the formal verification community would be well-served by developing theory, algorithms, implementations, and applications that combine model checking and runtime verification into a single, seamless technology. This technology would allow system developers to carefully choose the appropriate balance between offline verification of expressive properties (model checking) and online verification of important parts of the system's state space (runtime verification). We present several realistic examples where such technology appears necessary and a preliminary formalization of the idea.


2016 ◽  
Vol 43 (6Part12) ◽  
pp. 3454-3454
Author(s):  
L Yin ◽  
G Janssens ◽  
A Lin ◽  
P Ahn ◽  
T Solberg ◽  
...  

Author(s):  
Matthias Althoff ◽  
Olaf Stursberg ◽  
Martin Buss
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document