Filters








2,243 Hits in 1.7 sec

Acceleration of Homomorphic Arithmetic Processing Based on the ElGamal Cryptosystem

Takuma Jogan, Tomofumi Matsuzawa, Masayuki Takeda
2019 Communications and Network  
Therefore, in this paper, we propose an arithmetic processing method that can perform an arbitrary number of homomorphic addition and multiplication operations based on ElGamal cryptosystem.  ...  a 15% reduction. 2 Enc m m can be obtained without plaintext or a secret key, where is a binary operator such as addition or multiplication.  ...  Conflicts of Interest The authors declare no conflicts of interest regarding the publication of this paper.  ... 
doi:10.4236/cn.2019.111001 fatcat:5una2uunyje7ffazgxodwpefea

ELGAMAL DIGITAL SIGNATURE SCHEME WITH INTEGRATED CFEA-TECHNIQUE

Arif Mandangan, Che Haziqah Che Hussin, Chang Ee Hung
2016 Jurnal Teknologi  
By integrating the CFEA-technique into the ElGamal Digital Signature Scheme, any number of documents can be compressed becomes a pair of documents.  ...  One of the most established cryptography schemes is ElGamal cryptosystem. The original version of this cryptosystem is to provide confidentiality through encryption and decryption procedures.  ...  As we can see, most of the works are focused on the improvement of the security and efficiency of cryptography schemes. In addition, the proposed schemes also must be easy to be implemented.  ... 
doi:10.11113/jt.v78.8972 fatcat:puvgy6kdpndydmfg6sqoyfmzmy

Improving One-Time Pad Algorithm on Shamir's Three-Pass Protocol Scheme by Using RSA and ElGamal Algorithms

Agung Purnomo Sidik, Syahril Efendi, Suherman Suherman
2019 Journal of Physics, Conference Series  
Although the processing time of three pass protocol increases, but the longer the plaintext character the closer the processing time ratio to one.  ...  But it is not easy if RSA and ElGamal algorithms use the big prime number.  ...  The paper has proposed three-pass protocol modification using the RSA and ElGamal algorithms.  ... 
doi:10.1088/1742-6596/1235/1/012007 fatcat:k5b4xjvymvcfheojck4lot42ti

Comprehensive Performance Analysis of Homomorphic Cryptosystems for Practical Data Processing [article]

Vasily Sidorov
2022 arXiv   pre-print
For this work we chose the following five cryptosystems: fully homomorphic HElib and SEAL, somewhat fully homomorphic PyAono, and partially homomorphic Paillier and ElGamal.  ...  As part of a project aimed at developing a practical homomorphic data management platform, we have conducted an extensive study of homomorphic cryptosystems' performance, the results of which are presented  ...  In its base form, the Paillier cryptosystem is only capable of homomorphic addition of ciphertexts and multiplication by a plaintext constant.  ... 
arXiv:2202.02960v1 fatcat:pj6zpgf6kzhgzis7xdofceaj4a

Two-Layer Encryption based on Paillier and ElGamal Cryptosystem for Privacy Violation

Anjan K Koundinya, Department of CSE, BMS Institue of Technology and Management, Bangalore., Gautham SK
2021 International Journal of Wireless and Microwave Technologies  
This paper represents the implementation of two-layer cryptosystem using paillier and elgamal algorithm both following asymmetric encryption.  ...  Additive homomorphism is used in paillier cryptosystem which is used in fields like secure biometrics and electronic voting.  ...  Probabilistic property, which means that the attacker can never find out whether the two-cipher text belongs to the same plaintext. 3. It contains additive homomorphic properties [9] .  ... 
doi:10.5815/ijwmt.2021.03.02 fatcat:n2ghieacfzenrmy2z4jvrw2mci

Restructuring of Discrete Logarithm Problem and ElGamal Cryptosystem by Using the Power Fibonacci Sequence Module M [article]

Cagla Ozyilmaz, Ayse Nalli
2018 arXiv   pre-print
Lastly, we have compared that ElGamal Cryptosystem and a new cryptosystem which we constitute in terms of cryptography and we have obtained that a new cryptosystem is more advantageuos than ElGamal Cryptosystem  ...  Hence, we have obtained a new cryptosystem as ElGamal Cryptosystem.  ...  In addition one of two limits in the ElGamal cryptosystem is that the plaintext must be less than p − 1 [5] .  ... 
arXiv:1807.08613v1 fatcat:wipnkiwbozbpbdp67q67hxkthy

Optimistic Mixing for Exit-Polls [chapter]

Philippe Golle, Sheng Zhong, Dan Boneh, Markus Jakobsson, Ari Juels
2002 Lecture Notes in Computer Science  
This back-up mixing can be implemented using any one of a wide array of already proposed (but slower) mix networks.  ...  When all goes well, our mix net is the fastest, both in real terms and asymptotically, of all those that offer standard guarantees of privacy and correctness.  ...  In addition, each mix net must give a proof that the product of the plaintexts of all its inputs equals the product of the plaintexts of all its outputs. 1.  ... 
doi:10.1007/3-540-36178-2_28 fatcat:emclj2wgcrbjxa75xbd2iz6ylm

A Robust and Plaintext-Aware Variant of Signed ElGamal Encryption [chapter]

Yannick Seurin, Joana Treger
2013 Lecture Notes in Computer Science  
The second approach is to add a non-interactive proof of knowledge of the random integer r used to encrypt the plaintext, with the hope to make the scheme plaintext-aware.  ...  The most natural idea is to add a Schnorr signature [Sch91] to the ciphertext, as was proposed in [Jak98,TY98]: to encrypt a message M ∈ G, in addition to the usual ElGamal ciphertext R = G r , Y = M X  ...  Additionally, we show that TDH1 is not (weakly) robust and that TDH2 is not ANON-CPA-secure. C.1 The TDH1 encryption scheme The TDH1 requires an additional random oracle H G : G 3 → G.  ... 
doi:10.1007/978-3-642-36095-4_5 fatcat:p7dlfmcnxba4re7nhupb73kq6m

Addition of El Gamal Plaintexts [chapter]

Markus Jakobsson, Ari Juels
2000 Lecture Notes in Computer Science  
We introduce an efficient method for performing computation on encrypted data, allowing addition of ElGamal encrypted plaintexts.  ...  Our focus is on a three-player solution, but we also consider generalization to a larger number of players. The amount of work is exponential in the number of players, but reasonable for small sets.  ...  In this paper, we propose the first efficient solution for performing the operation of distributed ElGamal plaintext addition.  ... 
doi:10.1007/3-540-44448-3_26 fatcat:cjrpb2aslvhi3hnweb3us7k3iq

Survey of Various Homomorphic Encryption algorithms and Schemes

Payal V.Parmar, Shraddha B. Padhar, Shafika N. Patel, Niyatee I. Bhatt, Rutvij H. Jhaveri
2014 International Journal of Computer Applications  
The case study on various principles and properties of homomorphic encryption is given and then various homomorphic algorithms using asymmetric key systems such as RSA, ElGamal, Paillier algorithms as  ...  When the data is transferred to the public area, there are many encryption algorithms to secure the operations and the storage of the data.  ...  the additive property of homomorphic encryption while ElGamal and RSA can be used for multiplicative property.  ... 
doi:10.5120/15902-5081 fatcat:x5y7cns7k5bbbjacyg3skl6xlu

Encoding-Free ElGamal Encryption Without Random Oracles [chapter]

Benoît Chevallier-Mames, Pascal Paillier, David Pointcheval
2006 Lecture Notes in Computer Science  
plaintext bits or may partially destroy homomorphicity.  ...  Its practical use, unfortunately, is intricate: plaintexts have to be encoded into group elements before encryption, thereby requiring awkward and ad hoc conversions which strongly limit the number of  ...  Acknowledgements The first author would like to thank Jean-François Dhem and Philippe Proust, as well as his colleague Eric Brier for fruitful and enjoying discussions about the difficulty of the DCDH  ... 
doi:10.1007/11745853_7 fatcat:bi4fbdagzbfc3oy6siceshsatm

Modified ElGamal Elliptic Curve Cryptosystem using Hexadecimal Representation

Ziad E. Dawahdeh, Shahrul N. Yaakob, Ali Makki Sagheer
2015 Indian Journal of Science and Technology  
This modification converts each character of the plaintext message to its hexadecimal ASCII value of two digits, then separates the value into two values.  ...  This transformation is used to modify ElGamal Elliptic Curve Cryptosystem (EGECC) to encrypt / decrypt the message.  ...  In this work, a modified method that uses ElGamal ECC for encryption and decryption of the plaintext has been proposed.  ... 
doi:10.17485/ijst/2015/v8i15/64749 fatcat:25salx5cwvd25cwrczhmcpbpia

Cryptanalysis on an Improved Version of ElGamal-Like Public-Key Encryption Scheme for Encrypting Large Messages

Ting-Yi Chang, Min-Shiang Hwang, Wei-Pang Yang
2012 Informatica  
s ElGamal-like scheme is not equivalent to the original ElGamal scheme and brings about the disadvantage of possible unsuccessful decryption.  ...  s ElGamal-like scheme to repair the weakness and reduce the probability of unsuccessful decryption.  ...  Part of this research was supported by the National Science Council, Taiwan  ... 
doi:10.15388/informatica.2012.374 fatcat:xbj37k73xvcapfzlluu35xstzm

Targeted fully homomorphic encryption based on a Double Decryption Algorithm for polynomials

Yatao Yang, Shuang Zhang, Junming Yang, Jia Li, Zichen Li
2014 Tsinghua Science and Technology  
Proof of semantic security is also demonstrated.  ...  Inspired by ElGamal and BGN cryptography, we obtain the desired fully homomorphic property by selecting a new group and adding an extra component to the ciphertext.  ...  Theorem 4 One can obtain additive homomorphism by placing the plaintext at the location of the exponent.  ... 
doi:10.1109/tst.2014.6919824 fatcat:bstksd2645bipelcjj3rzgunw4

A Like ELGAMAL Cryptosystem But Resistant To Post-Quantum Attacks

Ahmed EL-YAHYAOUI, Fouzia OMARY
2022 International Journal of Communication Networks and Information Security  
However, the imminent arrival of quantum computing threatens the security of ELGAMAL cryptosystem and impose to cryptologists to prepare a resilient algorithm to quantum computer-based attacks.  ...  The ELGAMAL encryption scheme is a well-known and efficient public key algorithm designed by Taher ELGAMAL from discrete logarithm problem.  ...  In fact, if we add two ciphertexts, the obtained ciphertext will be the encrypted result of the addition of the two underlying original plaintexts. i.e. 𝐶 ⊕ 𝐶 ′ = 𝐸(𝑀) ⊕ 𝐸(𝑀 ′ ) = 𝐸(𝑀 ⊕ 𝑀′).  ... 
doi:10.17762/ijcnis.v14i1.5180 fatcat:powkalh5g5emlkciebzeau2cgi
« Previous Showing results 1 — 15 out of 2,243 results