Scope analysis of different kinds of fingerprint

As Biometrics are the most widely used technique for person identification and verificationwith different applications, this research paper is mainly focused on the different kinds ofFingerprints based on availability and acquisition process. Fingerprints can broadly becategorized into three categories: Live Scan, Latent, and Patent Fingerprints. The mainobjective of this research is to present importance of different kinds of fingerprint with theirrecognition techniques. The quality of fingerprint image also plays an important role duringthe recognition process, because it requires extra time to improve quality of image. Thereare different types of image enhancement methods are available applicable differently ondifferent kinds of fingerprint images. This research provides basic information aboutfingerprints to the research direction

New attacks on ISO key establishment protocols

Cheng and Comley demonstrated type flaw attacks against the key establishment mechanism 12 standardized in ISO/IEC 11770-2:1996. They also proposed enhancements to fix the security flaws in the mechanism. We show that the enhanced version proposed by Cheng and Comley is still vulnerable to type flaw attacks. As well we show that the key establishment mechanism 13 in the above standard is vulnerable to a type flaw attack

On Efficient Key Agreement Protocols

A class of efficient key agreement protocols proposed by Boyd is examined. An attack is demonstrated on a round-optimal example protocol of this class, and a simple countermeasure is suggested. The whole class is known to be vulnerable to an attack proposed by Bauer, Berson and Feiertag. A new class of key agreement protocols without this vulnerability but having the same advantages in efficiency is identified, and a number of concrete protocols are suggested

Ablation of Refractory Papillary Muscle Ventricular Tachycardia Warranting Multiple Adjunctive Ablation Techniques: A Combined Approach for Success

A 27-year-old male presented to our institution with recurrent unifocal premature ventricular contraction/nonsustained ventricular tachycardia (VT) with associated cardiomyopathy. The patient had undergone three prior ablation procedures with continued arrhythmia. Mapping led to identification of the VT arising from the basal aspect of the left ventricular anterolateral papillary muscle. Conventional ablation techniques were unsuccessful. We incorporated adjunctive ablation techniques in this case that ultimately led to a successful outcome. The present discussion covers the roles of intracardiac echocardiography, induced apnea, and low-ionic irrigation

IGDT based Genco's trading decision making in multimarket environment

Fossil fuel gencos are subject to influence of multiple uncertain but interactive energy and emission markets. It procures production resources from fuel and emission market and sells its generation through multiple contracts in electricity market. With increasing volatility and unpredictability in energy markets, a genco needs to make prudent decision to manage its trading in all involved markets, to guarantee minimum profit. Considering the existing market uncertainties and associated information gap, this paper proposes a robust decision making approach for gencos trading portfolio selection in all three involved markets, based on Information Gap Decision Theory (IGDT). Results from a realistic case study provides a range of decisions for a risk averse genco, appropriate to its nature, and based on the trade-off existing between robustness and targeted profit.</p

Efficient privacy preserving top-k recommendation using homomorphic sorting

The existing works on privacy-preserving recommender systems based on homomorphic encryption do not filter top-k most relevant items on the server side. As a result, sending the encrypted rating vector for all items to the user retrieving the top-k items is necessary. This incurs significant computation and communication costs on the user side. In this work, we employ private sorting at the server to reduce the user-side overheads. In private sorting, the values and corresponding positions of elements must remain private. We use an existing private sorting protocol by Foteini and Olga and tailor it to the privacy-preserving top-k recommendation applications. We enhance it to use secure bit decomposition in the private comparison routine of the protocol. This leads to a notable reduction in cost overheads of users as well as the servers, especially at the keyserver where the computation cost is reduced to half. The dataserver does not have to perform costly encryption and decryption operations. It performs computationally less expensive modular exponentiation operations. Since the private comparison operation contributes significantly to the overall cost overhead, making it efficient enhances the sorting protocol’s performance. Our security analysis concludes that the proposed scheme is as secure as the original protocol

Security Weaknesses of an Anonymous Attribute Based Encryption appeared in ASIACCS\u2713

Attribute-based Encryption (ABE) has found enormous application in fine-grained access control of shared data, particularly in public cloud. In 2013, Zhang et al proposed a scheme called match-then-decrypt [1], where before running the decryption algorithm the user requires to perform a match operation with attribute(s) that provides the required information to identify whether a particular user is the intended recipient for the ciphertext. As in [1], the match-then-decrypt operation saves the computational cost at the receiver and the scheme supports receivers\u27 anonymity. In this paper, we show that Zhang et al\u27s scheme [1] does not support receivers\u27 anonymity. Any legitimate user or an adversary can successfully check whether an attribute is required in the matching phase, in turn, can reveal the receivers\u27 identity from the attribute