Searchable public key encryption is a useful cryptographic paradigm that enables an untrustworthy server to retrieve the encrypted data without revealing the contents of the data. It offers a promising solution to enc...Searchable public key encryption is a useful cryptographic paradigm that enables an untrustworthy server to retrieve the encrypted data without revealing the contents of the data. It offers a promising solution to encrypted data retrieval in cryptographic cloud storage. Certificateless public key cryptography (CLPKC) is a novel cryptographic primitive that has many merits. It overcomes the key escrow problem in identity-based cryptography (IBC) and the cumbersome certificate problem in conventional public key cryptography (PKC). Motivated by the appealing features of CLPKC, several certificateless encryption with keyword search (CLEKS) schemes have been presented in the literature. But, our cryptanalysis demonstrates that the previously proposed CLEKS frameworks suffer from the security vulnerability caused by the keyword guessing attack. To remedy the security weakness in the previous frameworks and provide resistance against both inside and outside keyword guessing attacks, we propose a new CLEKS framework. Under the new framework, we design a concrete CLEKS scheme and formally prove its security in the random oracle model. Compared with previous two CLEKS schemes, the proposed scheme has better overall performance while offering stronger security guarantee as it withstands the existing known types of keyword guessing attacks.展开更多
Combining with the research on the linear complexity of explicit nonlinear generators of pseudorandom sequences, we study the stability on linear complexity of two classes of explicit inversive generators and two clas...Combining with the research on the linear complexity of explicit nonlinear generators of pseudorandom sequences, we study the stability on linear complexity of two classes of explicit inversive generators and two classes of explicit nonlinear generators. We present some lower bounds in theory on the k-error linear complexity of these explicit generatol's, which further improve the cryptographic properties of the corresponding number generators and provide very useful information when they are applied to cryptography.展开更多
The Internet of Things(IoT)has profoundly impacted our lives and has greatly revolutionized our lifestyle.The terminal devices in an IoT data aggregation application sense real-time data for the remote cloud server to...The Internet of Things(IoT)has profoundly impacted our lives and has greatly revolutionized our lifestyle.The terminal devices in an IoT data aggregation application sense real-time data for the remote cloud server to achieve intelligent decisions.However,the high frequency of collecting user data will raise people concerns about personal privacy.In recent years,many privacy-preserving data aggregation schemes have been proposed.Unfortunately,most existing schemes cannot support either arbitrary aggregation functions,or dynamic user group management,or fault tolerance.In this paper,we propose an efficient and privacy-preserving data aggregation scheme.In the scheme,we design a lightweight encryption method to protect the user privacy by using a ring topology and a random location sequence.On this basis,the proposed scheme supports not only arbitrary aggregation functions,but also flexible dynamic user management.Furthermore,the scheme achieves faulttolerant capabilities by utilizing a future data buffering mechanism.Security analysis reveals that the scheme can achieve the desired security properties,and experimental evaluation results show the scheme's efficiency in terms of computational and communication overhead.展开更多
In order to ensure the security of information systems, it's essential to make sure that system behaviors are trusted. By analyzing threats that exist in executing procedures, a trust model based on structured pro...In order to ensure the security of information systems, it's essential to make sure that system behaviors are trusted. By analyzing threats that exist in executing procedures, a trust model based on structured protection is proposed. We consider that functional components, system actions and message flows between components are three key factors of information systems. Structured protection requirements on components, connections and action parameters are also provided. Four trusted properties of the model are deducted through formal analysis, and trusted system behavior is defined based on these properties. Furthermore, decision theorem of trusted system behavior is proved. The developed prototype system indicates the model is practical. It is a general theory model built on logic deduction and independent on specific environment and the behaviors of the system designed and implemented following the model are trusted.展开更多
With the maturity and development of 5G field,Mobile Edge CrowdSensing(MECS),as an intelligent data collection paradigm,provides a broad prospect for various applications in IoT.However,sensing users as data uploaders...With the maturity and development of 5G field,Mobile Edge CrowdSensing(MECS),as an intelligent data collection paradigm,provides a broad prospect for various applications in IoT.However,sensing users as data uploaders lack a balance between data benefits and privacy threats,leading to conservative data uploads and low revenue or excessive uploads and privacy breaches.To solve this problem,a Dynamic Privacy Measurement and Protection(DPMP)framework is proposed based on differential privacy and reinforcement learning.Firstly,a DPM model is designed to quantify the amount of data privacy,and a calculation method for personalized privacy threshold of different users is also designed.Furthermore,a Dynamic Private sensing data Selection(DPS)algorithm is proposed to help sensing users maximize data benefits within their privacy thresholds.Finally,theoretical analysis and ample experiment results show that DPMP framework is effective and efficient to achieve a balance between data benefits and sensing user privacy protection,in particular,the proposed DPMP framework has 63%and 23%higher training efficiency and data benefits,respectively,compared to the Monte Carlo algorithm.展开更多
To protect against algebraic attacks, a high algebraic immunity is now an important criterion for Boolean functions used in stream ciphers. In this paper, a new method based on a univariate polynomial representation o...To protect against algebraic attacks, a high algebraic immunity is now an important criterion for Boolean functions used in stream ciphers. In this paper, a new method based on a univariate polynomial representation of Boolean functions is proposed. The proposed method is used to construct Boolean functions with an odd number of variables and with maximum algebraic immunity. We also discuss the nonlinearity of the constructed functions. Moreover, a lower bound is determined for the number of Boolean functions with maximum algebraic immunity.展开更多
Widespread applications of 5G technology have prompted the outsourcing of computation dominated by the Internet of Things(IoT)cloud to improve transmission efficiency,which has created a novel paradigm for improving t...Widespread applications of 5G technology have prompted the outsourcing of computation dominated by the Internet of Things(IoT)cloud to improve transmission efficiency,which has created a novel paradigm for improving the speed of common connected objects in IoT.However,although it makes it easier for ubiquitous resource-constrained equipment that outsources computing tasks to achieve high-speed transmission services,security concerns,such as a lack of reliability and collusion attacks,still exist in the outsourcing computation.In this paper,we propose a reliable,anti-collusion outsourcing computation and verification protocol,which uses distributed storage solutions in response to the issue of centralized storage,leverages homomorphic encryption to deal with outsourcing computation and ensures data privacy.Moreover,we embed outsourcing computation results and a novel polynomial factorization algorithm into the smart contract of Ethereum,which not only enables the verification of the outsourcing result without a trusted third party but also resists collusion attacks.The results of the theoretical analysis and experimental performance evaluation demonstrate that the proposed protocol is secure,reliable,and more effective compared with state-of-the-art approaches.展开更多
Two new families of finite binary sequences are constructed using multiplicative inverse. The sequences are shown to have strong pseudorandom properties by using some estimates of certain exponential sums over finite ...Two new families of finite binary sequences are constructed using multiplicative inverse. The sequences are shown to have strong pseudorandom properties by using some estimates of certain exponential sums over finite fields. The constructions can be implemented fast since multiplicative inverse over finite fields can be computed in polynomial time.展开更多
In cyberspace security,the privacy in location-based services(LBSs) becomes more critical. In previous solutions,a trusted third party(TTP) was usually employed to provide disturbance or obfuscation,but it may become ...In cyberspace security,the privacy in location-based services(LBSs) becomes more critical. In previous solutions,a trusted third party(TTP) was usually employed to provide disturbance or obfuscation,but it may become the single point of failure or service bottleneck. In order to cope with this drawback,we focus on another important class,establishing anonymous group through short-range communication to achieve k-anonymity with collaborative users. Along with the analysis of existing algorithms,we found users in the group must share the same maximum anonymity degree,and they could not ease the process of preservation in a lower one. To cope with this problem,we proposed a random-QBE algorithm to put up with personalized anonymity in user collaboration algorithms,and this algorithm could preserve both query privacy and location privacy. Then we studied the attacks from passive and active adversaries and used entropy to measure user's privacy level. Finally,experimental evaluations further verify its effectiveness and efficiency.展开更多
Equivalence between two classes of quaternary sequences with odd period and best known autocorrelation are proved. A lower bound on the linear complexity of these sequences is presented. It is shown that the quaternar...Equivalence between two classes of quaternary sequences with odd period and best known autocorrelation are proved. A lower bound on the linear complexity of these sequences is presented. It is shown that the quaternary sequences have large linear complexity to resist Reeds and Sloane algorithm attack effectively.展开更多
To solve the key escrow problem of the identity-based cryptosystem, Girault introduced the notion of a self-certified public key, which not only eliminates the need to authenticate a public key but also solves the key...To solve the key escrow problem of the identity-based cryptosystem, Girault introduced the notion of a self-certified public key, which not only eliminates the need to authenticate a public key but also solves the key escrow problem. This paper proposes a Self-Certified Signature (SCS) scheme with message recovery and two variants without using bilinear pairings: one is the authenticated encryption scheme in which only the designated receiver can verify the signature, and the other is the authenticated encryption scheme with message linkage that deals with large messages. These three SCS schemes are provably secure in the random oracle model and are more efficient than previous schemes.展开更多
Recently, Wang et al. presented a new construction of attribute-based signature with policy-and-endorsement mechanism. The existential unforgeability of their scheme was claimed to be based on the strong Diffie-Hellma...Recently, Wang et al. presented a new construction of attribute-based signature with policy-and-endorsement mechanism. The existential unforgeability of their scheme was claimed to be based on the strong Diffie-Hellman assumption in the random oracle model. Unfortunately, by carefully revisiting the design and security proof of Wang et alfs scheme, we show that their scheme cannot provide unforgeability, namely, a forger, whose attributes do not satisfy a given signing predicate, can also generate valid signatures. We also point out the flaws in Wang et al.'s proof.展开更多
For an odd prime p, a new sequence family of period prom- 1, size (M-1)pmr is proposed using multi-plicative and additive characters. The upper bound for the maximum magnitude of nontrivial correlations of the seque...For an odd prime p, a new sequence family of period prom- 1, size (M-1)pmr is proposed using multi-plicative and additive characters. The upper bound for the maximum magnitude of nontrivial correlations of the sequence family is derived using well-known character sums. The upper bound is shown to be (r + 1)√pm + 3, which meets the Welch bound asymptotically.展开更多
With the rapidly developing of Internet of Things (IoT), the volume ofdata generated by IoT systems is increasing quickly. To release the pressure ofdata management and storage, more and more enterprises and individua...With the rapidly developing of Internet of Things (IoT), the volume ofdata generated by IoT systems is increasing quickly. To release the pressure ofdata management and storage, more and more enterprises and individuals preferto integrate cloud service with IoT systems, in which the IoT data can be outsourced to cloud server. Since cloud service provider (CSP) is not fully trusted,a variety of methods have been proposed to deal with the problem of data integritychecking. In traditional data integrity audition schemes, the task of data auditing isusually performed by Third Party Auditor (TPA) which is assumed to be trustful.However, in real-life TPA is not trusted as people thought. Therefore, theseschemes suffer from the underlying problem of single-point failure. Moreover,most of the traditional schemes are designed by RSA or bilinear map techniqueswhich consume heavy computation and communication cost. To overcome theseshortcomings, we propose a novel data integrity checking scheme for cloud-IoTdata based on blockchain technique and homomorphic hash. In our scheme, thetags of all data blocks are computed by a homomorphic hash function and storedin blockchain. Moreover, each step within the process of data integrity checking issigned by the performer, and the signatures are stored in blockchain through smartcontracts. As a result, each behavior for data integrity checking in our scheme canbe traced and audited which improves the security of the scheme greatly. Furthermore, batch-audition for multiple data challenges is also supported in our scheme.We formalize the system model of our scheme and give the concrete construction.Detailed performance analyses demonstrate that our proposed scheme is efficientand practical without the trust-assumption of TPA.展开更多
Internet of Things (IoT) has drawn much attention in recent years. However, the image data captured by IoT terminal devices are closely related to users, personal information, which are sensitive and should be protect...Internet of Things (IoT) has drawn much attention in recent years. However, the image data captured by IoT terminal devices are closely related to users, personal information, which are sensitive and should be protected. Though traditional privacy-preserving outsourced computing solutions such as homomorphic cryptographic primitives can support privacy-preserving computing, they consume a significant amount of computation and storage resources. Thus, it becomes a heavy burden on IoT terminal devices with limited resources. In order to reduce the resource consumption of terminal device, we propose an edge-assisted privacy-preserving outsourced computing framework for image processing, including image retrieval and classification. The edge nodes cooperate with the terminal device to protect data and support privacy-preserving computing on the semitrusted cloud server. Under this framework, edge-assisted privacy-preserving image retrieval and classification schemes are proposed in this paper. The security analysis and performance evaluation show that the proposed schemes greatly reduce the computational, communication and storage burden of IoT terminal device while ensuring image data security.展开更多
The growing size of the multiprocessor systems increases their vulnerability to component failures. It is crucial to local and to replace the fault processors to maintain system’s high reliability. The fault diagnosi...The growing size of the multiprocessor systems increases their vulnerability to component failures. It is crucial to local and to replace the fault processors to maintain system’s high reliability. The fault diagnosis is the process of identifying faulty processors in a system through testing. This paper establishes the diagnosabilities of the incomplete star graph Sn (n≥4) with missing links under the PMC model and its variant, the BGM model, and shows that the diagnosabilities of incomplete star graph Sn under these two diagnostic models can be determined by the minimum degree of its topology structure. This method can also be applied to the other existing multiprocessor systems.展开更多
The typeⅡ codes have been studied widely in applications since their appearance. With analysis of the algebraic structure of finite field of order 4 (i.e., GF(4)), some necessary and sufficient conditions that a ...The typeⅡ codes have been studied widely in applications since their appearance. With analysis of the algebraic structure of finite field of order 4 (i.e., GF(4)), some necessary and sufficient conditions that a generalized H-code (i.e., GH-code) is a type Ⅱ code over GF(4) are given in this article, and an efficient and simple method to generate type Ⅱ codes from GH-codes over GF(4) is shown. The conclusions further extend the coding theory of type Ⅱ.展开更多
Carlet et al. recently introduced generalized nonlinearity to measure the ability to resist the improved correlation attack of a vector output Boolean function. This article presents a construction of vector output Bo...Carlet et al. recently introduced generalized nonlinearity to measure the ability to resist the improved correlation attack of a vector output Boolean function. This article presents a construction of vector output Boolean fimctions with high generalized nonlinearity using the e-biased sample space. The relation between the resilient order and generalized nonlinearity is also discussed.展开更多
In this paper, we propose a method to construct an online/offiine batch verification signature scheme in a multi-signer setting. The length of the scheme is approximately 480 bits. Based on the Lysyanskaya, Rivest, Sa...In this paper, we propose a method to construct an online/offiine batch verification signature scheme in a multi-signer setting. The length of the scheme is approximately 480 bits. Based on the Lysyanskaya, Rivest, Sahai and Wolf (LRSW) assumption, this scheme is proved secure in a random oracle model, and it requires only three pairing operations for verifying n signatures from a multi-signer setting.展开更多
The functional encryption scheme designed using the lattice can realize fine-grained encryption and it can resist quantum attacks.Unfortunately,the sizes of the keys and ciphertexts in cryptographic applications based...The functional encryption scheme designed using the lattice can realize fine-grained encryption and it can resist quantum attacks.Unfortunately,the sizes of the keys and ciphertexts in cryptographic applications based on learning with errors are large,which makes the algorithm inefficient.Therefore,we construct a functional encryption for inner product predicates scheme by improving the learning with errors scheme of Agrawal et al.[Asiacrypt 2011],and its security relies on the difficulty assumption of ring learning with errors.Our construction can reduce the sizes of the keys and ciphertexts compared with the learning with errors scheme.展开更多
基金supported by the National Natural Science Foundation of China under Grant Nos. 61772009 and U1736112the Natural Science Foundation of Jiangsu Province under Grant Nos. BK20161511 and BK20181304
文摘Searchable public key encryption is a useful cryptographic paradigm that enables an untrustworthy server to retrieve the encrypted data without revealing the contents of the data. It offers a promising solution to encrypted data retrieval in cryptographic cloud storage. Certificateless public key cryptography (CLPKC) is a novel cryptographic primitive that has many merits. It overcomes the key escrow problem in identity-based cryptography (IBC) and the cumbersome certificate problem in conventional public key cryptography (PKC). Motivated by the appealing features of CLPKC, several certificateless encryption with keyword search (CLEKS) schemes have been presented in the literature. But, our cryptanalysis demonstrates that the previously proposed CLEKS frameworks suffer from the security vulnerability caused by the keyword guessing attack. To remedy the security weakness in the previous frameworks and provide resistance against both inside and outside keyword guessing attacks, we propose a new CLEKS framework. Under the new framework, we design a concrete CLEKS scheme and formally prove its security in the random oracle model. Compared with previous two CLEKS schemes, the proposed scheme has better overall performance while offering stronger security guarantee as it withstands the existing known types of keyword guessing attacks.
基金the Natural Science Foundation of Fujian Province (2007F3086)the Funds of the Education Department of Fujian Prov-ince (JA07164)the Open Funds of Key Laboratory of Fujian Province University Network Security and Cryptology (07B005)
文摘Combining with the research on the linear complexity of explicit nonlinear generators of pseudorandom sequences, we study the stability on linear complexity of two classes of explicit inversive generators and two classes of explicit nonlinear generators. We present some lower bounds in theory on the k-error linear complexity of these explicit generatol's, which further improve the cryptographic properties of the corresponding number generators and provide very useful information when they are applied to cryptography.
基金supported by the Natural Science Foundation of Fujian Province(2018J01782)the National Natural Science Foundation of China(U1905211)the Educational scientific research project of Fujian Provincial Department of Education(JAT210291)。
文摘The Internet of Things(IoT)has profoundly impacted our lives and has greatly revolutionized our lifestyle.The terminal devices in an IoT data aggregation application sense real-time data for the remote cloud server to achieve intelligent decisions.However,the high frequency of collecting user data will raise people concerns about personal privacy.In recent years,many privacy-preserving data aggregation schemes have been proposed.Unfortunately,most existing schemes cannot support either arbitrary aggregation functions,or dynamic user group management,or fault tolerance.In this paper,we propose an efficient and privacy-preserving data aggregation scheme.In the scheme,we design a lightweight encryption method to protect the user privacy by using a ring topology and a random location sequence.On this basis,the proposed scheme supports not only arbitrary aggregation functions,but also flexible dynamic user management.Furthermore,the scheme achieves faulttolerant capabilities by utilizing a future data buffering mechanism.Security analysis reveals that the scheme can achieve the desired security properties,and experimental evaluation results show the scheme's efficiency in terms of computational and communication overhead.
基金supported by National Science and Technology Major Project under Grant No.2012ZX03002003Funds of Key Lab of Fujian Province University Network Security and Cryptology under Grant No.2011009Open Research Project of State Key Laboratory of Information Security in Institute of Software,Chinese Academy of Sciences
文摘In order to ensure the security of information systems, it's essential to make sure that system behaviors are trusted. By analyzing threats that exist in executing procedures, a trust model based on structured protection is proposed. We consider that functional components, system actions and message flows between components are three key factors of information systems. Structured protection requirements on components, connections and action parameters are also provided. Four trusted properties of the model are deducted through formal analysis, and trusted system behavior is defined based on these properties. Furthermore, decision theorem of trusted system behavior is proved. The developed prototype system indicates the model is practical. It is a general theory model built on logic deduction and independent on specific environment and the behaviors of the system designed and implemented following the model are trusted.
基金supported in part by the National Natural Science Foundation of China under Grant U1905211,Grant 61872088,Grant 62072109,Grant 61872090,and Grant U1804263in part by the Guangxi Key Laboratory of Trusted Software under Grant KX202042+3 种基金in part by the Science and Technology Major Support Program of Guizhou Province under Grant 20183001in part by the Science and Technology Program of Guizhou Province under Grant 20191098in part by the Project of High-level Innovative Talents of Guizhou Province under Grant 20206008in part by the Open Research Fund of Key Laboratory of Cryptography of Zhejiang Province under Grant ZCL21015.
文摘With the maturity and development of 5G field,Mobile Edge CrowdSensing(MECS),as an intelligent data collection paradigm,provides a broad prospect for various applications in IoT.However,sensing users as data uploaders lack a balance between data benefits and privacy threats,leading to conservative data uploads and low revenue or excessive uploads and privacy breaches.To solve this problem,a Dynamic Privacy Measurement and Protection(DPMP)framework is proposed based on differential privacy and reinforcement learning.Firstly,a DPM model is designed to quantify the amount of data privacy,and a calculation method for personalized privacy threshold of different users is also designed.Furthermore,a Dynamic Private sensing data Selection(DPS)algorithm is proposed to help sensing users maximize data benefits within their privacy thresholds.Finally,theoretical analysis and ample experiment results show that DPMP framework is effective and efficient to achieve a balance between data benefits and sensing user privacy protection,in particular,the proposed DPMP framework has 63%and 23%higher training efficiency and data benefits,respectively,compared to the Monte Carlo algorithm.
基金This work was supported by the National Natural Science Foundation of China under Grants No. 61103191, No. 61070215 the Funds of Key Lab of Fujian Province University Network Security and Cryptology under Crant No. 2011003 and the Open Research Fund of State Key Laboratory of Inforrmtion Security.
文摘To protect against algebraic attacks, a high algebraic immunity is now an important criterion for Boolean functions used in stream ciphers. In this paper, a new method based on a univariate polynomial representation of Boolean functions is proposed. The proposed method is used to construct Boolean functions with an odd number of variables and with maximum algebraic immunity. We also discuss the nonlinearity of the constructed functions. Moreover, a lower bound is determined for the number of Boolean functions with maximum algebraic immunity.
基金This work was supported by the National Natural Science Foundation of China under Grant Nos.61962009 and 62262058Science and Technology Major Support Program of Guizhou Province under Grant No.20183001+6 种基金Key Program of the National Natural Science Union Foundation of China under Grant No.U1836205Science and Technology Program of Guizhou Province under Grant No.ZK[2021]325Project of High-level Innovative Talents of Guizhou Province under Grant No.[2020]6008Youth Growth Fund by Guizhou Provincial Education Department under Grant No.KY[2017]318Foundation of Postgraduate of Guizhou Province under Grant No.YJSCXJH2019101Science and Technology Program of Guiyang under Grant No.[2021]1-5Science and Technology Planning Project of Tongren Municipality under Grant No.[2020]78.
文摘Widespread applications of 5G technology have prompted the outsourcing of computation dominated by the Internet of Things(IoT)cloud to improve transmission efficiency,which has created a novel paradigm for improving the speed of common connected objects in IoT.However,although it makes it easier for ubiquitous resource-constrained equipment that outsources computing tasks to achieve high-speed transmission services,security concerns,such as a lack of reliability and collusion attacks,still exist in the outsourcing computation.In this paper,we propose a reliable,anti-collusion outsourcing computation and verification protocol,which uses distributed storage solutions in response to the issue of centralized storage,leverages homomorphic encryption to deal with outsourcing computation and ensures data privacy.Moreover,we embed outsourcing computation results and a novel polynomial factorization algorithm into the smart contract of Ethereum,which not only enables the verification of the outsourcing result without a trusted third party but also resists collusion attacks.The results of the theoretical analysis and experimental performance evaluation demonstrate that the proposed protocol is secure,reliable,and more effective compared with state-of-the-art approaches.
基金Supported by the Open Funds of Key Lab of Fujian Province University Network Security and Cryptology (07B005)the Funds of the Education Department of Fujian Province (JA07164)the Natural Science Foundation of Fujian Province of China (2007F3086)
文摘Two new families of finite binary sequences are constructed using multiplicative inverse. The sequences are shown to have strong pseudorandom properties by using some estimates of certain exponential sums over finite fields. The constructions can be implemented fast since multiplicative inverse over finite fields can be computed in polynomial time.
基金supported by the National Natural Science Foundation of China (Grant No.61472097)the Specialized Research Fund for the Doctoral Program of Higher Education(Grant No.20132304110017)+1 种基金the Natural Science Foundation of Heilongjiang Province of China (Grant No.F2015022)the Fujian Provincial Key Laboratory of Network Security and Cryptology Research Fund (Fujian Normal University) (No.15003)
文摘In cyberspace security,the privacy in location-based services(LBSs) becomes more critical. In previous solutions,a trusted third party(TTP) was usually employed to provide disturbance or obfuscation,but it may become the single point of failure or service bottleneck. In order to cope with this drawback,we focus on another important class,establishing anonymous group through short-range communication to achieve k-anonymity with collaborative users. Along with the analysis of existing algorithms,we found users in the group must share the same maximum anonymity degree,and they could not ease the process of preservation in a lower one. To cope with this problem,we proposed a random-QBE algorithm to put up with personalized anonymity in user collaboration algorithms,and this algorithm could preserve both query privacy and location privacy. Then we studied the attacks from passive and active adversaries and used entropy to measure user's privacy level. Finally,experimental evaluations further verify its effectiveness and efficiency.
基金supported by the National Natural Science Foundation of China (61102093)the Joint Funds of the National Natural Science Foundation of China (U1304604)the Fujian Normal University Innovative Research Team (IRTL 1207)
文摘Equivalence between two classes of quaternary sequences with odd period and best known autocorrelation are proved. A lower bound on the linear complexity of these sequences is presented. It is shown that the quaternary sequences have large linear complexity to resist Reeds and Sloane algorithm attack effectively.
基金This research was supported partially by the National Natural Science Foundation of China under Grants No. 61103247, No. 6110209 the Natural Science Foundation of Fujian Province under Grant No. 2011J05147+1 种基金 the Research Foundation of Education Bureau of Fujian Province under Grant No. JBll017 the Foundation for Excellent Young Teachers of Fujian Normal University under Grant No. fjsdjk2012049.
文摘To solve the key escrow problem of the identity-based cryptosystem, Girault introduced the notion of a self-certified public key, which not only eliminates the need to authenticate a public key but also solves the key escrow problem. This paper proposes a Self-Certified Signature (SCS) scheme with message recovery and two variants without using bilinear pairings: one is the authenticated encryption scheme in which only the designated receiver can verify the signature, and the other is the authenticated encryption scheme with message linkage that deals with large messages. These three SCS schemes are provably secure in the random oracle model and are more efficient than previous schemes.
基金partially supported by the National High Technology Research and Development 863 Program of China underGrant No.2011AA010803the National Natural Science Foundation of China under Grant Nos.61100225, 61202450+1 种基金the funding of Science and Technology on Information Assurance Laboratory (KJ-13-02)the Key Scientific and Technological Project of Henan Province of China under Grant No. 122102210126
文摘Recently, Wang et al. presented a new construction of attribute-based signature with policy-and-endorsement mechanism. The existential unforgeability of their scheme was claimed to be based on the strong Diffie-Hellman assumption in the random oracle model. Unfortunately, by carefully revisiting the design and security proof of Wang et alfs scheme, we show that their scheme cannot provide unforgeability, namely, a forger, whose attributes do not satisfy a given signing predicate, can also generate valid signatures. We also point out the flaws in Wang et al.'s proof.
文摘For an odd prime p, a new sequence family of period prom- 1, size (M-1)pmr is proposed using multi-plicative and additive characters. The upper bound for the maximum magnitude of nontrivial correlations of the sequence family is derived using well-known character sums. The upper bound is shown to be (r + 1)√pm + 3, which meets the Welch bound asymptotically.
基金supported by Program for Scientific Research Foundation for Talented Scholars of Jinling Institute of Technology(No.JIT-B-202031)H.Yan received it and the URLs is www.jit.edu.cn.H.Yan also received the Opening Foundation of Fujian Provincial Key Laboratory of Network Security and Cryptology Research Fund of Fujian Normal University(NSCL-KF2021-02)and the URLs is www.fjnu.edu.cn.Y.Liu received the funding of the National Natural Science Foundation of China(No.61902163,)the URLs is www.nsfc.gov.cn.S.Hu received the funding of the Science and Technology Project of Education Department in Jiangxi Province(No.GJJ201402)and the URLs is www.gnnu.cn.
文摘With the rapidly developing of Internet of Things (IoT), the volume ofdata generated by IoT systems is increasing quickly. To release the pressure ofdata management and storage, more and more enterprises and individuals preferto integrate cloud service with IoT systems, in which the IoT data can be outsourced to cloud server. Since cloud service provider (CSP) is not fully trusted,a variety of methods have been proposed to deal with the problem of data integritychecking. In traditional data integrity audition schemes, the task of data auditing isusually performed by Third Party Auditor (TPA) which is assumed to be trustful.However, in real-life TPA is not trusted as people thought. Therefore, theseschemes suffer from the underlying problem of single-point failure. Moreover,most of the traditional schemes are designed by RSA or bilinear map techniqueswhich consume heavy computation and communication cost. To overcome theseshortcomings, we propose a novel data integrity checking scheme for cloud-IoTdata based on blockchain technique and homomorphic hash. In our scheme, thetags of all data blocks are computed by a homomorphic hash function and storedin blockchain. Moreover, each step within the process of data integrity checking issigned by the performer, and the signatures are stored in blockchain through smartcontracts. As a result, each behavior for data integrity checking in our scheme canbe traced and audited which improves the security of the scheme greatly. Furthermore, batch-audition for multiple data challenges is also supported in our scheme.We formalize the system model of our scheme and give the concrete construction.Detailed performance analyses demonstrate that our proposed scheme is efficientand practical without the trust-assumption of TPA.
基金This work was supported by the Natural Science Foundation of Fujian Province, China (2017J05099)Science and Technology Planning Project of Guangdong Province, China (2015B010129015)+1 种基金the National Natural Science Foundation of China (Grant Nos. 61472091, 61722203, 61502102)the National Natural Science Foundation for Outstanding Youth Foundation (Grant No. 61722203).
文摘Internet of Things (IoT) has drawn much attention in recent years. However, the image data captured by IoT terminal devices are closely related to users, personal information, which are sensitive and should be protected. Though traditional privacy-preserving outsourced computing solutions such as homomorphic cryptographic primitives can support privacy-preserving computing, they consume a significant amount of computation and storage resources. Thus, it becomes a heavy burden on IoT terminal devices with limited resources. In order to reduce the resource consumption of terminal device, we propose an edge-assisted privacy-preserving outsourced computing framework for image processing, including image retrieval and classification. The edge nodes cooperate with the terminal device to protect data and support privacy-preserving computing on the semitrusted cloud server. Under this framework, edge-assisted privacy-preserving image retrieval and classification schemes are proposed in this paper. The security analysis and performance evaluation show that the proposed schemes greatly reduce the computational, communication and storage burden of IoT terminal device while ensuring image data security.
基金the Foundation of Fujian Provincial Department of Science & Technology (No. 2006F5035)the National Natural Science Foundation of China (No. 60502047)
文摘The growing size of the multiprocessor systems increases their vulnerability to component failures. It is crucial to local and to replace the fault processors to maintain system’s high reliability. The fault diagnosis is the process of identifying faulty processors in a system through testing. This paper establishes the diagnosabilities of the incomplete star graph Sn (n≥4) with missing links under the PMC model and its variant, the BGM model, and shows that the diagnosabilities of incomplete star graph Sn under these two diagnostic models can be determined by the minimum degree of its topology structure. This method can also be applied to the other existing multiprocessor systems.
基金the National Natural Science Foundation of China (60743007)Fujian Province Young Talent Program (2006F3044)+2 种基金Province Natural Science Foundation of Fujian (JA04169)Province Education Department Foundation of Fujian (JB05331)Beijing Municipal Commission of Education Disciplines and Graduate Education Projects (XK100130648)
文摘The typeⅡ codes have been studied widely in applications since their appearance. With analysis of the algebraic structure of finite field of order 4 (i.e., GF(4)), some necessary and sufficient conditions that a generalized H-code (i.e., GH-code) is a type Ⅱ code over GF(4) are given in this article, and an efficient and simple method to generate type Ⅱ codes from GH-codes over GF(4) is shown. The conclusions further extend the coding theory of type Ⅱ.
基金the National Natural Science Foundation of China (90604023)Fujian Province Young Talent Program (2006F3044)+2 种基金Natural Science Foundation of Fujian Province (2006J0189)the Open Funds of Key Laboratory of Fujian Province University Network Security and Cryptology (07B002)Fujian Education Department Technology Program (JA07050)
文摘Carlet et al. recently introduced generalized nonlinearity to measure the ability to resist the improved correlation attack of a vector output Boolean function. This article presents a construction of vector output Boolean fimctions with high generalized nonlinearity using the e-biased sample space. The relation between the resilient order and generalized nonlinearity is also discussed.
基金Supported by the National Natural Science Foundation of China(61072080)the Foundation of Education Bureau of Fujian Province (JK2010012)Key Project of Services for Haixia Construction in Universities of Fujian Province
文摘In this paper, we propose a method to construct an online/offiine batch verification signature scheme in a multi-signer setting. The length of the scheme is approximately 480 bits. Based on the Lysyanskaya, Rivest, Sahai and Wolf (LRSW) assumption, this scheme is proved secure in a random oracle model, and it requires only three pairing operations for verifying n signatures from a multi-signer setting.
基金project is supported by the National Natural Science Foundation of China(11701089,61822202,61872089)Science and Technology Program of Fujian Province,China(2019J01428).
文摘The functional encryption scheme designed using the lattice can realize fine-grained encryption and it can resist quantum attacks.Unfortunately,the sizes of the keys and ciphertexts in cryptographic applications based on learning with errors are large,which makes the algorithm inefficient.Therefore,we construct a functional encryption for inner product predicates scheme by improving the learning with errors scheme of Agrawal et al.[Asiacrypt 2011],and its security relies on the difficulty assumption of ring learning with errors.Our construction can reduce the sizes of the keys and ciphertexts compared with the learning with errors scheme.