Blockchain technology has garnered significant attention from global organizations and researchers due to its potential as a solution for centralized system challenges.Concurrently,the Internet of Things(IoT)has revol...Blockchain technology has garnered significant attention from global organizations and researchers due to its potential as a solution for centralized system challenges.Concurrently,the Internet of Things(IoT)has revolutionized the Fourth Industrial Revolution by enabling interconnected devices to offer innovative services,ultimately enhancing human lives.This paper presents a new approach utilizing lightweight blockchain technology,effectively reducing the computational burden typically associated with conventional blockchain systems.By integrating this lightweight blockchain with IoT systems,substantial reductions in implementation time and computational complexity can be achieved.Moreover,the paper proposes the utilization of the Okamoto Uchiyama encryption algorithm,renowned for its homomorphic characteristics,to reinforce the privacy and security of IoT-generated data.The integration of homomorphic encryption and blockchain technology establishes a secure and decentralized platformfor storing and analyzing sensitive data of the supply chain data.This platformfacilitates the development of some business models and empowers decentralized applications to perform computations on encrypted data while maintaining data privacy.The results validate the robust security of the proposed system,comparable to standard blockchain implementations,leveraging the distinctive homomorphic attributes of the Okamoto Uchiyama algorithm and the lightweight blockchain paradigm.展开更多
Quantum multi-signature has attracted extensive attention since it was put forward.Beside its own improvement,related research is often combined with other quantum signature.However,this type of quantum signature has ...Quantum multi-signature has attracted extensive attention since it was put forward.Beside its own improvement,related research is often combined with other quantum signature.However,this type of quantum signature has one thing in common,that is,the generation and verification of signature depend heavily on the shared classical secret key.In order to increase the reliability of signature,the homomorphic aggregation technique is applied to quantum multi-signature,and then we propose a quantum homomorphic multi-signature protocol.Unlike previous quantum multi-signature protocols,this protocol utilizes homomorphic properties to complete signature generation and verification.In the signature generation phase,entanglement swapping is introduced,so that the individual signatures of multiple users are aggregated into a new multi-signature.The original quantum state is signed by the shared secret key to realize the verification of the signature in the verification phase.The signature process satisfies the homomorphic property,which can improve the reliability of the signature.展开更多
Multi-Source data plays an important role in the evolution of media convergence.Its fusion processing enables the further mining of data and utilization of data value and broadens the path for the sharing and dissemin...Multi-Source data plays an important role in the evolution of media convergence.Its fusion processing enables the further mining of data and utilization of data value and broadens the path for the sharing and dissemination of media data.However,it also faces serious problems in terms of protecting user and data privacy.Many privacy protectionmethods have been proposed to solve the problemof privacy leakage during the process of data sharing,but they suffer fromtwo flaws:1)the lack of algorithmic frameworks for specific scenarios such as dynamic datasets in the media domain;2)the inability to solve the problem of the high computational complexity of ciphertext in multi-source data privacy protection,resulting in long encryption and decryption times.In this paper,we propose a multi-source data privacy protection method based on homomorphic encryption and blockchain technology,which solves the privacy protection problem ofmulti-source heterogeneous data in the dissemination ofmedia and reduces ciphertext processing time.We deployed the proposedmethod on theHyperledger platformfor testing and compared it with the privacy protection schemes based on k-anonymity and differential privacy.The experimental results showthat the key generation,encryption,and decryption times of the proposedmethod are lower than those in data privacy protection methods based on k-anonymity technology and differential privacy technology.This significantly reduces the processing time ofmulti-source data,which gives it potential for use in many applications.展开更多
The mushroom growth of IoT has been accompanied by the generation of massive amounts of data.Subject to the limited storage and computing capabilities ofmost IoT devices,a growing number of institutions and organizati...The mushroom growth of IoT has been accompanied by the generation of massive amounts of data.Subject to the limited storage and computing capabilities ofmost IoT devices,a growing number of institutions and organizations outsource their data computing tasks to cloud servers to obtain efficient and accurate computation while avoiding the cost of local data computing.One of the most important challenges facing outsourcing computing is how to ensure the correctness of computation results.Linearly homomorphic proxy signature(LHPS)is a desirable solution to ensure the reliability of outsourcing computing in the case of authorized signing right.Blockchain has the characteristics of tamper-proof and traceability,and is a new technology to solve data security.However,as far as we know,constructions of LHPS have been few and far between.In addition,the existing LHPS scheme does not focus on homomorphic unforgeability and does not use blockchain technology.Herein,we improve the security model of the LHPS scheme,and the usual existential forgery and homomorphic existential forgery of two types of adversaries are considered.Under the new model,we present a blockchain-based LHPS scheme.The security analysis shows that under the adaptive chosen message attack,the unforgeability of the proposed scheme can be reduced to the CDH hard assumption,while achieving the usual and homomorphic existential unforgeability.Moreover,comparedwith the previous LHPS scheme,the performance analysis shows that our scheme has the same key size and comparable computational overhead,but has higher security.展开更多
In crowded cities,searching for the availability of parking lots is a herculean task as it results in the wastage of drivers’time,increases air pollution,and traffic congestion.Smart parking systems facilitate the dr...In crowded cities,searching for the availability of parking lots is a herculean task as it results in the wastage of drivers’time,increases air pollution,and traffic congestion.Smart parking systems facilitate the drivers to determine the information about the parking lot in real time and book them depending on the requirement.But the existing smart parking systems necessitate the drivers to reveal their sensitive information that includes their mobile number,personal identity,and desired destination.This disclosure of sensitive information makes the existing centralized smart parking systems more vulnerable to service providers’security breaches,single points of failure,and bottlenecks.In this paper,an Improved Asymmetric Consortium Blockchain and Homomorphically Computing Univariate Polynomial-based private information retrieval(IACB-HCUPPIR)scheme is proposed to ensure parking lots’availability with transparency security in a privacy-preserving smart parking system.In specific,an improved Asymmetric Consortium Blockchain is used for achieving secure transactions between different parties interacting in the smart parking environment.It further adopted the method of Homomorphically Computing Univariate Polynomial-based private information retrieval(HCUPPIR)scheme for preserving the location privacy of drivers.The results of IACB-HCUPPIR confirmed better results in terms of minimized computation and communication overload with throughput,latency,and response time with maximized drivers’privacy preservation.Moreover,the proposed fully homomorphic algorithm(FHE)was compared against partial-homomorphic encryption(PHE)and technique without encryption and found that the proposed model has quick communication in allocating the parking slots starting with 24.3 s,whereas PHE starts allocating from 24.7 s and the technique without encryption starts at 27.4 s.Thus,we ensure the proposed model performs well in allocating parking slots with less time and high security with privacy preservation.展开更多
Fog computing is a rapidly growing technology that aids in pipelining the possibility of mitigating breaches between the cloud and edge servers.It facil-itates the benefits of the network edge with the maximized probab...Fog computing is a rapidly growing technology that aids in pipelining the possibility of mitigating breaches between the cloud and edge servers.It facil-itates the benefits of the network edge with the maximized probability of offering interaction with the cloud.However,the fog computing characteristics are suscep-tible to counteract the challenges of security.The issues present with the Physical Layer Security(PLS)aspect in fog computing which included authentication,integrity,and confidentiality has been considered as a reason for the potential issues leading to the security breaches.In this work,the Octonion Algebra-inspired Non-Commutative Ring-based Fully Homomorphic Encryption Scheme(NCR-FHE)was proposed as a secrecy improvement technique to overcome the impersonation attack in cloud computing.The proposed approach was derived through the benefits of Octonion algebra to facilitate the maximum security for big data-based applications.The major issues in the physical layer security which may potentially lead to the possible security issues were identified.The potential issues causing the impersonation attack in the Fog computing environment were identified.The proposed approach was compared with the existing encryption approaches and claimed as a robust approach to identify the impersonation attack for the fog and edge network.The computation cost of the proposed NCR-FHE is identified to be significantly reduced by 7.18%,8.64%,9.42%,and 10.36%in terms of communication overhead for varying packet sizes,when compared to the benchmarked ECDH-DH,LHPPS,BF-PHE and SHE-PABF schemes.展开更多
We propose an unbounded fully homomorphic encryption scheme, i.e. a scheme that allows one to compute on encrypted data for any desired functions without needing to decrypt the data or knowing the decryption keys. Thi...We propose an unbounded fully homomorphic encryption scheme, i.e. a scheme that allows one to compute on encrypted data for any desired functions without needing to decrypt the data or knowing the decryption keys. This is a rational solution to an old problem proposed by Rivest, Adleman, and Dertouzos [1] in 1978, and to some new problems that appeared in Peikert [2] as open questions 10 and open questions 11 a few years ago. Our scheme is completely different from the breakthrough work [3] of Gentry in 2009. Gentry’s bootstrapping technique constructs a fully homomorphic encryption (FHE) scheme from a somewhat homomorphic one that is powerful enough to evaluate its own decryption function. To date, it remains the only known way of obtaining unbounded FHE. Our construction of an unbounded FHE scheme is straightforward and can handle unbounded homomorphic computation on any refreshed ciphertexts without bootstrapping transformation technique.展开更多
There are various challenges that are faced in group communication, so it is necessary to ensure session key. Key agreement is the fundamental cryptographic primitive for establishing a secure communication. It is a p...There are various challenges that are faced in group communication, so it is necessary to ensure session key. Key agreement is the fundamental cryptographic primitive for establishing a secure communication. It is a process of computing a shared secret contributed by two or more entities such that no single node can predetermine the resulting value. An authenticated key agreement is attained by combining the key agreement protocol with digital signatures. After a brief introduction to existing key agreement in group communication, Making use of the additive-multiplicative homomorphism in the integer ring defined by Sander and Tschudin: A new protocols, called the homomorphism key agreement, was designed, which can be self-contributory, robust, scalable and applicable in group communication.展开更多
Homomorphic encryption has giant advantages in the protection of privacy information.In this paper,we present a new kind of probabilistic quantum homomorphic encryption scheme for the universal quantum circuit evaluat...Homomorphic encryption has giant advantages in the protection of privacy information.In this paper,we present a new kind of probabilistic quantum homomorphic encryption scheme for the universal quantum circuit evaluation.Firstly,the pre-shared non-maximally entangled states are utilized as auxiliary resources,which lower the requirements of the quantum channel,to correct the errors in non-Clifford gate evaluation.By using the set synthesized by Clifford gates and T gates,it is feasible to perform the arbitrary quantum computation on the encrypted data.Secondly,our scheme is different from the previous scheme described by the quantum homomorphic encryption algorithm.From the perspective of application,a two-party probabilistic quantum homomorphic encryption scheme is proposed.It is clear what the computation and operation that the client and the server need to perform respectively,as well as the permission to access the data.Finally,the security of probabilistic quantum homomorphic encryption scheme is analyzed in detail.It demonstrates that the scheme has favorable security in three aspects,including privacy data,evaluated data and encryption and decryption keys.展开更多
With the rapid development of information network,the computing resources and storage capacity of ordinary users cannot meet their needs of data processing.The emergence of cloud computing solves this problem but brin...With the rapid development of information network,the computing resources and storage capacity of ordinary users cannot meet their needs of data processing.The emergence of cloud computing solves this problem but brings data security problems.How to manage and retrieve ciphertext data effectively becomes a challenging problem.To these problems,a new image retrieval method in ciphertext domain by block image encrypting based on Paillier homomophic cryptosystem is proposed in this paper.This can be described as follows:According to the Paillier encryption technology,the image owner encrypts the original image in blocks,obtains the image in ciphertext domain,then passes it to the third party server.The server calculates the difference histogram of the image in ciphertext domain according to the public key and establishes the index database.The user passes the retrieved image to the server.The server computes the differential histogram of the retrieved image by public key.Then,compares the similarity of it with the histogram in index database and selects larger similarity images in ciphertext and send them to the user.The user obtains the target image with the private key.The experimental results show that the method is feasible and simple.展开更多
Nowadays the computer vision technique has widely found applicationsin industrial manufacturing process to improve their efficiency. However, it ishardly applied in the field of daily ceramic detection due to the foll...Nowadays the computer vision technique has widely found applicationsin industrial manufacturing process to improve their efficiency. However, it ishardly applied in the field of daily ceramic detection due to the following twokey reasons: (1) Low detection accuracy as a result of ceramic glare, and (2) Lackof efficient detection algorithms. To tackle these problems, a homomorphic filtering based anti-glare ceramic decals defect detection technique is proposed in thispaper. Considering that smooth ceramic surface usually causes glare effects andleads to low detection results, in our approach, the ceramic samples are takenin low light environment and their luminance and details restored by a homomorphic filtering based image enhancement technique. With relatively high quality preprocessed images, an effective ceramic decal defect detection algorithm isthen designed to rapidly locate those out-of-bounds defects and further estimatetheir size. The experimental results show that the proposed scheme could achieveits desired performance.展开更多
Security insurance is a paramount cloud services issue in the most recent decade. Therefore, Mapreduce which is a programming framework for preparing and creating huge data collections should be optimized and securely...Security insurance is a paramount cloud services issue in the most recent decade. Therefore, Mapreduce which is a programming framework for preparing and creating huge data collections should be optimized and securely implemented. But, conventional operations on ciphertexts were not relevant. So there is a foremost need to enable particular sorts of calculations to be done on encrypted data and additionally optimize data processing at the Map stage. Thereby schemes like (DGHV) and (Gen 10) are presented to address data privacy issue. However private encryption key (DGHV) or key’s parameters (Gen 10) are sent to untrusted cloud server which compromise the information security insurance. Therefore, in this paper we propose an optimized homomorphic scheme (Op_FHE_SHCR) which speed up ciphertext (Rc) retrieval and addresses metadata dynamics and authentication through our secure Anonymiser agent. Additionally for the efficiency of our proposed scheme regarding computation cost and security investigation, we utilize a scalar homomorphic approach instead of applying a blinding probabilistic and polynomial-time calculation which is computationally expensive. Doing as such, we apply an optimized ternary search tries (TST) algorithm in our metadata repository which utilizes Merkle hash tree structure to manage metadata authentication and dynamics.展开更多
This research investigates the applications of homomorphic encryption systems in electronic voting schemes. We make use of Paillier cryptosystem which exhibits additive homomorphic properties. The other homomorphic cr...This research investigates the applications of homomorphic encryption systems in electronic voting schemes. We make use of Paillier cryptosystem which exhibits additive homomorphic properties. The other homomorphic cryptosystems RSA and Elgamal are not considered, since they exhibit only multiplicative homomorphic property. Our proposed method increases the level of security when compared to Elgamal method. It is more flexible when compared to previous schemes. We also propose data packing for efficient storage of election data. Finally, we demonstrate the advantages of the homomorphic encryption in voting schemes by comparing with other electronic voting scheme.展开更多
The homomorphic hash algorithm(HHA)is introduced to help on-the-fly verify the vireless sensor network(WSN)over-the-air programming(OAP)data based on rateless codes.The receiver calculates the hash value of a group of...The homomorphic hash algorithm(HHA)is introduced to help on-the-fly verify the vireless sensor network(WSN)over-the-air programming(OAP)data based on rateless codes.The receiver calculates the hash value of a group of data by homomorphic hash function,and then it compares the hash value with the receiving message digest.Because the feedback channel is deliberately removed during the distribution process,the rateless codes are often vulnerable when they face security issues such as packets contamination or attack.This method prevents contaminating or attack on rateless codes and reduces the potential risks of decoding failure.Compared with the SHA1 and MD5,HHA,which has a much shorter message digest,will deliver more data.The simulation results show that to transmit and verify the same amount of OAP data,HHA method sends 17.9% to 23.1%fewer packets than MD5 and SHA1 under different packet loss rates.展开更多
In this work, the homomorphism of the classic linear block code in linear network coding for the case of binary field and its extensions is studied. It is proved that the classic linear error-control block code is hom...In this work, the homomorphism of the classic linear block code in linear network coding for the case of binary field and its extensions is studied. It is proved that the classic linear error-control block code is homomorphic network error-control code in network coding. That is, if the source packets at the source node for a linear network coding are precoded using a linear block code, then every packet flowing in the network regarding to the source satisfies the same constraints as the source. As a consequence, error detection and correction can be performed at every intermediate nodes of multicast flow, rather than only at the destination node in the conventional way, which can help to identify and correct errors timely at the error-corrupted link and save the cost of forwarding error-corrupted data to the destination node when the intermediate nodes are ignorant of the errors. In addition, three examples are demonstrated which show that homomorphic linear code can be combined with homomorphic signature, McEliece public-key cryptosystem and unequal error protection respectively and thus have a great potential of practical utility.展开更多
In January 2015,the first quantum homomorphic signature scheme was proposed creatively.However,only one verifier is allowed to verify a signature once in this scheme.In order to support repeatable verification for gen...In January 2015,the first quantum homomorphic signature scheme was proposed creatively.However,only one verifier is allowed to verify a signature once in this scheme.In order to support repeatable verification for general scenario,we propose a new quantum homomorphic signature scheme with repeatable verification by introducing serial verification model and parallel verification model.Serial verification model solves the problem of signature verification by combining key distribution and Bell measurement.Parallel verification model solves the problem of signature duplication by logically treating one particle of an EPR pair as a quantum signature and physically preparing a new EPR pair.These models will be beneficial to the signature verification of general scenarios.Scheme analysis shows that both intermediate verifiers and terminal verifiers can successfully verify signatures in the same operation with fewer resource consumption,and especially the verified signature in entangled states can be used repeatedly.展开更多
The significant advantage of the quantum homomorphic encryption scheme is to ensure the perfect security of quantum private data.In this paper,a novel secure multiparty quantum homomorphic encryption scheme is propose...The significant advantage of the quantum homomorphic encryption scheme is to ensure the perfect security of quantum private data.In this paper,a novel secure multiparty quantum homomorphic encryption scheme is proposed,which can complete arbitrary quantum computation on the private data of multiple clients without decryption by an almost dishonest server.Firstly,each client obtains a secure encryption key through the measurement device independent quantum key distribution protocol and encrypts the private data by using the encryption operator and key.Secondly,with the help of the almost dishonest server,the non-maximally entangled states are preshared between the client and the server to correct errors in the homomorphic evaluation of T gates,so as to realize universal quantum circuit evaluation on encrypted data.Thirdly,from the perspective of the application scenario of secure multi-party computation,this work is based on the probabilistic quantum homomorphic encryption scheme,allowing multiple parties to delegate the server to perform the secure homomorphic evaluation.The operation and the permission to access the data performed by the client and the server are clearly pointed out.Finally,a concrete security analysis shows that the proposed multiparty quantum homomorphic encryption scheme can securely resist outside and inside attacks.展开更多
The privacy-preserving problem for distributed fusion estimation scheme is concerned in this paper.When legitimate user wants to obtain consistent information from multiple sensors,it always employs a fusion center(FC...The privacy-preserving problem for distributed fusion estimation scheme is concerned in this paper.When legitimate user wants to obtain consistent information from multiple sensors,it always employs a fusion center(FC)to gather local data and compute distributed fusion estimates(DFEs).Due to the existence of potential eavesdropper,the data exchanged among sensors,FC and user imperatively require privacy preservation.Hence,we propose a distributed confidentiality fusion structure against eavesdropper by using Paillier homomorphic encryption approach.In this case,FC cannot acquire real values of local state estimates,while it only helps calculate encrypted DFEs.Then,the legitimate user can successfully obtain the true values of DFEs according to the encrypted information and secret keys,which is based on the homomorphism of encryption.Finally,an illustrative example is provided to verify the effectiveness of the proposed methods.展开更多
Road networks have been used in a wide range of applications to reduces the cost of transportation and improve the quality of related services.The shortest road distance computation has been considered as one of the m...Road networks have been used in a wide range of applications to reduces the cost of transportation and improve the quality of related services.The shortest road distance computation has been considered as one of the most fundamental operations of road networks computation.To alleviate privacy concerns about location privacy leaks during road distance computation,it is desirable to have a secure and efficient road distance computation approach.In this paper,we propose two secure road distance computation approaches,which can compute road distance over encrypted data efficiently.An approximate road distance computation approach is designed by using Partially Homomorphic Encryption and road network set embedding.An exact road distance computation is built by using Somewhat Homomorphic Encryption and road network hypercube embedding.We implement our two road distance computation approaches,and evaluate them on the real cityscale road network.Evaluation results show that our approaches are accurate and efficient.展开更多
The public key of the integer homomorphic encryption scheme which was proposed by Van Dijk et al. is long, so the scheme is almost impossible to use in practice. By studying the scheme and Coron’s public key compress...The public key of the integer homomorphic encryption scheme which was proposed by Van Dijk et al. is long, so the scheme is almost impossible to use in practice. By studying the scheme and Coron’s public key compression technique, a scheme which is able to encrypt n bits plaintext once was obtained. The scheme improved the efficiency of the decrypting party and increased the number of encrypting parties, so it meets the needs of cloud computing better. The security of the scheme is based on the approximate GCD problem and the sparse-subset sum problem.展开更多
文摘Blockchain technology has garnered significant attention from global organizations and researchers due to its potential as a solution for centralized system challenges.Concurrently,the Internet of Things(IoT)has revolutionized the Fourth Industrial Revolution by enabling interconnected devices to offer innovative services,ultimately enhancing human lives.This paper presents a new approach utilizing lightweight blockchain technology,effectively reducing the computational burden typically associated with conventional blockchain systems.By integrating this lightweight blockchain with IoT systems,substantial reductions in implementation time and computational complexity can be achieved.Moreover,the paper proposes the utilization of the Okamoto Uchiyama encryption algorithm,renowned for its homomorphic characteristics,to reinforce the privacy and security of IoT-generated data.The integration of homomorphic encryption and blockchain technology establishes a secure and decentralized platformfor storing and analyzing sensitive data of the supply chain data.This platformfacilitates the development of some business models and empowers decentralized applications to perform computations on encrypted data while maintaining data privacy.The results validate the robust security of the proposed system,comparable to standard blockchain implementations,leveraging the distinctive homomorphic attributes of the Okamoto Uchiyama algorithm and the lightweight blockchain paradigm.
基金Project supported by the National Natural Science Foundation of China(Grant No.61762039).
文摘Quantum multi-signature has attracted extensive attention since it was put forward.Beside its own improvement,related research is often combined with other quantum signature.However,this type of quantum signature has one thing in common,that is,the generation and verification of signature depend heavily on the shared classical secret key.In order to increase the reliability of signature,the homomorphic aggregation technique is applied to quantum multi-signature,and then we propose a quantum homomorphic multi-signature protocol.Unlike previous quantum multi-signature protocols,this protocol utilizes homomorphic properties to complete signature generation and verification.In the signature generation phase,entanglement swapping is introduced,so that the individual signatures of multiple users are aggregated into a new multi-signature.The original quantum state is signed by the shared secret key to realize the verification of the signature in the verification phase.The signature process satisfies the homomorphic property,which can improve the reliability of the signature.
基金funded by the High-Quality and Cutting-Edge Discipline Construction Project for Universities in Beijing (Internet Information,Communication University of China).
文摘Multi-Source data plays an important role in the evolution of media convergence.Its fusion processing enables the further mining of data and utilization of data value and broadens the path for the sharing and dissemination of media data.However,it also faces serious problems in terms of protecting user and data privacy.Many privacy protectionmethods have been proposed to solve the problemof privacy leakage during the process of data sharing,but they suffer fromtwo flaws:1)the lack of algorithmic frameworks for specific scenarios such as dynamic datasets in the media domain;2)the inability to solve the problem of the high computational complexity of ciphertext in multi-source data privacy protection,resulting in long encryption and decryption times.In this paper,we propose a multi-source data privacy protection method based on homomorphic encryption and blockchain technology,which solves the privacy protection problem ofmulti-source heterogeneous data in the dissemination ofmedia and reduces ciphertext processing time.We deployed the proposedmethod on theHyperledger platformfor testing and compared it with the privacy protection schemes based on k-anonymity and differential privacy.The experimental results showthat the key generation,encryption,and decryption times of the proposedmethod are lower than those in data privacy protection methods based on k-anonymity technology and differential privacy technology.This significantly reduces the processing time ofmulti-source data,which gives it potential for use in many applications.
基金funded by the Special Innovation Project forGeneral Colleges and Universities in Guangdong Province (Grant No.2020KTSCX126).
文摘The mushroom growth of IoT has been accompanied by the generation of massive amounts of data.Subject to the limited storage and computing capabilities ofmost IoT devices,a growing number of institutions and organizations outsource their data computing tasks to cloud servers to obtain efficient and accurate computation while avoiding the cost of local data computing.One of the most important challenges facing outsourcing computing is how to ensure the correctness of computation results.Linearly homomorphic proxy signature(LHPS)is a desirable solution to ensure the reliability of outsourcing computing in the case of authorized signing right.Blockchain has the characteristics of tamper-proof and traceability,and is a new technology to solve data security.However,as far as we know,constructions of LHPS have been few and far between.In addition,the existing LHPS scheme does not focus on homomorphic unforgeability and does not use blockchain technology.Herein,we improve the security model of the LHPS scheme,and the usual existential forgery and homomorphic existential forgery of two types of adversaries are considered.Under the new model,we present a blockchain-based LHPS scheme.The security analysis shows that under the adaptive chosen message attack,the unforgeability of the proposed scheme can be reduced to the CDH hard assumption,while achieving the usual and homomorphic existential unforgeability.Moreover,comparedwith the previous LHPS scheme,the performance analysis shows that our scheme has the same key size and comparable computational overhead,but has higher security.
基金The research was funded by the School of Information Technology and Engineering,Vellore Institute of Technology,Vellore 632014,Tamil Nadu,India.
文摘In crowded cities,searching for the availability of parking lots is a herculean task as it results in the wastage of drivers’time,increases air pollution,and traffic congestion.Smart parking systems facilitate the drivers to determine the information about the parking lot in real time and book them depending on the requirement.But the existing smart parking systems necessitate the drivers to reveal their sensitive information that includes their mobile number,personal identity,and desired destination.This disclosure of sensitive information makes the existing centralized smart parking systems more vulnerable to service providers’security breaches,single points of failure,and bottlenecks.In this paper,an Improved Asymmetric Consortium Blockchain and Homomorphically Computing Univariate Polynomial-based private information retrieval(IACB-HCUPPIR)scheme is proposed to ensure parking lots’availability with transparency security in a privacy-preserving smart parking system.In specific,an improved Asymmetric Consortium Blockchain is used for achieving secure transactions between different parties interacting in the smart parking environment.It further adopted the method of Homomorphically Computing Univariate Polynomial-based private information retrieval(HCUPPIR)scheme for preserving the location privacy of drivers.The results of IACB-HCUPPIR confirmed better results in terms of minimized computation and communication overload with throughput,latency,and response time with maximized drivers’privacy preservation.Moreover,the proposed fully homomorphic algorithm(FHE)was compared against partial-homomorphic encryption(PHE)and technique without encryption and found that the proposed model has quick communication in allocating the parking slots starting with 24.3 s,whereas PHE starts allocating from 24.7 s and the technique without encryption starts at 27.4 s.Thus,we ensure the proposed model performs well in allocating parking slots with less time and high security with privacy preservation.
文摘Fog computing is a rapidly growing technology that aids in pipelining the possibility of mitigating breaches between the cloud and edge servers.It facil-itates the benefits of the network edge with the maximized probability of offering interaction with the cloud.However,the fog computing characteristics are suscep-tible to counteract the challenges of security.The issues present with the Physical Layer Security(PLS)aspect in fog computing which included authentication,integrity,and confidentiality has been considered as a reason for the potential issues leading to the security breaches.In this work,the Octonion Algebra-inspired Non-Commutative Ring-based Fully Homomorphic Encryption Scheme(NCR-FHE)was proposed as a secrecy improvement technique to overcome the impersonation attack in cloud computing.The proposed approach was derived through the benefits of Octonion algebra to facilitate the maximum security for big data-based applications.The major issues in the physical layer security which may potentially lead to the possible security issues were identified.The potential issues causing the impersonation attack in the Fog computing environment were identified.The proposed approach was compared with the existing encryption approaches and claimed as a robust approach to identify the impersonation attack for the fog and edge network.The computation cost of the proposed NCR-FHE is identified to be significantly reduced by 7.18%,8.64%,9.42%,and 10.36%in terms of communication overhead for varying packet sizes,when compared to the benchmarked ECDH-DH,LHPPS,BF-PHE and SHE-PABF schemes.
文摘We propose an unbounded fully homomorphic encryption scheme, i.e. a scheme that allows one to compute on encrypted data for any desired functions without needing to decrypt the data or knowing the decryption keys. This is a rational solution to an old problem proposed by Rivest, Adleman, and Dertouzos [1] in 1978, and to some new problems that appeared in Peikert [2] as open questions 10 and open questions 11 a few years ago. Our scheme is completely different from the breakthrough work [3] of Gentry in 2009. Gentry’s bootstrapping technique constructs a fully homomorphic encryption (FHE) scheme from a somewhat homomorphic one that is powerful enough to evaluate its own decryption function. To date, it remains the only known way of obtaining unbounded FHE. Our construction of an unbounded FHE scheme is straightforward and can handle unbounded homomorphic computation on any refreshed ciphertexts without bootstrapping transformation technique.
基金National Natural Science Foundation of China(No.90104005)
文摘There are various challenges that are faced in group communication, so it is necessary to ensure session key. Key agreement is the fundamental cryptographic primitive for establishing a secure communication. It is a process of computing a shared secret contributed by two or more entities such that no single node can predetermine the resulting value. An authenticated key agreement is attained by combining the key agreement protocol with digital signatures. After a brief introduction to existing key agreement in group communication, Making use of the additive-multiplicative homomorphism in the integer ring defined by Sander and Tschudin: A new protocols, called the homomorphism key agreement, was designed, which can be self-contributory, robust, scalable and applicable in group communication.
基金the Fundamental Research Funds for the Central Universities(Grant No.2019XDA02)the Scientific Research Foundation of North China University of Technology。
文摘Homomorphic encryption has giant advantages in the protection of privacy information.In this paper,we present a new kind of probabilistic quantum homomorphic encryption scheme for the universal quantum circuit evaluation.Firstly,the pre-shared non-maximally entangled states are utilized as auxiliary resources,which lower the requirements of the quantum channel,to correct the errors in non-Clifford gate evaluation.By using the set synthesized by Clifford gates and T gates,it is feasible to perform the arbitrary quantum computation on the encrypted data.Secondly,our scheme is different from the previous scheme described by the quantum homomorphic encryption algorithm.From the perspective of application,a two-party probabilistic quantum homomorphic encryption scheme is proposed.It is clear what the computation and operation that the client and the server need to perform respectively,as well as the permission to access the data.Finally,the security of probabilistic quantum homomorphic encryption scheme is analyzed in detail.It demonstrates that the scheme has favorable security in three aspects,including privacy data,evaluated data and encryption and decryption keys.
基金This work was supported in part by the Natural Science Foundation of China(No.61772234,61272414).
文摘With the rapid development of information network,the computing resources and storage capacity of ordinary users cannot meet their needs of data processing.The emergence of cloud computing solves this problem but brings data security problems.How to manage and retrieve ciphertext data effectively becomes a challenging problem.To these problems,a new image retrieval method in ciphertext domain by block image encrypting based on Paillier homomophic cryptosystem is proposed in this paper.This can be described as follows:According to the Paillier encryption technology,the image owner encrypts the original image in blocks,obtains the image in ciphertext domain,then passes it to the third party server.The server calculates the difference histogram of the image in ciphertext domain according to the public key and establishes the index database.The user passes the retrieved image to the server.The server computes the differential histogram of the retrieved image by public key.Then,compares the similarity of it with the histogram in index database and selects larger similarity images in ciphertext and send them to the user.The user obtains the target image with the private key.The experimental results show that the method is feasible and simple.
基金supported by the Science and Technology Projects,Quzhou City,China(2019K12,X.Chen,www.qz.gov.cn)National Natural Science Foundation of China(61762054 and 62062044,X.Chen)。
文摘Nowadays the computer vision technique has widely found applicationsin industrial manufacturing process to improve their efficiency. However, it ishardly applied in the field of daily ceramic detection due to the following twokey reasons: (1) Low detection accuracy as a result of ceramic glare, and (2) Lackof efficient detection algorithms. To tackle these problems, a homomorphic filtering based anti-glare ceramic decals defect detection technique is proposed in thispaper. Considering that smooth ceramic surface usually causes glare effects andleads to low detection results, in our approach, the ceramic samples are takenin low light environment and their luminance and details restored by a homomorphic filtering based image enhancement technique. With relatively high quality preprocessed images, an effective ceramic decal defect detection algorithm isthen designed to rapidly locate those out-of-bounds defects and further estimatetheir size. The experimental results show that the proposed scheme could achieveits desired performance.
文摘Security insurance is a paramount cloud services issue in the most recent decade. Therefore, Mapreduce which is a programming framework for preparing and creating huge data collections should be optimized and securely implemented. But, conventional operations on ciphertexts were not relevant. So there is a foremost need to enable particular sorts of calculations to be done on encrypted data and additionally optimize data processing at the Map stage. Thereby schemes like (DGHV) and (Gen 10) are presented to address data privacy issue. However private encryption key (DGHV) or key’s parameters (Gen 10) are sent to untrusted cloud server which compromise the information security insurance. Therefore, in this paper we propose an optimized homomorphic scheme (Op_FHE_SHCR) which speed up ciphertext (Rc) retrieval and addresses metadata dynamics and authentication through our secure Anonymiser agent. Additionally for the efficiency of our proposed scheme regarding computation cost and security investigation, we utilize a scalar homomorphic approach instead of applying a blinding probabilistic and polynomial-time calculation which is computationally expensive. Doing as such, we apply an optimized ternary search tries (TST) algorithm in our metadata repository which utilizes Merkle hash tree structure to manage metadata authentication and dynamics.
文摘This research investigates the applications of homomorphic encryption systems in electronic voting schemes. We make use of Paillier cryptosystem which exhibits additive homomorphic properties. The other homomorphic cryptosystems RSA and Elgamal are not considered, since they exhibit only multiplicative homomorphic property. Our proposed method increases the level of security when compared to Elgamal method. It is more flexible when compared to previous schemes. We also propose data packing for efficient storage of election data. Finally, we demonstrate the advantages of the homomorphic encryption in voting schemes by comparing with other electronic voting scheme.
基金Supported by the National Science and Technology Support Program(Y2140161A5)the National High Technology Research and Development Program of China(863Program)(O812041A04)
文摘The homomorphic hash algorithm(HHA)is introduced to help on-the-fly verify the vireless sensor network(WSN)over-the-air programming(OAP)data based on rateless codes.The receiver calculates the hash value of a group of data by homomorphic hash function,and then it compares the hash value with the receiving message digest.Because the feedback channel is deliberately removed during the distribution process,the rateless codes are often vulnerable when they face security issues such as packets contamination or attack.This method prevents contaminating or attack on rateless codes and reduces the potential risks of decoding failure.Compared with the SHA1 and MD5,HHA,which has a much shorter message digest,will deliver more data.The simulation results show that to transmit and verify the same amount of OAP data,HHA method sends 17.9% to 23.1%fewer packets than MD5 and SHA1 under different packet loss rates.
基金supported by Natural Science Foundation of China (No.61271258)
文摘In this work, the homomorphism of the classic linear block code in linear network coding for the case of binary field and its extensions is studied. It is proved that the classic linear error-control block code is homomorphic network error-control code in network coding. That is, if the source packets at the source node for a linear network coding are precoded using a linear block code, then every packet flowing in the network regarding to the source satisfies the same constraints as the source. As a consequence, error detection and correction can be performed at every intermediate nodes of multicast flow, rather than only at the destination node in the conventional way, which can help to identify and correct errors timely at the error-corrupted link and save the cost of forwarding error-corrupted data to the destination node when the intermediate nodes are ignorant of the errors. In addition, three examples are demonstrated which show that homomorphic linear code can be combined with homomorphic signature, McEliece public-key cryptosystem and unequal error protection respectively and thus have a great potential of practical utility.
基金This project was supported by the National Natural Science Foundation of China(No.61571024)the National Key Research and Development Program of China(No.2016YFC1000307)for valuable helps.
文摘In January 2015,the first quantum homomorphic signature scheme was proposed creatively.However,only one verifier is allowed to verify a signature once in this scheme.In order to support repeatable verification for general scenario,we propose a new quantum homomorphic signature scheme with repeatable verification by introducing serial verification model and parallel verification model.Serial verification model solves the problem of signature verification by combining key distribution and Bell measurement.Parallel verification model solves the problem of signature duplication by logically treating one particle of an EPR pair as a quantum signature and physically preparing a new EPR pair.These models will be beneficial to the signature verification of general scenarios.Scheme analysis shows that both intermediate verifiers and terminal verifiers can successfully verify signatures in the same operation with fewer resource consumption,and especially the verified signature in entangled states can be used repeatedly.
基金This work was supported by the Open Fund of Advanced Cryptography and System Security Key Laboratory of Sichuan Province(Grant No.SKLACSS-202101)NSFC(Grant Nos.62176273,61962009)+3 种基金the Foundation of Guizhou Provincial Key Laboratory of Public Big Data(No.2019BDKFJJ010,2019BDKFJJ014)the Fundamental Re-search Funds for Beijing Municipal Commission of Education,Beijing Urban Governance Re-search Base of North China University of Technology,the Natural Science Foundation of Inner Mongolia(2021MS06006)Baotou Kundulun District Science and technology plan project(YF2020013)Inner Mongolia discipline inspection and supervision big data laboratory open project fund(IMDBD2020020).
文摘The significant advantage of the quantum homomorphic encryption scheme is to ensure the perfect security of quantum private data.In this paper,a novel secure multiparty quantum homomorphic encryption scheme is proposed,which can complete arbitrary quantum computation on the private data of multiple clients without decryption by an almost dishonest server.Firstly,each client obtains a secure encryption key through the measurement device independent quantum key distribution protocol and encrypts the private data by using the encryption operator and key.Secondly,with the help of the almost dishonest server,the non-maximally entangled states are preshared between the client and the server to correct errors in the homomorphic evaluation of T gates,so as to realize universal quantum circuit evaluation on encrypted data.Thirdly,from the perspective of the application scenario of secure multi-party computation,this work is based on the probabilistic quantum homomorphic encryption scheme,allowing multiple parties to delegate the server to perform the secure homomorphic evaluation.The operation and the permission to access the data performed by the client and the server are clearly pointed out.Finally,a concrete security analysis shows that the proposed multiparty quantum homomorphic encryption scheme can securely resist outside and inside attacks.
基金supported in part by the National Natural Sci-ence Foundation of China(No.61973277)in part by the Zhejiang Provincial Natural Science Foundation of China(No.LR20F030004)in part by the Major Key Project of PCL(No.PCL2021A09).
文摘The privacy-preserving problem for distributed fusion estimation scheme is concerned in this paper.When legitimate user wants to obtain consistent information from multiple sensors,it always employs a fusion center(FC)to gather local data and compute distributed fusion estimates(DFEs).Due to the existence of potential eavesdropper,the data exchanged among sensors,FC and user imperatively require privacy preservation.Hence,we propose a distributed confidentiality fusion structure against eavesdropper by using Paillier homomorphic encryption approach.In this case,FC cannot acquire real values of local state estimates,while it only helps calculate encrypted DFEs.Then,the legitimate user can successfully obtain the true values of DFEs according to the encrypted information and secret keys,which is based on the homomorphism of encryption.Finally,an illustrative example is provided to verify the effectiveness of the proposed methods.
基金This work was partially supported by National Natural Science Foundation of China(Grant Nos.61601146,61732022)National Key R&D Program of China(Grant No.2016QY05X1000).
文摘Road networks have been used in a wide range of applications to reduces the cost of transportation and improve the quality of related services.The shortest road distance computation has been considered as one of the most fundamental operations of road networks computation.To alleviate privacy concerns about location privacy leaks during road distance computation,it is desirable to have a secure and efficient road distance computation approach.In this paper,we propose two secure road distance computation approaches,which can compute road distance over encrypted data efficiently.An approximate road distance computation approach is designed by using Partially Homomorphic Encryption and road network set embedding.An exact road distance computation is built by using Somewhat Homomorphic Encryption and road network hypercube embedding.We implement our two road distance computation approaches,and evaluate them on the real cityscale road network.Evaluation results show that our approaches are accurate and efficient.
文摘The public key of the integer homomorphic encryption scheme which was proposed by Van Dijk et al. is long, so the scheme is almost impossible to use in practice. By studying the scheme and Coron’s public key compression technique, a scheme which is able to encrypt n bits plaintext once was obtained. The scheme improved the efficiency of the decrypting party and increased the number of encrypting parties, so it meets the needs of cloud computing better. The security of the scheme is based on the approximate GCD problem and the sparse-subset sum problem.