526 research outputs found
An efficient identification scheme in standard model based on the diophantine equation hard problem
Recently the Diophantine Equation Hard Problem (DEHP) was proposed. It is utilized to design a standard identification scheme model. Since the computation involves only simple addition and multiplication steps, the efficiency and the time cost are greatly improved as compared to the existing identification schemes. In this paper, we propose a zero knowledge identification scheme based upon the DEHP. With the assumption such that DEHP is intractable, we provide the security analysis on the impersonation against non-adaptive passive attack (imp-pa) and show that our new proposed scheme is more desirable due to high efficiency in terms of time computation
A Pairing-free Provable Secure and Efficient Identity-based Identification Scheme with Anonymity
In this paper, we propose a Blind Identity-Based Identification (Blind IBI) scheme based on the
Guillou-Quisquater (GQ) scheme. Our proposed scheme combines the benefits of traditional
Identity-Based Identification (IBI) schemes that can authenticate a user’s identity without rely ing on a trusted third party with the Blind Signature (BS) scheme that provides anonymity. As
a result, the proposed scheme assures absolute user privacy during the authentication process.
It does not rely on a third party, yet the verifier can still be assured of the user’s identity with out the user actually revealing it. In our work, we show that the proposed scheme is provably
secure under the random oracle model, with the assumption that the one-more-RSA-inversion
problem is difficult. Furthermore, we demonstrate that the proposed scheme is secure against
passive, active, and concurrent impersonation attacks. In conclusion, the proposed scheme is
able to achieve the desired blindness property without compromising the security of the GQ-IBI
scheme it is based upon
KALwEN: a new practical and interoperable key management scheme for body sensor networks
Key management is the pillar of a security architecture. Body sensor networks (BSNs) pose several challenges–some inherited from wireless sensor networks (WSNs), some unique to themselves–that require a new key management scheme to be tailor-made. The challenge is taken on, and the result is KALwEN, a new parameterized key management scheme that combines the best-suited cryptographic techniques in a seamless framework. KALwEN is user-friendly in the sense that it requires no expert knowledge of a user, and instead only requires a user to follow a simple set of instructions when bootstrapping or extending a network. One of KALwEN's key features is that it allows sensor devices from different manufacturers, which expectedly do not have any pre-shared secret, to establish secure communications with each other. KALwEN is decentralized, such that it does not rely on the availability of a local processing unit (LPU). KALwEN supports secure global broadcast, local broadcast, and local (neighbor-to-neighbor) unicast, while preserving past key secrecy and future key secrecy (FKS). The fact that the cryptographic protocols of KALwEN have been formally verified also makes a convincing case. With both formal verification and experimental evaluation, our results should appeal to theorists and practitioners alike
ASSURE: RTL Locking Against an Untrusted Foundry
Semiconductor design companies are integrating proprietary intellectual
property (IP) blocks to build custom integrated circuits (IC) and fabricate
them in a third-party foundry. Unauthorized IC copies cost these companies
billions of dollars annually. While several methods have been proposed for
hardware IP obfuscation, they operate on the gate-level netlist, i.e., after
the synthesis tools embed the semantic information into the netlist. We propose
ASSURE to protect hardware IP modules operating on the register-transfer level
(RTL) description. The RTL approach has three advantages: (i) it allows
designers to obfuscate IP cores generated with many different methods (e.g.,
hardware generators, high-level synthesis tools, and pre-existing IPs). (ii) it
obfuscates the semantics of an IC before logic synthesis; (iii) it does not
require modifications to EDA flows. We perform a cost and security assessment
of ASSURE.Comment: Submitted to IEEE Transactions on VLSI Systems on 11-Oct-2020,
28-Jan-202
Privacy-Preserving Facial Recognition Using Biometric-Capsules
Indiana University-Purdue University Indianapolis (IUPUI)In recent years, developers have used the proliferation of biometric sensors in smart devices, along with recent advances in deep learning, to implement an array of biometrics-based recognition systems. Though these systems demonstrate remarkable performance and have seen wide acceptance, they present unique and pressing security and privacy concerns. One proposed method which addresses these concerns is the elegant, fusion-based Biometric-Capsule (BC) scheme. The BC scheme is provably secure, privacy-preserving, cancellable and interoperable in its secure feature fusion design.
In this work, we demonstrate that the BC scheme is uniquely fit to secure state-of-the-art facial verification, authentication and identification systems. We compare the performance of unsecured, underlying biometrics systems to the performance of the BC-embedded systems in order to directly demonstrate the minimal effects of the privacy-preserving BC scheme on underlying system performance. Notably, we demonstrate that, when seamlessly embedded into a state-of-the-art FaceNet and ArcFace verification systems which achieve accuracies of 97.18% and 99.75% on the benchmark LFW dataset, the BC-embedded systems are able to achieve accuracies of 95.13% and 99.13% respectively. Furthermore, we also demonstrate that the BC scheme outperforms or performs as well as several other proposed secure biometric methods
Enhancing Biometric-Capsule-based Authentication and Facial Recognition via Deep Learning
In recent years, developers have used the proliferation of biometric sensors in smart devices, along with recent advances in deep learning, to implement an array of biometrics-based authentication systems. Though these systems demonstrate remarkable performance and have seen wide acceptance, they present unique and pressing security and privacy concerns. One proposed method which addresses these concerns is the elegant, fusion-based BioCapsule method. The BioCapsule method is provably secure, privacy-preserving, cancellable and flexible in its secure feature fusion design. In this work, we extend BioCapsule to face-based recognition. Moreover, we incorporate state-of-art deep learning techniques into a BioCapsule-based facial authentication system to further enhance secure recognition accuracy. We compare the performance of an underlying recognition system to the performance of the BioCapsule-embedded system in order to demonstrate the minimal effects of the BioCapsule scheme on underlying system performance. We also demonstrate that the BioCapsule scheme outperforms or performs as well as many other proposed secure biometric techniques
Provably Secure Password Reset Protocol: Model, Definition, and Generic Construction
Many online services adopt a password-based user authentication system because of its usability. However, several problems have been pointed out on it, and one of the well-known problems is that a user forgets his/her password and cannot login the services. To solve this problem, most online services support a mechanism with which a user can reset a password. In this paper, we consider a provable security treatment for a password reset protocol. We formalize a model and security definitions, propose a generic construction based on a pseudorandom function and public key encryption. In addition, we implement a prototype of our protocol to evaluate its efficiency
- …