Outsourcing of scientic computations is attracting increasing attention since it enables the customers with limited computing resource and storage devices to outsource the sophisticated computation workloads into powerful service providers. However, it also comes up with some security and privacy concerns and challenges, such as the input and output privacy of the customers, and cheating behaviors of the cloud. Motivated by these issues, this paper focused on privacy-preserving Linear Fractional Programming (LFP) as a typical and practically relevant case for veriable secure multiparty computation. We will investigate the secure and veriable schema with correctness guarantees, by using normal multiparty techniques to compute the result of a computation and then using veriable techniques only to verify that this result was correct.
LOG MESSAGE ANOMALY DETECTION WITH OVERSAMPLINGijaia
Imbalanced data is a significant challenge in classification with machine learning algorithms. This is particularly important with log message data as negative logs are sparse so this data is typically imbalanced. In this paper, a model to generate text log messages is proposed which employs a SeqGAN network. An Autoencoder is used for feature extraction and anomaly detection is done using a GRU network. The proposed model is evaluated with three imbalanced log data sets, namely BGL, OpenStack, and Thunderbird. Results are presented which show that appropriate oversampling and data balancing
improves anomaly detection accuracy.
International Journal of Computational Engineering Research(IJCER) is an intentional online Journal in English monthly publishing journal. This Journal publish original research work that contributes significantly to further the scientific knowledge in engineering and Technology
An Analysis of Fraudulence in Fuzzy Commitment Scheme With Trusted PartyCSCJournals
This paper attempt has been made to elaborate the possible cases of dishonesty between the two communicating parties under fuzzy commitment scheme. However there could be many instances where the transmission involves complete security, even if it contains errors arising purely because of the factors over which either sender or receiver have complete control. The concept itself is illustrated with the help of simple situations.
In this work a method for video streaming authentication based on butterfly graphs is presanted. As well as other methods variables such as the sender delay, receiver delay, computation overhead, communication overhead, robustness against packet loss, should be considered. The aim of this work is improvement of communication overhead as an important parameter, in networks which packet loss ratio is random and burst. For this purpose we develop butterfly graph to increase authentication probability.
Towards Practical Homomorphic Encryption with Efficient Public key GenerationIDES Editor
With the advent of cloud computing several security
and privacy challenges are put forth. To deal with many of
these privacy issues, ‘processing the encrypted data’ has been
identified as a potential solution, which requires a Fully
Homomorphic Encryption (FHE) scheme. After the
breakthrough work of Craig Gentry in devising an FHE,
several new homomorphic encryption schemes and variants
have been proposed. However, all those theoretically feasible
schemes are not viable for practical deployment due to their
high computational complexities. In this work, a variant of
the DGHV’s integer based Somewhat Homomorphic
Encryption (SHE) scheme with an efficient public key
generation method is presented. The complexities of various
algorithms involved in the scheme are significantly low. The
semantic security of the variant is based on the two-element
Partial Approximate Greatest Common Divisors (PAGCD)
problem. Experimental results prove that the proposed scheme
is very much efficient than any other integer based SHE
scheme existing today and hence practical.
LOG MESSAGE ANOMALY DETECTION WITH OVERSAMPLINGijaia
Imbalanced data is a significant challenge in classification with machine learning algorithms. This is particularly important with log message data as negative logs are sparse so this data is typically imbalanced. In this paper, a model to generate text log messages is proposed which employs a SeqGAN network. An Autoencoder is used for feature extraction and anomaly detection is done using a GRU network. The proposed model is evaluated with three imbalanced log data sets, namely BGL, OpenStack, and Thunderbird. Results are presented which show that appropriate oversampling and data balancing
improves anomaly detection accuracy.
International Journal of Computational Engineering Research(IJCER) is an intentional online Journal in English monthly publishing journal. This Journal publish original research work that contributes significantly to further the scientific knowledge in engineering and Technology
An Analysis of Fraudulence in Fuzzy Commitment Scheme With Trusted PartyCSCJournals
This paper attempt has been made to elaborate the possible cases of dishonesty between the two communicating parties under fuzzy commitment scheme. However there could be many instances where the transmission involves complete security, even if it contains errors arising purely because of the factors over which either sender or receiver have complete control. The concept itself is illustrated with the help of simple situations.
In this work a method for video streaming authentication based on butterfly graphs is presanted. As well as other methods variables such as the sender delay, receiver delay, computation overhead, communication overhead, robustness against packet loss, should be considered. The aim of this work is improvement of communication overhead as an important parameter, in networks which packet loss ratio is random and burst. For this purpose we develop butterfly graph to increase authentication probability.
Towards Practical Homomorphic Encryption with Efficient Public key GenerationIDES Editor
With the advent of cloud computing several security
and privacy challenges are put forth. To deal with many of
these privacy issues, ‘processing the encrypted data’ has been
identified as a potential solution, which requires a Fully
Homomorphic Encryption (FHE) scheme. After the
breakthrough work of Craig Gentry in devising an FHE,
several new homomorphic encryption schemes and variants
have been proposed. However, all those theoretically feasible
schemes are not viable for practical deployment due to their
high computational complexities. In this work, a variant of
the DGHV’s integer based Somewhat Homomorphic
Encryption (SHE) scheme with an efficient public key
generation method is presented. The complexities of various
algorithms involved in the scheme are significantly low. The
semantic security of the variant is based on the two-element
Partial Approximate Greatest Common Divisors (PAGCD)
problem. Experimental results prove that the proposed scheme
is very much efficient than any other integer based SHE
scheme existing today and hence practical.
Efficient Intrusion Detection using Weighted K-means Clustering and Naïve Bay...yousef emami
Intrusion detection system (IDS) is becoming a vital component to secure the network. A successful intrusion detection system requires high accuracy and detection rate. In this paper a hybrid approach for intrusion detection system based on data mining techniques is proposed. The principal ingredients of the approach are weighted k-means clustering and naive bayes classification. The C5.0 algorithm is used for ranking attributes, so the attributes receive a weight which is used in K-means clustering therefore accuracy of clustering is increased.
NLP Project: Machine Comprehension Using Attention-Based LSTM Encoder-Decoder...Eugene Nho
Machine comprehension remains a challenging open area of research. While many question answering models have been explored for existing datasets, little work has been done with the newly released MS MARCO dataset, which mirrors the reality much more closely and poses many unique challenges. We explore an end-to-end neural architecture with attention mechanisms for comprehending relevant information and generating text answers for MS MARCO.
Experimental study of Data clustering using k- Means and modified algorithmsIJDKP
The k- Means clustering algorithm is an old algorithm that has been intensely researched owing to its ease
and simplicity of implementation. Clustering algorithm has a broad attraction and usefulness in
exploratory data analysis. This paper presents results of the experimental study of different approaches to
k- Means clustering, thereby comparing results on different datasets using Original k-Means and other
modified algorithms implemented using MATLAB R2009b. The results are calculated on some performance
measures such as no. of iterations, no. of points misclassified, accuracy, Silhouette validity index and
execution time
Event Coreference Resolution using Mincut based Graph Clustering cscpconf
To extract participants of an event instance, it is necessary to identify all the sentences that
describe the event instance. The set of all sentences referring to the same event instance are said
to be corefering each other. Our proposed approach formulates the event coreference resolution
as a graph based clustering model. It identifies the corefering sentences using minimum cut
(mincut) based on similarity score between each pair of sentences at various levels such as
trigger word similarity, time stamp similarity, entity similarity and semantic similarity. It
achieves good B-Cubed F-measure score with some loss in recall.
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
Intrusion Detection System for Classification of Attacks with Cross Validationinventionjournals
Now days, due to rapidly uses of internet, the patterns of network attacks are increasing. There are various organizations and institutes are using internet and access or share the sensitive information in network. To protect information from unauthorized or intruders is one of the important issues. In this paper, we have used decision tree techniques like C4.5 and CART as classifier for classification of attacks. We have proposed an ensemble model that is combination of C4.5 and Classification and Regression Tree (CART) as robust classifier for classification of attacks. We have used NSL-KDD data set with binary and multiclass problem with 10-fold cross validation. The proposed ensemble model gives satisfactory accuracy as 99.67% and 99.53% in case of binary class and multiclass NSL-KDD data set respectively.
The International Journal of Engineering & Science is aimed at providing a platform for researchers, engineers, scientists, or educators to publish their original research results, to exchange new ideas, to disseminate information in innovative designs, engineering experiences and technological skills. It is also the Journal's objective to promote engineering and technology education. All papers submitted to the Journal will be blind peer-reviewed. Only original articles will be published.
The papers for publication in The International Journal of Engineering& Science are selected through rigorous peer reviews to ensure originality, timeliness, relevance, and readability.
Performance evaluation of modified modular exponentiation for rsa algorithmeSAT Journals
Abstract
Authentication is a very important application of public-key cryptography. Cryptographic algorithms make use of secret keys
known to send and receive information. When the keys are known the encryption / decryption process is an easy task, however
decryption will be impossible without knowing the correct key. The shared public key is managed by the sender, to produce a
message authentication code (MAC) for every transmitted message. There are many algorithms to enable security for message
authentication (secret key). RSA is one such best algorithm for public key based message authentication approaches. But it takes
more time for encryption and/or decryption process, when it has large key length. This research work evaluates the performance
of RSA algorithm with modified modular exponentiation technique for message authentication. As a result modified modular
exponent based RSA algorithm reduces execution time for encryption and decryption process.
Key Words: Cryptography, Message authentication, RSA, Modular Exponentiation.
An Enhanced Message Digest Hash Algorithm for Information Securitypaperpublications3
Abstract: Information is an important commodity in the world of Electronic communication. To achieve a secure communication between communicating parties, the protection of authenticity and integrity of information is necessary. Cryptographic hash functions play a central role in cryptology. A cryptographic hash function takes an input of arbitrary large size and returns a small fixed size hash value. It satisfies three major cryptographic properties: preimage resistance, second preimage resistance and collision resistance. Due to its cryptographic properties hash function has become an important cryptographic tool which is used to protect information authenticity and integrity. This thesis presents a review of cryptographic hash functions. The thesis includes various applications of hash functions. It gives special emphasis on dedicated hash functions MD5.
Recent breakthroughs in cryptanalysis of standard hash functions like SHA-1 and MD5 raise the need for alternatives. In the past few years, there have been significant research advances in the analysis of hash functions and it was shown that none of the hash algorithm is secure enough for critical purposes whether it is MD5 or SHA-1. Nowadays scientists have found weaknesses in a number of hash functions, including MD5, SHA and RIPEMD. So the purpose of this thesis is combination of some function to reinforce these functions and also increasing hash code of message digest of length up to 160 that makes stronger algorithm against collision and brute force attacks.
Pseudo-Random Bit Generator Using Chaotic Seed for Cryptographic Algorithm in...IJECEIAES
Cryptographic algorithms have played an important role in information security for protecting privacy. The literature provides evidence that many types of chaotic cryptosystems have been proposed. These chaotic systems encode information to obviate its orbital instability and ergodicity. In this work, a pseudo-random cryptographic generator algorithm with a symmetric key, based on chaotic functions, is proposed. Moreover, the algorithm exploits dynamic simplicity and synchronization to generate encryption sub-keys using unpredictable seeds, extracted from a chaotic zone, in order to increase their level of randomness. Also, it is applied to a simulated electrical energy consumption signal and implemented on a prototype, using low hardware resources, to measure physical variables; hence, the unpredictability degree was statistically analyzed using the resulting cryptogram. It is shown that the pseudo-random sequences produced by the cryptographic key generator have acceptable properties with respect to randomness, which are validated in this paper using National Institute of Standards and Technology (NIST) statistical tests. To complement the evaluation of the encrypted data, the Lena image is coded and its metrics are compared with those reported in the literature, yielding some useful results.
Efficient Intrusion Detection using Weighted K-means Clustering and Naïve Bay...yousef emami
Intrusion detection system (IDS) is becoming a vital component to secure the network. A successful intrusion detection system requires high accuracy and detection rate. In this paper a hybrid approach for intrusion detection system based on data mining techniques is proposed. The principal ingredients of the approach are weighted k-means clustering and naive bayes classification. The C5.0 algorithm is used for ranking attributes, so the attributes receive a weight which is used in K-means clustering therefore accuracy of clustering is increased.
NLP Project: Machine Comprehension Using Attention-Based LSTM Encoder-Decoder...Eugene Nho
Machine comprehension remains a challenging open area of research. While many question answering models have been explored for existing datasets, little work has been done with the newly released MS MARCO dataset, which mirrors the reality much more closely and poses many unique challenges. We explore an end-to-end neural architecture with attention mechanisms for comprehending relevant information and generating text answers for MS MARCO.
Experimental study of Data clustering using k- Means and modified algorithmsIJDKP
The k- Means clustering algorithm is an old algorithm that has been intensely researched owing to its ease
and simplicity of implementation. Clustering algorithm has a broad attraction and usefulness in
exploratory data analysis. This paper presents results of the experimental study of different approaches to
k- Means clustering, thereby comparing results on different datasets using Original k-Means and other
modified algorithms implemented using MATLAB R2009b. The results are calculated on some performance
measures such as no. of iterations, no. of points misclassified, accuracy, Silhouette validity index and
execution time
Event Coreference Resolution using Mincut based Graph Clustering cscpconf
To extract participants of an event instance, it is necessary to identify all the sentences that
describe the event instance. The set of all sentences referring to the same event instance are said
to be corefering each other. Our proposed approach formulates the event coreference resolution
as a graph based clustering model. It identifies the corefering sentences using minimum cut
(mincut) based on similarity score between each pair of sentences at various levels such as
trigger word similarity, time stamp similarity, entity similarity and semantic similarity. It
achieves good B-Cubed F-measure score with some loss in recall.
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
Intrusion Detection System for Classification of Attacks with Cross Validationinventionjournals
Now days, due to rapidly uses of internet, the patterns of network attacks are increasing. There are various organizations and institutes are using internet and access or share the sensitive information in network. To protect information from unauthorized or intruders is one of the important issues. In this paper, we have used decision tree techniques like C4.5 and CART as classifier for classification of attacks. We have proposed an ensemble model that is combination of C4.5 and Classification and Regression Tree (CART) as robust classifier for classification of attacks. We have used NSL-KDD data set with binary and multiclass problem with 10-fold cross validation. The proposed ensemble model gives satisfactory accuracy as 99.67% and 99.53% in case of binary class and multiclass NSL-KDD data set respectively.
The International Journal of Engineering & Science is aimed at providing a platform for researchers, engineers, scientists, or educators to publish their original research results, to exchange new ideas, to disseminate information in innovative designs, engineering experiences and technological skills. It is also the Journal's objective to promote engineering and technology education. All papers submitted to the Journal will be blind peer-reviewed. Only original articles will be published.
The papers for publication in The International Journal of Engineering& Science are selected through rigorous peer reviews to ensure originality, timeliness, relevance, and readability.
Performance evaluation of modified modular exponentiation for rsa algorithmeSAT Journals
Abstract
Authentication is a very important application of public-key cryptography. Cryptographic algorithms make use of secret keys
known to send and receive information. When the keys are known the encryption / decryption process is an easy task, however
decryption will be impossible without knowing the correct key. The shared public key is managed by the sender, to produce a
message authentication code (MAC) for every transmitted message. There are many algorithms to enable security for message
authentication (secret key). RSA is one such best algorithm for public key based message authentication approaches. But it takes
more time for encryption and/or decryption process, when it has large key length. This research work evaluates the performance
of RSA algorithm with modified modular exponentiation technique for message authentication. As a result modified modular
exponent based RSA algorithm reduces execution time for encryption and decryption process.
Key Words: Cryptography, Message authentication, RSA, Modular Exponentiation.
An Enhanced Message Digest Hash Algorithm for Information Securitypaperpublications3
Abstract: Information is an important commodity in the world of Electronic communication. To achieve a secure communication between communicating parties, the protection of authenticity and integrity of information is necessary. Cryptographic hash functions play a central role in cryptology. A cryptographic hash function takes an input of arbitrary large size and returns a small fixed size hash value. It satisfies three major cryptographic properties: preimage resistance, second preimage resistance and collision resistance. Due to its cryptographic properties hash function has become an important cryptographic tool which is used to protect information authenticity and integrity. This thesis presents a review of cryptographic hash functions. The thesis includes various applications of hash functions. It gives special emphasis on dedicated hash functions MD5.
Recent breakthroughs in cryptanalysis of standard hash functions like SHA-1 and MD5 raise the need for alternatives. In the past few years, there have been significant research advances in the analysis of hash functions and it was shown that none of the hash algorithm is secure enough for critical purposes whether it is MD5 or SHA-1. Nowadays scientists have found weaknesses in a number of hash functions, including MD5, SHA and RIPEMD. So the purpose of this thesis is combination of some function to reinforce these functions and also increasing hash code of message digest of length up to 160 that makes stronger algorithm against collision and brute force attacks.
Pseudo-Random Bit Generator Using Chaotic Seed for Cryptographic Algorithm in...IJECEIAES
Cryptographic algorithms have played an important role in information security for protecting privacy. The literature provides evidence that many types of chaotic cryptosystems have been proposed. These chaotic systems encode information to obviate its orbital instability and ergodicity. In this work, a pseudo-random cryptographic generator algorithm with a symmetric key, based on chaotic functions, is proposed. Moreover, the algorithm exploits dynamic simplicity and synchronization to generate encryption sub-keys using unpredictable seeds, extracted from a chaotic zone, in order to increase their level of randomness. Also, it is applied to a simulated electrical energy consumption signal and implemented on a prototype, using low hardware resources, to measure physical variables; hence, the unpredictability degree was statistically analyzed using the resulting cryptogram. It is shown that the pseudo-random sequences produced by the cryptographic key generator have acceptable properties with respect to randomness, which are validated in this paper using National Institute of Standards and Technology (NIST) statistical tests. To complement the evaluation of the encrypted data, the Lena image is coded and its metrics are compared with those reported in the literature, yielding some useful results.
Secure Checkpointing Approach for Mobile Environmentidescitation
Mobile nodes such as mobile phones, laptops etc are widely used nowadays. The
services must be always available, reliable and uninterrupted. The communication must be
secure. Fault tolerance is the most important feature of these systems. To make a system
fault tolerant at operating system level we apply check pointing. Security threats like
information leakage, information theft, information change can be done by a malicious node
at the time of communication between two legitimate nodes. Elliptic curve cryptography is
used to provide authentication, confidentiality, non repudiation etc. Main objective of our
work is to design a low overhead secured fault tolerant system which makes the
computation and communication secure. The saving of system state is needed to recover
from failure. The reliable backing store is also needed for recovery from failure.
anonymous and efficient authentication scheme for privacy-preserving distribu...SUBHAJIT GHOSH
This report provides an overview of the anonymous and efficient authentication scheme for privacy-preserving distributed learning. This work has helped to alleviate some of the drawbacks of privacy-preserving in distributed learning or has innovated new technologies for various applications. I attempted to identify the paper's problem(s) while also comprehending the methodology (that is, the working model and algorithms).
PUBLIC INTEGRIYT AUDITING FOR SHARED DYNAMIC DATA STORAGE UNDER ONTIME GENERA...paperpublications3
Abstract: Nowadays verifying the result of the remote computation plays a crucial role in addressing in issue of trust. The outsourced data collection comes for multiple data sources to diagnose the originator of errors by allotting each data sources a unique secrete key which requires the inner product conformation to be performed under any two parties different keys. The proposed methods outperform AISM technique to minimize the running time. The multi-key setting is given different secrete keys, multiple data sources can be upload their data streams along with their respective verifiable homomorphic tag. The AISM consist of three novel join techniques depending on the ADS availability: (i) Authenticated Indexed Sort Merge Join (AISM), which utilizes a single ADS on the join attribute, (ii) Authenticated Index Merge Join (AIM) that requires an ADS (on the join attribute) for both relations, and (iii) Authenticated Sort Merge Join (ASM), which does not rely on any ADS. The client should allow choosing any portion in the data streams for queries. The communication between the client and server is independent of input size. The inner product evaluation can be performed by any two sources and the result can be verified by using the particular tag.
Keywords: Computation of outsourcing, Data Stream, Multiple Key, Homomorphic encryption.
Title: PUBLIC INTEGRIYT AUDITING FOR SHARED DYNAMIC DATA STORAGE UNDER ONTIME GENERATED MULTIPLE KEYS
Author: C. NISHA MALAR, M. S. BONSHIA BINU
ISSN 2350-1049
International Journal of Recent Research in Interdisciplinary Sciences (IJRRIS)
Paper Publications
Utilizing distributed storage administrations, clients can store their Information in the cloud to maintain a strategic distance from
the consumption of neighborhood information stockpiling support. To guarantee the uprightness of the information put away in
the Cloud, numerous information, honesty examining plans have been proposed. A client needs to Utilize his private key to
produce the information authenticators for Understanding the information respectability reviewing. In this way, the client needs to
have an equipment token to store his private Key and retain a secret phrase to enact this private key. In the event that this
Equipment token is lost or this secret phrase is overlooked, the majority of the Current information, trustworthiness inspecting
plans would be notable work. We propose another worldview Called information uprightness inspecting without private key
stockpiling and Plan such a plan. In this plan, we use biometric informationas the client's fluffy private key to Abstain from
utilizing the equipment token. In the interim, the plan can at present Successfully complete the information respectability
auditing. We use a direct Sketch with coding and blunder revision procedures to affirm The personality of the client. We use
another mark Conspire which supports blacklist certainty. The security evidence and the Execution examination demonstrates that our proposed plan accomplishes Attractive security andeffectiveness.
The aim of this research is the speed tracking of the permanent magnet synchronous motor (PMSM) using an intelligent Neural-Network based adapative backstepping control. First, the model of PMSM in the Park synchronous frame is derived. Then, the PMSM speed regulation is investigated using the classical method utilizing the field oriented control theory. Thereafter, a robust nonlinear controller employing an adaptive backstepping strategy is investigated in order to achieve a good performance tracking objective under motor parameters changing and external load torque application. In the final step, a neural network estimator is integrated with the adaptive controller to estimate the motor parameters values and the load disturbance value for enhancing the effectiveness of the adaptive backstepping controller. The robsutness of the presented control algorithm is demonstrated using simulation tests. The obtained results clearly demonstrate that the presented NN-adaptive control algorithm can provide good trackingperformances for the speed trackingin the presence of motor parameter variation and load application.
This paper presents a fast and accurate fault detection, classification and direction discrimination algorithm of transmission lines using one-dimensional convolutional neural networks (1D-CNNs) that have ingrained adaptive model to avoid the feature extraction difficulties and fault classification into one learning algorithm. A proposed algorithm is directly usable with raw data and this deletes the need of a discrete feature extraction method resulting in more effective protective system. The proposed approach based on the three-phase voltages and currents signals of one end at the relay location in the transmission line system are taken as input to the proposed 1D-CNN algorithm. A 132kV power transmission line is simulated by Matlab simulink to prepare the training and testing data for the proposed 1D- CNN algorithm. The testing accuracy of the proposed algorithm is compared with other two conventional methods which are neural network and fuzzy neural network. The results of test explain that the new proposed detection system is efficient and fast for classifying and direction discrimination of fault in transmission line with high accuracy as compared with other conventional methods under various conditions of faults.
Among the most widespread renewable energy sources is solar energy; Solar panels offer a green, clean, and environmentally friendly source of energy. In the presence of several advantages of the use of photovoltaic systems, the random operation of the photovoltaic generator presents a great challenge, in the presence of a critical load. Among the most used solutions to overcome this problem is the combination of solar panels with generators or with the public grid or both. In this paper, an energy management strategy is proposed with a safety aspect by using artificial neural networks (ANNs), in order to ensure a continuous supply of electricity to consumers with a maximum solicitation of renewable energy.
In this paper, the artificial neural network (ANN) has been utilized for rotating machinery faults detection and classification. First, experiments were performed to measure the lateral vibration signals of laboratory test rigs for rotor-disk-blade when the blades are defective. A rotor-disk-blade system with 6 regular blades and 5 blades with various defects was constructed. Second, the ANN was applied to classify the different x- and y-axis lateral vibrations due to different blade faults. The results based on training and testing with different data samples of the fault types indicate that the ANN is robust and can effectively identify and distinguish different blade faults caused by lateral vibrations in a rotor. As compared to the literature, the present paper presents a novel work of identifying and classifying various rotating blade faults commonly encountered in rotating machines using ANN. Experimental data of lateral vibrations of the rotor-disk-blade system in both x- and y-directions are used for the training and testing of the network.
This paper focuses on the artificial bee colony (ABC) algorithm, which is a nonlinear optimization problem. is proposed to find the optimal power flow (OPF). To solve this problem, we will apply the ABC algorithm to a power system incorporating wind power. The proposed approach is applied on a standard IEEE-30 system with wind farms located on different buses and with different penetration levels to show the impact of wind farms on the system in order to obtain the optimal settings of control variables of the OPF problem. Based on technical results obtained, the ABC algorithm is shown to achieve a lower cost and losses than the other methods applied, while incorporating wind power into the system, high performance would be gained.
The significance of the solar energy is to intensify the effectiveness of the Solar Panel with the use of a primordial solar tracking system. Here we propounded a solar positioning system with the use of the global positioning system (GPS) , artificial neural network (ANN) and image processing (IP) . The azimuth angle of the sun is evaluated using GPS which provide latitude, date, longitude and time. The image processing used to find sun image through which centroid of sun is calculated and finally by comparing the centroid of sun with GPS quadrate to achieve optimum tracking point. Weather conditions and situation observed through AI decision making with the help of IP algorithms. The presented advance adaptation is analyzed and established via experimental effects which might be made available on the memory of the cloud carrier for systematization. The proposed system improve power gain by 59.21% and 10.32% compare to stable system (SS) and two-axis solar following system (TASF) respectively. The reduced tracking error of IoT based Two-axis solar following system (IoT-TASF) reduces their azimuth angle error by 0.20 degree.
Kosovo has limited renewable energy resources and its power generation sector is based on fossil fuels. Such a situation emphasizes the importance of active research and efficient use of renewable energy potential. According to the analysis of meteorological data for Kosovo, it can be concluded that among the most attractive potential wind power sites are the locations known as Kitka (42° 29' 41" N and 21° 36' 45" E) and Koznica (42° 39′ 32″ N, 21° 22′30″E). The two terrains in which the analysis was carried out are mountain areas, with altitudes of 1142 m (Kitka) and 1230 m (Koznica). the same measuring height, about 84 m above the ground, is obtained for these average wind speeds: Kitka 6,667 m/s and Koznica 6,16 m/s. Since the difference in wind speed is quite large versus a difference in altitude that is not being very large, analyses are made regarding the terrain characteristics including the terrain relief features. In this paper it will be studied how much the roughness of the terrain influences the output energy. Also, that the assumption to be taken the same as to how much they will affect the annual energy produced.
Large-scale grid-tied photovoltaic (PV) station are increasing rapidly. However, this large penetration of PV system creates frequency fluctuation in the grid due to the intermittency of solar irradiance. Therefore, in this paper, a robust droop control mechanism of the battery energy storage system (BESS) is developed in order to damp the frequency fluctuation of the multi-machine grid system due to variable active power injected from the PV panel. The proposed droop control strategy incorporates frequency error signal and dead-band for effective minimization of frequency fluctuation. The BESS system is used to consume/inject an effective amount of active power based upon the frequency oscillation of the grid system. The simulation analysis is carried out using PSCAD/EMTDC software to prove the effectiveness of the proposed droop control-based BESS system. The simulation result implies that the proposed scheme can efficiently curtail the frequency oscillation.
This study investigates experimentally the performance of two-dimensional solar tracking systems with reflector using commercial silicon based photovoltaic module, with open and closed loop control systems. Different reflector materials were also investigated. The experiments were performed at the Hashemite University campus in Zarqa at a latitude of 32⁰, in February and March. Photovoltaic output power and performance were analyzed. It was found that the modified photovoltaic module with mirror reflector generated the highest value of power, while the temperature reached a maximum value of 53 ̊ C. The modified module suggested in this study produced 5% more PV power than the two-dimensional solar tracking systems without reflector and produced 12.5% more PV power than the fixed PV module with 26⁰ tilt angle.
This paper focuses on the modeling and control of a wind energy conversion chain using a permanent magnet synchronous machine. This system behaves a turbine, a generator, DC/DC and DC/AC power converters. These are connected on both sides to the DC bus, where the inverter is followed by a filter which is connected to the grid. In this paper, we have been used two types of controllers. For the stator side converter, we consider the Takagi-Sugeno approach where the parameters of controller have been computed by the theory of linear matrix inequalities. The stability synthesis has been checked using the Lyapunov theory. According to the grid side converter, the proportional integral controller is exploited to keep a constant voltage on the DC bus and control both types of powers. The simulation results demonstrate the robustness of the approach used.
The development of modeling wind speed plays a very important in helping to obtain the actual wind speed data for the benefit of the power plant planning in the future. The wind speed in this paper is obtained from a PCE-FWS 20 type measuring instrument with a duration of 30 minutes which is accumulated into monthly data for one year (2019). Despite the many wind speed modeling that has been done by researchers. Modeling wind speeds proposed in this study were obtained from the modified Rayleigh distribution. In this study, the Rayleigh scale factor (Cr) and modified Rayleigh scale factor (Cm) were calculated. The observed wind speed is compared with the predicted wind characteristics. The data fit test used correlation coefficient (R2), root means square error (RMSE), and mean absolute percentage error (MAPE). The results of the proposed modified Rayleigh model provide very good results for users.
This paper deals with an advanced design for a pump powered by solar energyto supply agricultural lands with water and also the maximum power point is used to extract the maximum value of the energy available inside the solar panels and comparing between techniques MPPT such as Incremental conductance, perturb & observe, fractional short current circuit, and fractional open voltage circuit to find the best technique among these. The solar system is designed with main parts: photovoltaic (PV) panel, direct current/direct current (DC/DC) converter, inverter, filter, and in addition, the battery is used to save energy in the event that there is an increased demand for energy and not to provide solar radiation, as well as saving energy in the case of generation more than demand. This work was done using the matrix laboratory (MATLAB) simulink program.
The objective of this paper is to provide an overview of the current state of renewable energy resources in Bangladesh, as well as to examine various forms of renewable energies in order to gain a comprehensive understanding of how to address Bangladesh's power crisis issues in a sustainable manner. Electricity is currently the most useful kind of energy in Bangladesh. It has a substantial influence on a country's socioeconomic standing and living standards. Maintaining a stable source of energy at a cost that is affordable to everyone has been a constant battle for decades. Bangladesh is blessed with a wealth of natural resources. Bangladesh has a huge opportunity to accelerate its economic development while increasing energy access, livelihoods, and health for millions of people in a sustainable way due to the renewable energy system.
When the irradiance distribution over the photovoltaic panels is uniform, the pursuit of the maximum power point is not reached, which has allowed several researchers to use traditional MPPT techniques to solve this problem Among these techniques a PSO algorithm is used to have the maximum global power point (GMPPT) under partial shading. On the other hand, this one is not reliable vis-à-vis the pursuit of the MPPT. Therefore, in this paper we have treated another technique based on a new modified PSO algorithm so that the power can reach its maximum point. The PSO algorithm is based on the heuristic method which guarantees not only the obtaining of MPPT but also the simplicity of control and less expensive of the system. The results are obtained using MATLAB show that the proposed modified PSO algorithm performs better than conventional PSO and is robust to different partial shading models.
A stable operation of wind turbines connected to the grid is an essential requirement to ensure the reliability and stability of the power system. To achieve such operational objective, installing static synchronous compensator static synchronous compensator (STATCOM) as a main compensation device guarantees the voltage stability enhancement of the wind farm connected to distribution network at different operating scenarios. STATCOM either supplies or absorbs reactive power in order to ensure the voltage profile within the standard-margins and to avoid turbine tripping, accordingly. This paper present new study that investigates the most suitable-location to install STATCOM in a distribution system connected wind farm to maintain the voltage-levels within the stability margins. For a large-scale squirrel cage induction generator squirrel-cage induction generator (SCIG-based) wind turbine system, the impact of STATCOM installation was tested in different places and voltage-levels in the distribution system. The proposed method effectiveness in enhancing the voltage profile and balancing the reactive power is validated, the results were repeated for different scenarios of expected contingencies. The voltage profile, power flow, and reactive power balance of the distribution system are observed using MATLAB/Simulink software.
The electrical and environmental parameters of polymer solar cells (PSC) provide important information on their performance. In the present article we study the influence of temperature on the voltage-current (I-V) characteristic at different temperatures from 10 °C to 90 °C, and important parameters like bandgap energy Eg, and the energy conversion efficiency η. The one-diode electrical model, normally used for semiconductor cells, has been tested and validated for the polemeral junction. The PSC used in our study are formed by the poly(3-hexylthiophene) (P3HT) and [6,6]-phenyl C61-butyric acid methyl ester (PCBM). Our technique is based on the combination of two steps; the first use the Least Mean Squares (LMS) method while the second use the Newton-Raphson algorithm. The found results are compared to other recently published works, they show that the developed approach is very accurate. This precision is proved by the minimal values of statistical errors (RMSE) and the good agreement between both the experimental data and the I-V simulated curves. The obtained results show a clear and a monotonic dependence of the cell efficiency on the studied parameters.
The inverter is the principal part of the photovoltaic (PV) systems that assures the direct current/alternating current (DC/AC) conversion (PV array is connected directly to an inverter that converts the DC energy produced by the PV array into AC energy that is directly connected to the electric utility). In this paper, we present a simple method for detecting faults that occurred during the operation of the inverter. These types of faults or faults affect the efficiency and cost-effectiveness of the photovoltaic system, especially the inverter, which is the main component responsible for the conversion. Hence, we have shown first the faults obtained in the case of the short circuit. Second, the open circuit failure is studied. The results demonstrate the efficacy of the proposed method. Good monitoring and detection of faults in the inverter can increase the system's reliability and decrease the undesirable faults that appeared in the PV system. The system behavior is tested under variable parameters and conditions using MATLAB/Simulink.
The electrical distribution network is undergoing tremendous modifications with the introduction of distributed generation technologies which have led to an increase in fault current levels in the distribution network. Fault current limiters have been developed as a promising technology to limit fault current levels in power systems. Though, quite a number of fault current limiters have been developed; the most common are the superconducting fault current limiters, solid-state fault current limiters, and saturated core fault current limiters. These fault current limiters present potential fault current limiting solutions in power systems. Nevertheless, they encounter various challenges hindering their deployment and commercialization. This research aimed at designing a bridge-type nonsuperconducting fault current limiter with a novel topology for distribution network applications. The proposed bridge-type nonsuperconducting fault current limiter was designed and simulated using PSCAD/EMTDC. Simulation results showed the effectiveness of the proposed design in fault current limiting, voltage sag compensation during fault conditions, and its ability not to affect the load voltage and current during normal conditions as well as in suppressing the source powers during fault conditions. Simulation results also showed very minimal power loss by the fault current limiter during normal conditions.
This paper provides a new approach to reducing high-order harmonics in 400 Hz inverter using a three-level neutral-point clamped (NPC) converter. A voltage control loop using the harmonic compensation combined with NPC clamping diode control technology. The capacitor voltage imbalance also causes harmonics in the output voltage. For 400 Hz inverter, maintain a balanced voltage between the two input (direct current) (DC) capacitors is difficult because the pulse width modulation (PWM) modulation frequency ratio is low compared to the frequency of the output voltage. A method of determining the current flowing into the capacitor to control the voltage on the two balanced capacitors to ensure fast response reversal is also given in this paper. The combination of a high-harmonic resonator controller and a neutral-point voltage controller working together on the 400 Hz NPC inverter structure is given in this paper.
Direct current (DC) electronic load is a useful equipment for testing the electrical system. It can emulate various load at a high rating. The electronic load requires a power converter to operate and a linear regulator is a common option. Nonetheless, it is hard to control due to the temperature variation. This paper proposed a DC electronic load using the boost converter. The proposed electronic load operates in the continuous current mode and control using the integral controller. The electronic load using the boost converter is compared with the electronic load using the linear regulator. The results show that the boost converter able to operate as an electronic load with an error lower than 0.5% and response time lower than 13 ms.
More from International Journal of Power Electronics and Drive Systems (20)
CFD Simulation of By-pass Flow in a HRSG module by R&R Consult.pptxR&R Consult
CFD analysis is incredibly effective at solving mysteries and improving the performance of complex systems!
Here's a great example: At a large natural gas-fired power plant, where they use waste heat to generate steam and energy, they were puzzled that their boiler wasn't producing as much steam as expected.
R&R and Tetra Engineering Group Inc. were asked to solve the issue with reduced steam production.
An inspection had shown that a significant amount of hot flue gas was bypassing the boiler tubes, where the heat was supposed to be transferred.
R&R Consult conducted a CFD analysis, which revealed that 6.3% of the flue gas was bypassing the boiler tubes without transferring heat. The analysis also showed that the flue gas was instead being directed along the sides of the boiler and between the modules that were supposed to capture the heat. This was the cause of the reduced performance.
Based on our results, Tetra Engineering installed covering plates to reduce the bypass flow. This improved the boiler's performance and increased electricity production.
It is always satisfying when we can help solve complex challenges like this. Do your systems also need a check-up or optimization? Give us a call!
Work done in cooperation with James Malloy and David Moelling from Tetra Engineering.
More examples of our work https://www.r-r-consult.dk/en/cases-en/
Cosmetic shop management system project report.pdfKamal Acharya
Buying new cosmetic products is difficult. It can even be scary for those who have sensitive skin and are prone to skin trouble. The information needed to alleviate this problem is on the back of each product, but it's thought to interpret those ingredient lists unless you have a background in chemistry.
Instead of buying and hoping for the best, we can use data science to help us predict which products may be good fits for us. It includes various function programs to do the above mentioned tasks.
Data file handling has been effectively used in the program.
The automated cosmetic shop management system should deal with the automation of general workflow and administration process of the shop. The main processes of the system focus on customer's request where the system is able to search the most appropriate products and deliver it to the customers. It should help the employees to quickly identify the list of cosmetic product that have reached the minimum quantity and also keep a track of expired date for each cosmetic product. It should help the employees to find the rack number in which the product is placed.It is also Faster and more efficient way.
NO1 Uk best vashikaran specialist in delhi vashikaran baba near me online vas...Amil Baba Dawood bangali
Contact with Dawood Bhai Just call on +92322-6382012 and we'll help you. We'll solve all your problems within 12 to 24 hours and with 101% guarantee and with astrology systematic. If you want to take any personal or professional advice then also you can call us on +92322-6382012 , ONLINE LOVE PROBLEM & Other all types of Daily Life Problem's.Then CALL or WHATSAPP us on +92322-6382012 and Get all these problems solutions here by Amil Baba DAWOOD BANGALI
#vashikaranspecialist #astrologer #palmistry #amliyaat #taweez #manpasandshadi #horoscope #spiritual #lovelife #lovespell #marriagespell#aamilbabainpakistan #amilbabainkarachi #powerfullblackmagicspell #kalajadumantarspecialist #realamilbaba #AmilbabainPakistan #astrologerincanada #astrologerindubai #lovespellsmaster #kalajaduspecialist #lovespellsthatwork #aamilbabainlahore#blackmagicformarriage #aamilbaba #kalajadu #kalailam #taweez #wazifaexpert #jadumantar #vashikaranspecialist #astrologer #palmistry #amliyaat #taweez #manpasandshadi #horoscope #spiritual #lovelife #lovespell #marriagespell#aamilbabainpakistan #amilbabainkarachi #powerfullblackmagicspell #kalajadumantarspecialist #realamilbaba #AmilbabainPakistan #astrologerincanada #astrologerindubai #lovespellsmaster #kalajaduspecialist #lovespellsthatwork #aamilbabainlahore #blackmagicforlove #blackmagicformarriage #aamilbaba #kalajadu #kalailam #taweez #wazifaexpert #jadumantar #vashikaranspecialist #astrologer #palmistry #amliyaat #taweez #manpasandshadi #horoscope #spiritual #lovelife #lovespell #marriagespell#aamilbabainpakistan #amilbabainkarachi #powerfullblackmagicspell #kalajadumantarspecialist #realamilbaba #AmilbabainPakistan #astrologerincanada #astrologerindubai #lovespellsmaster #kalajaduspecialist #lovespellsthatwork #aamilbabainlahore #Amilbabainuk #amilbabainspain #amilbabaindubai #Amilbabainnorway #amilbabainkrachi #amilbabainlahore #amilbabaingujranwalan #amilbabainislamabad
Runway Orientation Based on the Wind Rose Diagram.pptx
Verifiable secure computation of linear fractional programming using certificate validation
1. International Journal of Power Electronics and Drive System (IJPEDS)
Vol. 11, No. 1, March 2020, pp. 284∼290
ISSN: 2088-8694, DOI: 10.11591/ijpeds.v11.i1.pp284-290 r 284
Verifiable secure computation of linear fractional
programming using certificate validation
Nedal M. Mohammed1
, Laman R. Sultan2
, Ahmed A. Hamoud3
, Santosh S. Lomte4
1,4
Department of Computer Science, Dr. Babasaheb Ambedkar Marathwada University, Aurangabad, India
2
Department of Power Mechanics, Basra Technical Institute, Southern Technical University, Al-Basrah, Iraq
3
Department of Mathematics, Dr. Babasaheb Ambedkar Marathwada University, Aurangabad, India
1
Department of Computer Science, Taiz University, Taiz, Yemen.
Article Info
Article history:
Received Mar 28, 2019
Revised Jul 8, 2019
Accepted Jul 31, 2019
Keywords:
Certificate validation LFP
Computation outsourcing
Verifiable computation
Verifiable secure computation
of LFP
ABSTRACT
Outsourcing of scientific computations is attracting increasing attention since it
enables the customers with limited computing resource and storage devices to
outsource the sophisticated computation workloads into powerful service providers.
However, it also comes up with some security and privacy concerns and challenges,
such as the input and output privacy of the customers, and cheating behaviors of the
cloud. Motivated by these issues, this paper focused on privacy-preserving Linear
Fractional Programming (LFP) as a typical and practically relevant case for verifiable
secure multiparty computation. We will investigate the secure and verifiable schema
with correctness guarantees, by using normal multiparty techniques to compute the
result of a computation and then using verifiable techniques only to verify that this
result was correct.
This is an open access article under the CC BY-SA license.
Corresponding Author:
Nedal M. Mohammed,
Department of Computer Science,
Taiz University,
Taiz, Yemen.
Email: dr.nedal.mohammed@gmail.com
1. INTRODUCTION
The powerful advantage of cloud computing is called outsourcing, where the customers with limited
computing resource and storage devices can outsource the sophisticated computation workloads into powerful
service providers. Despite the tremendous benefits, there are many challenges and security concerns because
the cloud server and customer are not in the same trusted domain, to avoid these problems [1-4]. First, to combat
the security concern is applying encryption techniques to customer’s sensitive information before outsourcing
to the cloud but still, there is a challenge how makes the task of computation over encrypted data [5,6]. Second,
no guarantee from the cloud on the quality of the computed data and results. For instance, solving financial
linear programs is useful for optimizing global profits confidentiality is important because the inputs are
sensitive information from multiple companies but correctness is important because the outcome represents
financial value.
In theory, correctness and privacy can be achieved by producing cryptographic proofs of correctness
in a multi-party way [7,8]. In [9] They achieved Correctness by replicating a computation and comparing
the results this done against uncorrelated failure. Without assuming uncorrelated failure or trusted hardware
the correctness can be done e.g., [10] by instead producing cryptographic proofs of correctness. Also, privacy
Journal homepage: http://ijpeds.iaescore.com
2. Int J Pow Elec & Dri Syst ISSN: 2088-8694 r 285
can be done when the computation achieved by multiple computation parties using multiparty computation
protocols e.g. [11,12].
In this paper, we want to be sure that the results are correct and with the multiple mutually distrusting
in putters, also we want to guarantee the privacy of the inputs. We present certificate validation as a general
technique for achieving verifiable secure computation of linear fractional programming. We use of El-Gamal
encryption [13-15] by combining the computation stage and the validation stage rather than using expensive
encryption schemes such as Paillier’s cryptosystem.
The rest of the paper is organized as follows: section 2. Shows verifiable computation schema.
In section 3. We describes the system model of our proposed Protocol for privacy-preserving outsourcing LFP.
In section 4. We provide experimental result analysis for the proposed schema. At last the work conclusion is
presented in section 5.
2. VERIFIABLE COMPUTATION
Verifiable computation has been studied by plenty of researchers in various application scenarios.
They researched widely how to verify the correctness of computations performed by untrusted parties (without
privacy) [16-21].
Figure 1. System Structure of Verifiable Computation Scheme.
Verifiable computation schemes are normally based on either computation complexity theory or
cryptographic algorithms. Data and computations can be outsourced to another party in order to obtain
a processing result in return. However, whether the result is right or wrong could cause a potential risk
for a data processing result requester. For outsourced data processing and computations, verification of the
computation results is a critical issue to ensure the trust of Computation-as-a-Service [22].
3. PROTOCOL FOR PRIVACY-PRESERVING OUTSOURCING LINEAR FRACTIONAL PRO-
GRAMMING
We present main protocol for privacy-preserving outsourcing with correctness guarantees.
We compute a solution and a so-called certificate using normal multiparty computation, and then produce
Verifiable secure computation of linear... (Nedal M. Mohammed)
3. 286 r ISSN: 2088-8694
a proof that the solution is valid with respect to the certificate using the El-Gamal-based proofs [23].
3.1. Functions of certificates and validating
To efficiently validate a computation result, we use certificates. In complexity theory, a certificate is
a proof that a value lies in a certain set that can be verified in polynomial time.
Let S1, S2 be sets and Y ⊆ S1. A polynomial time computable predicate [ϕ ⊆ S1 × S2] is called
a validating function for Y if Y = {w ∈ S1|∃c ∈ S2 : ϕ (w, c)}. If ϕ (w, c) w ∈ Y. In our case,
a computation is given by a computation function ϕ (y, a, r) , and a validating function ϕ (y, a, r) . Here, on
input x, function f computes function output r and certificate a; validating function ϕ checks that r is a valid
output with respect to x and a. We require that if (a, r) = f (y), then ϕ (y, a, r), but we do not demand
the converse: the outcome of the computation might not be unique, and might merely check that some correct
solution was found, not that it was produced according to algorithm f. (For instance, a square root finder may
return the positive square root while negative square root is also valid.) In our case study, we use that the
optimality of a solution to a LFP can be efficiently validated using a certificate.
3.2. The verifiable multiparty computation protocol by certificate validation
We present Verifiable Multiparty computation protocol by certificate validation (VerMPC) protocol to
compute (a, r) = f(x), and prove this result Xi is correct. We use passively secure multiparty computation
protocols based on (t, n) Shamir sharing with n = 2t + 1. In these protocols, the input parties encrypt and
announce their inputs, then makes a proof of knowledge of the corresponding plaintext then broadcast for
this encryption and proof. Next, the parties provide the plaintext and randomness of the encryption to the two
computation parties who will later prove the result is correct. The two computation parties check if the provided
sharing of the input is consistent with the encryptions that were broadcast for preventing corrupted input parties
learns information about both their encrypted and their secret shared inputs, this done by encrypting their shares
of the inputs then using the homomorphic property of the cryptosystem for checking correctness. Then, the
actual computation takes place in the third computation party. The two parties holding additive shares of the
input Shamir-share them between all three computation parties, then the computation is performed between the
three parties. These two of the computation parties produce the encrypted result and prove its correctness [24].
The computation parties send their additive shares of the result and the randomness of their encryption shares
results to the resulting party (the encryptions of the certificate and proof of correctness) [13,25-27]. The result
party checks the proofs of knowledge provided by the in putters computes the encrypted results from its shares
and use Verify algorithm to verify the correctness.
Figure 2. System structure of verifiable computation protocol by certificate validation
Int J Pow Elec & Dri Syst, Vol. 11, No. 1, March 2020 : 284 – 290
4. Int J Pow Elec & Dri Syst ISSN: 2088-8694 r 287
3.3. Secure and verifiable linear fractional programming
The LFP is a special class of mathematical optimization expressed in the following standard
form [28]:
max Z =
cy + δ
dy + ξ
S.t. Ay ≤ b, By ≥ 0, (1)
where (1) the objective function is a linear fractional function (ratio of two linear functions) y is an n×1 vector
of variables which are to be determined, c and d are n × 1 column vectors of coefficients, and set of constraints
are a system of linear equalities and inequalities (affine constraints) A is m × n matrix of coefficients, b is
m × 1 column vector of coefficients and δ, ξ are constants. B is n × n nonsingular matrix. For instance,
the LFP represents the problem to find x1, x2 satisfying
max Z =
2x1 + 3x2
x1 + x2 + 1
S.t.
x1 + x2 ≤ 3
x1 + 2x2 ≤ 3
x1, x2 ≥ 0.
To find the optimal solution of a fractional linear program, typically an iterative algorithm called the simplex
algorithm is used after convert LFP to LP [29].
max F(y) = 2y1 + 3y2
S.t.
4y1 + 4y2 ≤ 3
4y1 + 5y2 ≤ 3
y1, y2 ≥ 0.
A =
4 4
4 5
, b =
3
3
, c =
2
3
.
Each iteration involves several comparisons and a Gaussian elimination step, making it quite heavy
for multiparty computation. For relatively small instances, passively secure linear fractional programming
is feasible [11], but actively secure MPC much less so when including pre-processing.
Theorem: We prove that y it is optimal using the optimal solution p of the so-called dual LP
maximise b · p such that A · p ≤ c, p ≤ 0.
Proof: The solutions (y1
q , · · · , yn
q ) and (p1
q , · · · , pm
q ) (y ∈ Zn
, p ∈ Zm
, q ∈ N+
) are both
optimal if the following conditions hold:
q ≥ 1; p · b = c · y; A · y ≤ q · b; y ≥ 0 ;
AT
· p ≤ q · c; p ≤ 0.
Also, the simplex algorithm for finding y turns out to also directly give p. To turn the above criterion into
a set of polynomial equations, we define the certificate to consist of bit decompositions of (q · b − A · y)i,
yi, (q · c − AT
· p)i, and − pi, and prove that each bit decomposition b0, b1, ... sums up to the correct value
v (with equation v = b0 + 2 · b1 + · · · ) and contains only bits (with equations bi · (1 − bi) = 0).
Verifiable secure computation of linear... (Nedal M. Mohammed)
5. 288 r ISSN: 2088-8694
4. EXPERIMENTAL RESULT
The experimental results are the average of multiple trials. We design numerical experiments to
evaluate the efficiency of the mechanism. We ran our mechanism on several LFPs. We measured the time
to solve the LFP and to compute the certificate (this depends on the LFP size, number of iterations needed,
and the bit length for internal computations), the time for PolyProve to produce a proof, and for PolyVer
to verify it (this depends on the LFP size and bit length for the proof). Figure 3. Shows the performance
numbers of our experiments.
Table 1. Performance of the proposed scheme for infeasible case
Problem No. of Verify Prove Compute
Size Iterations Algorithm Algorithm Certificate
m=5, n=5 4 11.450 85 110
m=20, n=20 9 79.50 200 347
m=48, n=70 25 300.340 986 1100
m=103, n=150 62 1000 4806 8500
Figure 3. Time cost for each phase of verifiable secure computation of LFP using certificate validation
For the LFPs in our experiments, we find that producing proof adds little overhead to compute the
solution and that verifying the proof is much faster than participating in the computation. As a consequence,
for the recipient, outsourcing both guarantees correctness and saves time compared to participating in the
computation. In general, one expects the difference between computing the solution and proving its correctness
to be more pronounced for larger problems: indeed, both the computation and the correctness verification scale
in the size of the LFP, but computation additionally scales in the number of iterations needed to reach the
optimal solution. This number of iterations typically grows with the LFP size. However, we only found this
for the biggest LFP, where proving is over four times faster than computing, for the other programs, this factor
was around two. An explanation for this is that also the bit length of solutions (which influences proving time)
typically grows with the number of iterations.
5. CONCLUSION
In this paper, we combined passively secure three-party computation with El-Gamal-based proofs.
We have shown how to use certificate validation to obtain correctness guarantees for privacy-preserving
outsourcing of LFP. The security guarantees of our model lie in between passive security (that does not
guarantee correctness in case of active attacks) and active security (that also guarantees privacy in this case).
For LFP, verifying results takes much less time than participating in an actively secure computation; in fact,
it even takes less time than participating in a passively secure computation without any correctness guarantees.
Hence, for computations on inputs of mutually distrusting parties, privacy-preserving outsourcing with correct-
ness guarantees provides a compelling combination of correctness and privacy guarantees.
Int J Pow Elec Dri Syst, Vol. 11, No. 1, March 2020 : 284 – 290
6. Int J Pow Elec Dri Syst ISSN: 2088-8694 r 289
REFERENCES
[1] C. Hu, A. Alhothaily, A. Alrawais, X. Cheng, C. Sturtivant and H. Liu, ”A secure and variable outsourcing
scheme for matrix inverse computation,” IEEE INFOCOM, 17(4) (2017), 2304–2312.
[2] N. M. Mohammed and S. S. Lomte, ”Recent advances on secure computations outsourcing in cloud
computing,” Asian Journal of Mathematics and Computer Research, 24(4) (2017), 192–205.
[3] N. M. Mohammed and S. S. Lomte, ”Secure computations outsourcing of mathematical optimization and
linear algebra tasks: Survey,” International Journal for Research in Engineering Application Manage-
ment, (2019), 6–11.
[4] K. Zhou and J. Ren, ”CASO: Cost-Aware secure outsourcing of general computational problems, ” IEEE
Transactions on Services Computing, 2018.
[5] C. Gentry, ”Computing arbitrary functions of encrypted data,” Comm. ACM., 53(3) (2010), 97–105.
[6] N. M. Mohammed, L. R. Sultan, S. S. Lomte, ”Privacy preserving outsourcing algorithm for two-point
linear boundary value problems,” Indonesian Journal of Electrical Engineering and Computer Science,
16(2) (2019), 1065–1069.
[7] W. Shen, Y. Bo, C. Xianghui, C. Yu and S. Xuemin, ”A distributed secure outsourcing scheme for solving
linear algebraic equations in ad hoc clouds,” IEEE Transactions on Cloud Computing, 4 (2017).
[8] N. Mohammed and S. Lomte, ”Secure and efficient outsourcing of large scale linear fractional program-
ming,” International Conference on Computing in Engineering and Technology (ICCET), (2019), To Ap-
pear.
[9] M. Castro and B. Liskov, ”Practical Byzantine fault tolerance and proactive recovery,” ACM Transactions
on Computer Systems, 20(4) (2002), 398–461.
[10] B. Parno, J. Howell, C. Gentry and M. Raykova, Pinocchio: Nearly practical verifiable computation, In
Proceedings of S P., 13, 2013.
[11] P. Bogetoft, D. L. Christensen, I. Damgȧrd, M. Geisler, T. P. Jakobsen, M. Kraigaard, J. D. Nielsen, J.
B. Nielsen, K. Nielsen, J. Pagter, M. I. Schwartzbach and T. Toft, ”Secure multiparty computation goes
live,” In Proceedings of Financial Crypto., 09 (2009).
[12] I. Damgård, M. Keller, E. Larraia, V. Pastro, P. Scholl and N. Smart, ”Practical covertly secure MPC for
dishonest majority - Or: breaking the SPDZ limits,” In Proceedings of ESORICS., 13 (2013).
[13] T. El Gamal, ”A public key cryptosystem and a signature scheme based on discrete logarithms,” IEEE
Transactions on Information Theory, 31(4) (1985), 469–472.
[14] A. Lopez-Alt, E. Tromer and V. Vaikuntanathan, ”On-the-way multiparty computation on the cloud via
multi key fully homomorphic encryption,” In Proceedings of STOC., 12 (2012), 1219–1234.
[15] R. Tamassia and N. Triandopoulos, ”Certification and authentication of data structures,” In Proceedings
of AMW., 10 (2010).
[16] P. Ananth, N. Chandran, V. Goyal, B. Kanukurthi and R. Ostrovsky, ”Achieving Privacy in Verifiable
Computation with Multiple Servers - With-out FHE and without Pre-processing,” In Proceedings of PKC.,
14 (2014).
[17] S. Arora and S. Safra, ”Probabilistic checking of proofs: A new characterization of NP,” J. ACM., 45(1)
(1998), 70–122.
[18] C. Baum, I. Damgard and C. Orlandi, ”Publicly auditable secure multi party computation,” In Proceedings
of SCN, 14 (2014).
[19] R. Canetti, ”Security and composition of multi-party cryptographic protocols,” Journal of Cryptology,
13:2000, 1998.
[20] I. Damgard, K. Damgard, K. Nielsen, P. S. Nordholt and T. Toft, ”Condential benchmarking based on
multiparty computation,” IACR Cryptology ePrint Archive, 2015:1006, 2015.
[21] Y. Ejgenberg, M. Farbstein, M. Levy and Y. Lindell, ”SCAPI: The Secure Computation Application
Programming Interface,” Cryptology ePrint Archive, Report, 2012/629, 2012.
[22] D. Fiore, R. Gennaro and V. Pastro, ”Efficiently verifiable computation on encrypted data,” In Proceedings
of CCS., 14 (2014).
[23] J. Hromkovic, ”Algorithmics for hard problems - introduction to combinatorial optimization, randomiza-
tion, approximation, and heuristics,” Springer, 2001.
[24] B. Schoenmakers and M. Veeningen, ”Universally Verifiable Multiparty Computation from Threshold
Homomorphic Cryptosystems,” Cryptology ePrint Archive, Report, 2015/058, 2015.
Verifiable secure computation of linear... (Nedal M. Mohammed)
7. 290 r ISSN: 2088-8694
[25] S. Goldwasser, Y. Kalai and G. Rothblum, ”Delegating computation: interactive proofs for muggles,” In
Proc. of STOC., 08 (2008), 113–122.
[26] S. Kamara, P. Mohassel and M. Raykova, ”Outsourcing multi-party computation,” IACR Cryptology
ePrint Archive, 2011:272, 2011.
[27] M. Keller, G. L. Mikkelsen and A. Rupp, ”Efficient threshold zero knowledge with applications to user-
centric protocols,” In Proceedings of ICITS. 12 (2012).
[28] A. Charnes and W. Cooper, ”Programming with linear fractional functions,” Naval Re-search Logistics
Quarterly, (1962), 181–186.
[29] EB. Bajalinov, ”Linear-fractional programming theory, methods, applications and software,” Springer
Science Business Media, 2013.
Int J Pow Elec Dri Syst, Vol. 11, No. 1, March 2020 : 284 – 290