A public key encryption scheme for string identification

One of the major limitations of index based encrypted string search on big dataset is the inherent problem of big index generation, maintenance and update which stops it from being dynamic in a sense that one could not modify data or add or remove keywords. Also for a resource constraint client, to generate an index linear in the size of big dataset is difficult. In this paper, we provide an efficient easy-toimplement public key based searchable encryption scheme for string search which is adaptively secure and does not need any index. We provide concrete proof of the adaptive security of our scheme against honest-but-curious server. We validate our scheme against three different publicly available datasets

R-PEKS: RBAC Enabled PEKS for Secure Access of Cloud Data

In the recent past, few works have been done by combining attribute-based access control with multi-user PEKS, i.e., public key encryption with keyword search. Such attribute enabled searchable encryption is most suitable for applications where the changing of privileges is done once in a while. However, to date, no efficient and secure scheme is available in the literature that is suitable for these applications where changing privileges are done frequently. In this paper our contributions are twofold. Firstly, we propose a new PEKS scheme for string search, which, unlike the previous constructions, is free from bi-linear mapping and is efficient by 97% compared to PEKS for string search proposed by Ray et.al in TrustCom 2017. Secondly, we introduce role based access control (RBAC) to multi-user PEKS, where an arbitrary group of users can search and access the encrypted files depending upon roles. We termed this integrated scheme as R-PEKS. The efficiency of R-PEKS over the PEKS scheme is up to 90%. We provide formal security proofs for the different components of R-PEKS and validate these schemes using a commercial dataset

Privacy-Preserving iVector-Based Speaker Verification

This paper introduces an efficient algorithm to develop a privacy-preserving voice verification based on iVector and linear discriminant analysis techniques. This research considers a scenario in which users enrol their voice biometric to access different services (i.e., banking). Once enrolment is completed, users can verify themselves using their voice print instead of alphanumeric passwords. Since a voice print is unique for everyone, storing it with a third-party server raises several privacy concerns. To address this challenge, this paper proposes a novel technique based on randomization to carry out voice authentication, which allows the user to enrol and verify their voice in the randomized domain. To achieve this, the iVector-based voice verification technique has been redesigned to work on the randomized domain. The proposed algorithm is validated using a well-known speech dataset. The proposed algorithm neither compromises the authentication accuracy nor adds additional complexity due to the randomization operations

Synthesis and Structural Analysis of Nanocrystalline MnFe2O4

AbstractNanocrystalline form of manganese ferrite (MnFe2O4) has been synthesized by simple sol-gel auto combustion method using citric acid as chelating agent. The obtained nanocrystalline powders of manganese ferrite were subjected to structural and magnetic measurements. Temperature dependent magnetization was also carried out for the single phase nanocrystalline manganese ferrite and the results have been discussed in detail

Scale Inside-Out: Rapid Mitigation of Cloud DDoS Attacks

The distributed denial of service (DDoS) attacks in cloud computing requires quick absorption of attack data. DDoS attack mitigation is usually achieved by dynamically scaling the cloud resources so as to quickly identify the onslaught features to combat the attack. The resource scaling comes with an additional cost which may prove to be a huge disruptive cost in the cases of longer, sophisticated, and repetitive attacks. In this work, we address an important problem, whether the resource scaling during attack, always result in rapid DDoS mitigation? For this purpose, we conduct real-time DDoS attack experiments to study the attack absorption and attack mitigation for various target services in the presence of dynamic cloud resource scaling. We found that the activities such as attack absorption which provide timely attack data input to attack analytics, are adversely compromised by the heavy resource usage generated by the attack. We show that the operating system level local resource contention, if reduced during attacks, can expedite the overall attack mitigation. The attack mitigation would otherwise not be completed by the dynamic scaling of resources alone. We conceived a novel relation which terms “Resource Utilization Factor” for each incoming request as the major component in forming the resource contention. To overcome these issues, we propose a new “Scale Inside-out” approach which during attacks, reduces the “Resource Utilization Factor” to a minimal value for quick absorption of the attack. The proposed approach sacrifices victim service resources and provides those resources to mitigation service in addition to other co-located services to ensure resource availability during the attack. Experimental evaluation shows up to 95 percent reduction in total attack downtime of the victim service in addition to considerable improvement in attack detection time, service reporting time, and downtime of co-located services

DDoS victim service containment to minimize the internal collateral damages in cloud computing

Recent Distributed Denial of Service (DDoS) attacks on cloud services demonstrate new attack effects, including collateral and economic losses. In this work, we show that DDoS mitigation methods may not provide the expected timely mitigation due to the heavy resource outage created by the attacks. We observe an important Operating System (OS) level internal collateral damage, in which the other critical services are also affected. We formulate the DDoS mitigation problem as an OS level resource management problem. We argue that providing extra resources to the victim's server is only helpful if we can ensure the availability of other services. To achieve these goals, we propose a novel resource containment approach to enforce the victim's resource limits. Our real-time experimental evaluations show that the proposed approach results in reduction in the attack reporting time and victim service downtime by providing isolated and timely resources to ensure availability of other critical services

t-3-Pentyl-r-2,c-6-diphenyl­piperidin-4-one

In the title mol­ecule, C22H27NO, the piperidine ring adopts a chair conformation, with all substituents equatorial. The dihedral angle between the two phenyl rings is 56.90 (5)°. In the crystal, mol­ecules are linked by weak C—H⋯O hydrogen bonds. A C—H⋯π inter­action involving the phenyl ring at the 6-position is also found in the crystal structure

COST-EFFECTIVE EVALUATION ON ASSEMBLING POOL BUILDING

Residential building detail estimation and costing or Quantity surveying The main purpose of this project would be to gain sufficient understanding in planning, analysis, and style of creating and Quantity surveying Our project handles the program and style of the Bank building. It's a reinforced concrete presented structure composed of G  2 with sufficient facilities. IS 456:2000 codes may be the fundamental code for general construction in concrete structures, hence all of the structural people are made using limit condition method in compliance using the IS 456:2000 code and style aids. The look associated with a building in India is going to be identified by National Building Code (NBC) , therefore, the building is planned in compliance using the National Building Code Asia. The residential building   has proper ventilation, it will get sufficient doorways, home windows. Water supply and electrification will also be provided. The ceiling height is supplied as 3.2m, for set up structures as pointed out Building Code (NBC)

Design of probe for NQR/NMR detection

Nuclear Magnetic Resonance (NMR) is a RF technique that is able to detect any compound by sensing the excited resonance signals from atomic nuclei having non-zero spin. NQR is similar to NMR but the only difference is NMR needs a DC magnetic field and due to this its application in the field is limited. A FPGA based NQR spectrometer is designed using a single FPGA chip to perform the digital tasks required for NQR spectrometer. Design of Probe for NMR/NQR spectrometer is researched. Parallel tuned and series tuned Probes are discussed and simulated.14N NQR from NaNO2 is observed from spectrometer designed with parallel tuned probe