Collaborative Generations Of Sm9 Private Key And Digital Signature Using Homomorphic Encryption

2020 ◽  
Author(s):  
Yihong Long ◽  
Feng Xiong
Keyword(s):  
Digital Signature ◽  
Homomorphic Encryption ◽  
Private Key

scholarly journals LWR-Based Fully Homomorphic Encryption, Revisited

2018 ◽  
Vol 2018 ◽  
pp. 1-12 ◽  
Author(s):  
Fucai Luo ◽  
Fuqun Wang ◽  
Kunpeng Wang ◽  
Jie Li ◽  
Kefei Chen
Keyword(s):  
Tensor Product ◽  
Gaussian Noise ◽  
Homomorphic Encryption ◽  
Matrix Multiplication ◽  
Public Key ◽  
Multiparty Computation ◽  
Secret Key ◽  
Fully Homomorphic Encryption ◽  
Private Key ◽  
Modulus Problem

Very recently, Costache and Smart proposed a fully homomorphic encryption (FHE) scheme based on the Learning with Rounding (LWR) problem, which removes the noise (typically, Gaussian noise) sampling needed in the previous lattices-based FHEs. But their scheme did not work, since the noise of homomorphic multiplication is complicated and large, which leads to failure of decryption. More specifically, they chose LWR instances as a public key and the private key therein as a secret key and then used the tensor product to implement homomorphic multiplication, which resulted in a tangly modulus problem. Recall that there are two moduli in the LWR instances, and then the moduli will tangle together due to the tensor product. Inspired by their work, we built the first workable LWR-based FHE scheme eliminating the tangly modulus problem by cleverly adopting the celebrated approximate eigenvector method proposed by Gentry et al. at Crypto 2013. Roughly speaking, we use a specific matrix multiplication to perform the homomorphic multiplication, hence no tangly modulus problem. Furthermore, we also extend the LWR-based FHE scheme to the multikey setting using the tricks used to construct LWE-based multikey FHE by Mukherjee and Wichs at Eurocrypt 2016. Our LWR-based multikey FHE construction provides an alternative to the existing multikey FHEs and can also be applied to multiparty computation with higher efficiency.

New Algorithm to Reduce File Size and Bandwidth of Hashed Digital Signature for Image Steganography Using LSB

2014 ◽  
Vol 980 ◽  
pp. 194-197
Author(s):  
Erfaneh Noroozi ◽  
Salwani Bt Mohd Daud ◽  
Ali Sabouhi ◽  
Mohammad Reza Salehnamadi
Keyword(s):  
Digital Signature ◽  
Image Steganography ◽  
Sensitive Information ◽  
Multi Agent Systems ◽  
File Size ◽  
Agent Systems ◽  
Private Key ◽  
Simple Implementation ◽  
Multi Agent ◽  
Original File

In computer cryptography, digital signature is one of the best cryptography systems. Public-private keys are used to pass sensitive information however it can also be used to provide authentication on the particulars of a sender. Proposed algorithm is a new design and simple implementation mechanism for producing a digital signature. Some applications such as multi agent systems transferred data with small size and capacity. The new scheme minimizes the size of original file and gives us a dynamic and smaller hashed message output. In this algorithm load the original files then hashed the message and encode it with the private key of sender. Finally modify the established code into a unique digital signature at Base 16. We concentrate on designing and implementation of functions of algorithm.

scholarly journals Privacy Preserving Using Extended Euclidean Algorithm Applied To RSA-Homomorphic Encryption Technique

2019 ◽  
Vol 8 (10) ◽  
pp. 3175-3179
Keyword(s):  
Homomorphic Encryption ◽  
Euclidean Algorithm ◽  
Sensitive Information ◽  
Brute Force ◽  
Confidential Information ◽  
Security Applications ◽  
Private Key ◽  
Extended Euclidean Algorithm ◽  
Cryptographic Algorithms ◽  
Important Challenge

Communication of confidential information over Internet is the key aspect of security applications. Providing protection to sensitive information is of major concern. Many cryptographic algorithms have been in use for providing security of confidential information. Providing security for data has become major challenge in this era. Classical cryptography is playing a major role in providing security for applications. In modern days securing confidential information in the cloud is considered as an important challenge. Homomorphic Encryption technique is one of the best solutions that provide security in the cloud[1]. In this paper, Extended Euclidean Algorithm is used for generating keys. This technique follows RSA Homomorphic encryption technique. .RSA Homomorphic encryption using Extended Euclidean algorithm (RSA-HEEEA) is secure when compared to RSA as it based on the generation of private key which makes the algorithm complex .This technique of using Extended Euclidean Algorithm(EEA) is fast and secure when compared to RSA homomorphic encryption technique. The encryption process utilizes modulo operator which gives security as well.The beauty of this algorithm is in generation of private key which uses Extended Euclidean Algorithm (EEA) that helps in avoiding brute force attacks. Also, this technique uses Homomorphic operations which gives enhance security to confidential information in the cloud

scholarly journals Towards a New Algorithm to Optimize IPv6 Neighbor Discovery Security for Small Objects Networks

2018 ◽  
Vol 2018 ◽  
pp. 1-11 ◽  
Author(s):  
Ali El Ksimi ◽  
Cherkaoui Leghris
Keyword(s):  
Digital Signature ◽  
Success Probability ◽  
Neighbor Discovery ◽  
Small Object ◽  
Detection Process ◽  
Private Key ◽  
Duplicate Address Detection ◽  
Address Configuration

In order to verify the uniqueness of link-local or unicast addresses, nodes must perform a Duplicate Address Detection process before using them. However, this process is subject to many attacks and the security is willing to be the most important issues in Small Object Networks with IPv6. In this paper, we developed a new algorithm to optimize the security in IPv6-DAD process; this method is based on SHA-512 to verify the identity of the Neighbor Discovery messages transmitted in the link local. First, before sending the NS message, the new node uses the function SHA-512 to hash to the target address and use the last 64 bits in a new field and then encrypt the result with its private key. When receiving the secure message, the existing nodes decrypt it. Our algorithm is going to secure the DAD process by using a digital signature. Overall, this algorithm showed a significant effect in terms of the Address Configuration Success Probability (ACSP).

Email Security and PGP Technical Analysis

2012 ◽  
Vol 546-547 ◽  
pp. 1075-1079
Author(s):  
Chun Ying Gu ◽  
Rui Ying Fang
Keyword(s):  
Digital Signature ◽  
Technical Analysis ◽  
Generation Process ◽  
Transmission Method ◽  
Private Key ◽  
Encryption And Decryption ◽  
Secure Email ◽  
Pair Generation

Currently, Email is one of the most popular applications in people’s life. A secure email requires that the email system can provide encryption and digital signature, PGP is a popular email encryption and transmission method, the paper gives a brief overview of email security, details the PGP algorithm, function, encryption and decryption process and public/private key pair generation process, and analysis’s Security of PGP.

scholarly journals A novel secure biomedical data aggregation using fully homomorphic encryption in WSN

2021 ◽  
Vol 24 (1) ◽  
pp. 428
Author(s):  
Chethana G. ◽  
Padmaja K. V.
Keyword(s):  
Digital Signature ◽  
Data Aggregation ◽  
Homomorphic Encryption ◽  
Fractional Part ◽  
Expansion Ratio ◽  
Signature Verification ◽  
Biomedical Data ◽  
Fully Homomorphic Encryption ◽  
Negative Numbers ◽  
Encryption And Decryption

A new method of secure data aggregation for decimal data having integer as well as fractional part using homomorphic encryption is described. The proposed homomorphic encryption provides addition, subtraction, multiplication, division and averaging operations in the cipher domain for both positive and negative numbers. The scheme uses integer matrices in finite field Zp as encryption and decryption keys. An embedded Digital signature along with data provides data integrity and authentication by signature verification at the receiving end. The proposed scheme is immune to chosen plaintext and chosen ciphertext attacks. In the case of homomorphic multiplication, the ciphertext expansion ratio grows linearly with the data size. The computational complexity of the proposed method for multiplication and division is relatively less by 22.87% compared to Brakerski and Vaikantanathan method when the size of the plaintext data is ten decimal digits.

scholarly journals Secure Electronic Voting using Block Chain and Homomorphic Encryption

2019 ◽  
Vol 8 (2S11) ◽  
pp. 1002-1007
Keyword(s):  
Data Storage ◽  
Homomorphic Encryption ◽  
Security And Privacy ◽  
Electronic Voting ◽  
Private Key ◽  
Blockchain Technology ◽  
Voting System ◽  
Encryption Algorithms ◽  
Electronic Voting System ◽  
Robust Consensus

Blockchain is the technology that has attracted enormous interest recently as it provides security and privacy through immutable distributed ledger. It is the backbone of the most popular cryptocurrency, bitcoin. Due to its robust consensus mechanism and tamper proof data storage, it is widely adopted in the applications where trust is given utmost importance.Homomorphic Encryption algorithms can be used to operate on the data that is encrypted without the knowledge of private key. Operations can be performed on encrypted data without decrypting the data. Only client knows about the private key. These two technologies can be used to securely transfer and store data in the cloud systems.In this paper we propose how this blockchain technology and homomorphic encryption can be used to build reliable, tamper-proof and efficient electronic voting system. An electronic voting system should be secure, and itshould not allow duplicate votes and be fully tamper proof, while protecting the privacy of the voters. In this work, we have designed, implemented and tested an electronic voting application and providing hashing for votes and stored in blockchaincloud.If data in database is lost, then it can be retrieved from blockchain cloud.

Sign in / Sign up

Export Citation Format

Share Document