A Robust Online Signature Based Cryptosystem
15 Dec 2014-pp 79-84
TL;DR: A robust online signature based cryptosystem to hide the secret by binding it with invariant online signature templates that works well for all kinds of signatures and is independent of the number of zero crossing and high curvature points in the signature trajectory.
Abstract: Cryptography is the backbone for the security systems. The main challenge in use of the Cryptosystems is maintaining the confidentiality of the cryptographic key. A Cryptosystem which encrypts the data using biometric features improves the security of the data and overcomes the problems of key management and key confidentiality. Fuzzy Vault Scheme proposed by Juels and Sudan [1] binds the secret key and the biometric template, so that extraction of the secret without the biometric data is infeasible. Physical signature is a biometric that is widely accepted and is used for proving the authenticity of a person in legal documents, bank transactions etc. Electronic devices such as digital tablets capture azimuth, altitude and pressure along with x any y coordinates at fixed time interval. This paper describes a robust online signature based cryptosystem to hide the secret by binding it with invariant online signature templates. The invariant templates of the signature are derived from artificial neural network based classifier. The entire signature is divided into fixed number of time slices. Important features are extracted based on the consistency of the feature in the slices of the genuine signature. Binary back propagation based neural network for each feature, each subset of slices for a user is trained by a weighted back propagation algorithm. The decisions of these networks are combined using AdaBoost algorithm. The proposed scheme is highly robust as it works well for all kinds of signatures and is independent of the number of zero crossing and high curvature points in the signature trajectory.
Citations
More filters
01 Jan 2017
TL;DR: This chapter systematically reviews the published literature on Biometric Template Protection during 2005–2016 and covers the methods described in more than hundred articles, and presents research implications and extraction outcomes of Systematic Literature Review conducted on BTP schemes.
Abstract: With the emergence of biometric authentication systems, template protection for biometrics captured attention in the recent years. The privacy concern arises due to storage and misuse of biometric data in various applications. This chapter systematically reviews the published literature on Biometric Template Protection (BTP) during 2005–2016 and covers the methods described in more than hundred articles. It aims to present the current status of BTP schemes by a methodical analysis and taxonomy of BTP approaches, modalities, the fusion of modalities (multi-modal), and hybrid methods. It also presents research implications and extraction outcomes of Systematic Literature Review conducted on BTP schemes. This research work helps researchers and practitioners to find relevant information on BTP methods thereby reducing time and complexity in searching the appropriate studies.
49 citations
TL;DR: This review paper reflects the limitations of various biometric template protection methods being used in present times and highlights the scope of future work.
Abstract: Identifying a person based on their behavioral and biological qualities in an automated manner is called biometrics. The authentication system substituting traditional password and token for authentication and relies gradually on biometric authentication methods for verification of the identity of an individual. This proves the fact that society has started depending on biometric-based authentication systems. Security of biometric authentication needs to be reviewed and discussed as there are multiple points related to integrity and public reception of biometric-based authentication systems. Security and recognition accuracy are the two most important aspects which must be considered while designing biometric authentication systems. During enrollment phase scanning of biometric data is done to determine a set of distinct biometric feature set known as biometric template. Protection of biometric templates from various hacking efforts is a topic of vital importance as unlike passwords or tokens, compromised biometric templates cannot be reissued. Therefore, giving powerful protection techniques for biometric templates and still at that very moment preparing great identification accuracy is a good research problem nowadays, as well as in the future. Furthermore, efficiency under non-ideal conditions is also supposed to be inadequate and thus needs special attention in the design of a biometric authentication system. Disclosure of various biometric traits in miscellaneous applications creates a severe compromise on the privacy of the user. Biometric authentication can be utilized for remote user authentication. In this case, the biometric data of users typically called templates are stored in a server. The uniqueness and stability of biometrics ended it useful over traditional authentication systems. But, a similar thing made the enduring harm of a user’s identity in biometric systems. The architecture of the biometric system leads to several hazards that lead to numerous security concerns and privacy threats. To address this issue, biometric templates are secured using several schemes that are categorized as biometric cryptosystems, cancelable biometrics, hybrid methods, Homomorphic Encryption, visual cryptography based methods. Biometric cryptosystems and cancelable biometrics techniques provide reliable biometric security at a great level. However, there persist numerous concerns and encounters that are being faced during the deployment of these protection technologies. This paper reviews and analyses various biometric template protection methods. This review paper also reflects the limitations of various biometric template protection methods being used in present times and highlights the scope of future work.
37 citations
Cites background from "A Robust Online Signature Based Cry..."
...A strong online signature based cryptosystem is proposed in [135]....
[...]
TL;DR: A signing interface for touchscreens which stealthily collects the precise coordinates while an individual is signing on the screen by fingertips is designed and the validity of the CWT and SVM running consecutively is understood.
Abstract: Despite the imitability of the signatures due to presence of numerous image processing programs, online verification systems could provide sufficient security for e-signatures. Recent developments in touchscreen technology and android programming also lead to utilization of hidden interfaces stealthily collecting the unique characteristics and storing the key features aside from geometrics. Therefore, we initially designed a signing interface for touchscreens which stealthily collects the precise coordinates while an individual is signing on the screen by fingertips. Even if the coordinate data is extracted as a matrix consisting of x and y values with corresponding time, the speed array is consequently calculated to investigate the higher frequency regions. The speed data processed by continuous wavelet transformations (CWT) to reveal the frequency information of the signing speed with respect to time information. The grayscale spectrograms created by wavelet transforms are converted into arrays for subsequent training session performed by support vector machines (SVM). The trained network successfully classified further attempts of the real and fake signatures with 1.67% false negative (FNR), 3.33% false positive rates (FPR) and 3.41% equal error rate (EER) for 120 signatures, even though the signature is totally public. For understanding the validity of the CWT and SVM running consecutively, the experiments are re-conducted for the signatures taken from SVC2004 and SUSIG public databases.
18 citations
TL;DR: This paper proposes a novel online signature analysis methodology for touchscreens that starts with signing an interface consisting of a signature silhouette that is stealthily extracted and spectrograms are created by short-time Fourier transforms.
Abstract: The concept of electronic signatures emerged decades ago, however they are still not prevalent due to lack of reliable infrastructure. Although the signatures are hard to perfectly imitate, it is simple with an image editing software to copy the original signature and paste on a document. On the other hand, technological developments of touchscreens may create a new era by utilizing simple interfaces which would be recording and validating the electronic signatures with biometric features. Therefore, in this paper, we propose a novel online signature analysis methodology for touchscreens that starts with signing an interface consisting of a signature silhouette. The frequency spectrum along the signing process is stealthily extracted and spectrograms are created by short-time Fourier transforms. Since the spectrograms are found as RGB images, providing valuable information about frequency vs time, grid histograms are formed by quantization for the real signature sample. Given the discrimination purposes, a fuzzified surface is designed for computing closeness of grid histograms.
16 citations
Cites background from "A Robust Online Signature Based Cry..."
...[21] analyzed the e-signatures by dividing the process into pieces in time-domain....
[...]
...The outcomes of this research could be implemented by the online features presented before, mostly the pressure data like in research [21] if there is a special device that can extract these features....
[...]
References
More filters
01 Jan 1988
TL;DR: This chapter contains sections titled: The Problem, The Generalized Delta Rule, Simulation Results, Some Further Generalizations, Conclusion.
Abstract: This chapter contains sections titled: The Problem, The Generalized Delta Rule, Simulation Results, Some Further Generalizations, Conclusion
17,604 citations
"A Robust Online Signature Based Cry..." refers methods in this paper
...In back propagation algorithm [19] formulated by Rumelhart et al....
[...]
01 Aug 1997
TL;DR: The model studied can be interpreted as a broad, abstract extension of the well-studied on-line prediction model to a general decision-theoretic setting, and it is shown that the multiplicative weight-update Littlestone?Warmuth rule can be adapted to this model, yielding bounds that are slightly weaker in some cases, but applicable to a considerably more general class of learning problems.
Abstract: In the first part of the paper we consider the problem of dynamically apportioning resources among a set of options in a worst-case on-line framework. The model we study can be interpreted as a broad, abstract extension of the well-studied on-line prediction model to a general decision-theoretic setting. We show that the multiplicative weight-update Littlestone?Warmuth rule can be adapted to this model, yielding bounds that are slightly weaker in some cases, but applicable to a considerably more general class of learning problems. We show how the resulting learning algorithm can be applied to a variety of problems, including gambling, multiple-outcome prediction, repeated games, and prediction of points in Rn. In the second part of the paper we apply the multiplicative weight-update technique to derive a new boosting algorithm. This boosting algorithm does not require any prior knowledge about the performance of the weak learning algorithm. We also study generalizations of the new boosting algorithm to the problem of learning functions whose range, rather than being binary, is an arbitrary finite set or a bounded segment of the real line.
15,813 citations
Book•
03 Jan 1986
TL;DR: In this paper, the problem of the generalized delta rule is discussed and the Generalized Delta Rule is applied to the simulation results of simulation results in terms of the generalized delta rule.
Abstract: This chapter contains sections titled: The Problem, The Generalized Delta Rule, Simulation Results, Some Further Generalizations, Conclusion
13,579 citations
[...]
TL;DR: In this article, the authors describe a fuzzy vault construction that allows Alice to place a secret value /spl kappa/ in a secure vault and lock it using an unordered set A of elements from some public universe U. If Bob tries to "unlock" the vault using B, he obtains the secret value if B is close to A, i.e., only if A and B overlap substantially.
Abstract: We describe a simple and novel cryptographic construction that we call a fuzzy vault. Alice may place a secret value /spl kappa/ in a fuzzy vault and "lock" it using an unordered set A of elements from some public universe U. If Bob tries to "unlock" the vault using an unordered set B, he obtains /spl kappa/ only if B is close to A, i.e., only if A and B overlap substantially.
1,481 citations
Book•
01 Mar 2015
901 citations
"A Robust Online Signature Based Cry..." refers methods in this paper
...A ROBUST ONLINE SIGNATURE BASED CRYPTOSYSTEM Ashok K. Bhateja Scientific Analysis Group Defence R & D Organization, Delhi, India Santanu Chaudhury Department of Electrical Engineering Indian Institute of Technology, Delhi, India P. K. Saxena Scientific Analysis Group Defence R & D Organization, Delhi, India 2 September 2014 1 ICFHR 2014 Outline 2 September 2014 ICFHR 2014 2 Introduction The Problem Statement Fuzzy vault Proposed Scheme Feature Extraction AdaBoost Algorithm Weighted Back Propagation Algorithm Encoding & Decoding in the proposed cryptosystem Experimental Results Conclusion References Introduction 2 September 2014 ICFHR 2014 3 Cryptography: Protect information by ensuring Confidentiality Integrity and Authenticity Cryptosystem: Binds plaintext x and key k using a mathematical function f Ciphertext y = f (x, k) Extraction of x or k is computationally hard Management and maintenance of the keys is one of the major problems in a cryptosystem Cryptographic keys stored in highly secure location with Password Personal Identification Number (PIN) Introduction 2 September 2014 ICFHR 2014 4 Signatures are used Financial transactions Documents Verification Dynamic features: velocity, slope along with static (shape) features....
[...]
...Cryptographic techniques are being increasingly used to protect information by ensuring Confidentiality, Integrity and Authenticity [2]....
[...]