Zero knowledge sets is a new cryptographic primitive introduced by Micali, Rabin, and Kilian in FOCS 2003. It has been intensively studied recently. However all the existing ZKS schemes follow the basic structure by M...Zero knowledge sets is a new cryptographic primitive introduced by Micali, Rabin, and Kilian in FOCS 2003. It has been intensively studied recently. However all the existing ZKS schemes follow the basic structure by Micali et al. That is, the schemes employ the Merkle tree as a basic structure and mercurial commitments as the commitment units to nodes of the tree. The proof for any query consists of an authentication chain. We propose in this paper a new algebraic scheme that is completely different from all the existing schemes. Our new scheme is computationally secure under the standard strong RSA assumption. Neither mercurial commitments nor tree structure is used in the new construction. In fact, the prover in our construction commits the desired set without any trapdoor information, which is another key important difference from the previous approaches.展开更多
The cloud computing technology has emerged,developed,and matured in recent years,consequently commercializing remote outsourcing storage services.An increasing number of companies and individuals have chosen the cloud...The cloud computing technology has emerged,developed,and matured in recent years,consequently commercializing remote outsourcing storage services.An increasing number of companies and individuals have chosen the cloud to store their data.However,accidents,such as cloud server downtime,cloud data loss,and accidental deletion,are serious issues for some applications that need to run around the clock.For some mission and business-critical applications,the continuous availability of outsourcing storage services is also necessary to protect users'outsourced data during downtime.Nevertheless,ensuring the continuous availability of data in public cloud data integrity auditing protocols leads to data privacy issues because auditors can obtain the data content of users by a sufficient number of storage proofs.Therefore,protecting data privacy is a burning issue.In addition,existing data integrity auditing schemes that rely on semi-trusted third-party auditors have several security problems,including single points of failure and performance bottlenecks.To deal with these issues,we propose herein a blockchain-based continuous data integrity checking protocol with zero-knowledge privacy protection.We realize a concrete construction by using a verifiable delay function with high efficiency and proof of retrievability,and prove the security of the proposal in a random oracle model.The proposed construction supports dynamic updates for the outsourced data.We also design smart contracts to ensure fairness among the parties involved.Finally,we implement the protocols,and the experimental results demonstrate the efficiency of the proposed protocol.展开更多
Non-Interactive Zero-Knowledge(NIZK for short) proofs are fascinating and extremely useful in many security protocols. In this paper,a new group signature scheme,decisional linear assumption group signature(DLAGS for ...Non-Interactive Zero-Knowledge(NIZK for short) proofs are fascinating and extremely useful in many security protocols. In this paper,a new group signature scheme,decisional linear assumption group signature(DLAGS for short) with NIZK proofs is proposed which can prove and sign the multiple values rather than individual bits based on DLIN assumption. DLAGS does not need to interact between the verifier and issuer,which can decrease the communication times and storage cost compared with the existing interactive group signature schemes. We prove and sign the blocks of messages instead of limiting the proved message to only one bit(0 or 1) in the conventional non-interactive zero-knowledge proof system,and we also prove that our scheme satisfy the property of anonymity,unlinkability and traceability. Finally,our scheme is compared with the other scheme(Benoitt's scheme) which is also based on the NIZK proofs system and the DLIN assumption,and the results show that our scheme requires fewer members of groups and computational times.展开更多
A zero-knowledge proof or protocol is a cryptographic technique for verifying private data without revealing it in its clear form.In this paper,we evaluate the potential for zero-knowledge distributed ledger technolog...A zero-knowledge proof or protocol is a cryptographic technique for verifying private data without revealing it in its clear form.In this paper,we evaluate the potential for zero-knowledge distributed ledger technology to alleviate asymmetry of information in the asset-backed securitization market.To frame this inquiry,we conducted market data analyses,a review of prior literature,stakeholder interviews with investors,originators and security issuers and collaboration with blockchain engineers and researchers.We introduce a new system which could enable all market participants in the securitization lifecycle(e.g.investors,rating agencies,regulators and security issuers)to interact on a unique decentralized platform while maintaining the privacy of loan-level data,therefore providing the industry with timely analytics and performance data.Our platform is powered by zkLedger(Narula et al.2018),a zero-knowledge protocol developed by the MIT Media Lab and the first system that enables participants of a distributed ledger to run publicly verifiable analytics on masked data.展开更多
Precise zero-knowledge was introduced by Micali and Pass in STOC06. This notion captures the idea that the view of a verifier can be reconstructed in almost same time. Following the notion, they constructed some preci...Precise zero-knowledge was introduced by Micali and Pass in STOC06. This notion captures the idea that the view of a verifier can be reconstructed in almost same time. Following the notion, they constructed some precise zero-knowledge proofs and arguments, in which the communicated messages are polynomial bits. In this paper, we employ the new simulation technique introduced by them to provide a precise simulator for a modified Kilian＇s zero-knowledge arguments with poly-logarithmic efficiency （this modification addressed by Rosen）, and as a result we show this protocol is a precise zero-knowledge argument with poly-logaxithmic efficiency. We also present an alternative construction of the desired protocols.展开更多
Precise zero-knowledge was introduced by Micali and Pass in STOC'06.This notion captures the idea that the view of any verifier in interaction can be reconstructed in almost time.Pass also obtained a sequential co...Precise zero-knowledge was introduced by Micali and Pass in STOC'06.This notion captures the idea that the view of any verifier in interaction can be reconstructed in almost time.Pass also obtained a sequential composition lemma for precise zero-knowledge protocols.However,this lemma doesn't provide tight precisions for composed protocols.In this paper we further obtain a sequential composition lemma for a subclass of precise zero-knowledge protocols,which all satisfy a property:their simulators use the code of verifier in almost the black-box way.We call such subclass emulated black-box zero-knowledge protocols.Our lemma provides better precisions for sequential composition of such protocols.展开更多
Since transactions in blockchain are based on public ledger verification,this raises security concerns about privacy protection.And it will cause the accumulation of data on the chain and resulting in the low efficien...Since transactions in blockchain are based on public ledger verification,this raises security concerns about privacy protection.And it will cause the accumulation of data on the chain and resulting in the low efficiency of block verification,when the whole transaction on the chain is verified.In order to improve the efficiency and privacy protection of block data verification,this paper proposes an efficient block verification mechanism with privacy protection based on zeroknowledge proof(ZKP),which not only protects the privacy of users but also improves the speed of data block verification.There is no need to put the whole transaction on the chain when verifying block data.It just needs to generate the ZKP and root hash with the transaction information,then save them to the smart contract for verification.Moreover,the ZKP verification in smart contract is carried out to realize the privacy protection of the transaction and efficient verification of the block.When the data is validated,the buffer accepts the complete transaction,updates the transaction status in the cloud database,and packages up the chain.So,the ZKP strengthens the privacy protection ability of blockchain,and the smart contracts save the time cost of block verification.展开更多
Due to the numerous variables to take into account as well as the inherent ambiguity and uncertainty,evaluating educational institutions can be difficult.The concept of a possibility Pythagorean fuzzy hypersoft set(pP...Due to the numerous variables to take into account as well as the inherent ambiguity and uncertainty,evaluating educational institutions can be difficult.The concept of a possibility Pythagorean fuzzy hypersoft set(pPyFHSS)is more flexible in this regard than other theoretical fuzzy set-like models,even though some attempts have been made in the literature to address such uncertainties.This study investigates the elementary notions of pPyFHSS including its set-theoretic operations union,intersection,complement,OR-and AND-operations.Some results related to these operations are also modified for pPyFHSS.Additionally,the similarity measures between pPyFHSSs are formulated with the assistance of numerical examples and results.Lastly,an intelligent decision-assisted mechanism is developed with the proposal of a robust algorithm based on similarity measures for solving multi-attribute decision-making(MADM)problems.A case study that helps the decision-makers assess the best educational institution is discussed to validate the suggested system.The algorithmic results are compared with the most pertinent model to evaluate the adaptability of pPyFHSS,as it generalizes the classical possibility fuzzy set-like theoretical models.Similarly,while considering significant evaluating factors,the flexibility of pPyFHSS is observed through structural comparison.展开更多
This study identified castor oil and phosphate ester as effective retarders through setting time,tensile,and flexural tests,and determined their optimal dosages.The mechanism by which phosphate ester affects the setti...This study identified castor oil and phosphate ester as effective retarders through setting time,tensile,and flexural tests,and determined their optimal dosages.The mechanism by which phosphate ester affects the setting time of polyurethane was further investigated using molecular dynamics simulations.Fourier transform infrared spectroscopy was also employed to systematically study the physical and chemical interactions between phosphate esters and polyurethane materials.The results demonstrate that a 1%concentration of phosphate ester provides the most effective retarding effect with minimal impact on the strength of polyurethane.When phosphate ester is added to the B component of the two-component polyurethane system,its interaction energy with component A decreases,as do the diffusion coefficient and aggregation degree of component B on the surface of component A.This reduction in interaction slows the setting time.Additionally,the addition of phosphate ester to polyurethane leads to the disappearance or weakening of functional groups,indicating competitive interactions within the phosphate ester components that inhibit the reaction rate.展开更多
OBJECTIVE:To explore the efficacy and safety of acupuncture combined with atlantoaxial joint bone-setting therapy for the treatment of Tourette syndrome.METHODS:We randomly divided 600 patients at a ratio of 1∶1∶1 i...OBJECTIVE:To explore the efficacy and safety of acupuncture combined with atlantoaxial joint bone-setting therapy for the treatment of Tourette syndrome.METHODS:We randomly divided 600 patients at a ratio of 1∶1∶1 into three groups:group A(acupuncture combined with atlantoaxial joint bone setting therapy group),group B(acupuncture group),and group C(tiapride group).After two months of treatment,the Yale global tic severity scale(YGTSS)score reduction,improvement in social function impairment,clinical efficacy,and long-term efficacy in the three groups were compared.RESULTS:After treatment,in the analysis of YGTSS score reduction,social function impairment improvement,the clinical control rate,and long-term efficacy,the results were all Group A>Group B>Group C,with a statistically significant difference(P<0.05).However,the total clinical efficacy of treatment in group A(94.9%)was not significantly different from that in group B(91.8%).Adverse reactions did not occur in groups A and B,and several adverse reactions occurred in 29%(n=58)of the group C patients.CONCLUSION:Compared with traditional drug therapy,acupuncture combined with atlantoaxial joint bone setting therapy has better clinical and long-term efficacy.This treatment strategy can improve the social function of children and prevent adverse reactions to drugs.展开更多
基金This work is supported by NSF of USA under Grant Nos.IIS-0430274, and CCR-0325951, and sponsors of CERIASRui Xue is partially supported by the Fund of the China Scholarship Council, partially by National Natural Science Foundation of China under Grant No.60773029+1 种基金National Grand Fundamental Research 973 Program of China under Grant No.2007CB311202the National High Technology Research and Development 863 Program of China under Grant No.2006AA01Z427.
文摘Zero knowledge sets is a new cryptographic primitive introduced by Micali, Rabin, and Kilian in FOCS 2003. It has been intensively studied recently. However all the existing ZKS schemes follow the basic structure by Micali et al. That is, the schemes employ the Merkle tree as a basic structure and mercurial commitments as the commitment units to nodes of the tree. The proof for any query consists of an authentication chain. We propose in this paper a new algebraic scheme that is completely different from all the existing schemes. Our new scheme is computationally secure under the standard strong RSA assumption. Neither mercurial commitments nor tree structure is used in the new construction. In fact, the prover in our construction commits the desired set without any trapdoor information, which is another key important difference from the previous approaches.
基金This work is supported by the National Natural Science Foundation of China(61872229,U19B2021)the Shaanxi Provincial Science Fund for Distinguished Young Scholars(2022JC-47)+1 种基金the Blockchain Core Technology Strategic Research Program of Ministry of Education of China(2020KJ010301)the Key Research and Development Program of Shaanxi(2021ZDLGY06-04,2020ZDLGY09-06).
文摘The cloud computing technology has emerged,developed,and matured in recent years,consequently commercializing remote outsourcing storage services.An increasing number of companies and individuals have chosen the cloud to store their data.However,accidents,such as cloud server downtime,cloud data loss,and accidental deletion,are serious issues for some applications that need to run around the clock.For some mission and business-critical applications,the continuous availability of outsourcing storage services is also necessary to protect users'outsourced data during downtime.Nevertheless,ensuring the continuous availability of data in public cloud data integrity auditing protocols leads to data privacy issues because auditors can obtain the data content of users by a sufficient number of storage proofs.Therefore,protecting data privacy is a burning issue.In addition,existing data integrity auditing schemes that rely on semi-trusted third-party auditors have several security problems,including single points of failure and performance bottlenecks.To deal with these issues,we propose herein a blockchain-based continuous data integrity checking protocol with zero-knowledge privacy protection.We realize a concrete construction by using a verifiable delay function with high efficiency and proof of retrievability,and prove the security of the proposal in a random oracle model.The proposed construction supports dynamic updates for the outsourced data.We also design smart contracts to ensure fairness among the parties involved.Finally,we implement the protocols,and the experimental results demonstrate the efficiency of the proposed protocol.
基金supported by the National High-Tech Research and Development Plan of China under Grant Nos.863-317-01- 04-99, 2009AA01Z122 (863)the Natural Science Foundation of Shenyang City of China under Grant No. F10-205-1-12
文摘Non-Interactive Zero-Knowledge(NIZK for short) proofs are fascinating and extremely useful in many security protocols. In this paper,a new group signature scheme,decisional linear assumption group signature(DLAGS for short) with NIZK proofs is proposed which can prove and sign the multiple values rather than individual bits based on DLIN assumption. DLAGS does not need to interact between the verifier and issuer,which can decrease the communication times and storage cost compared with the existing interactive group signature schemes. We prove and sign the blocks of messages instead of limiting the proved message to only one bit(0 or 1) in the conventional non-interactive zero-knowledge proof system,and we also prove that our scheme satisfy the property of anonymity,unlinkability and traceability. Finally,our scheme is compared with the other scheme(Benoitt's scheme) which is also based on the NIZK proofs system and the DLIN assumption,and the results show that our scheme requires fewer members of groups and computational times.
基金We received funding solely from our institution to perform this research.
文摘A zero-knowledge proof or protocol is a cryptographic technique for verifying private data without revealing it in its clear form.In this paper,we evaluate the potential for zero-knowledge distributed ledger technology to alleviate asymmetry of information in the asset-backed securitization market.To frame this inquiry,we conducted market data analyses,a review of prior literature,stakeholder interviews with investors,originators and security issuers and collaboration with blockchain engineers and researchers.We introduce a new system which could enable all market participants in the securitization lifecycle(e.g.investors,rating agencies,regulators and security issuers)to interact on a unique decentralized platform while maintaining the privacy of loan-level data,therefore providing the industry with timely analytics and performance data.Our platform is powered by zkLedger(Narula et al.2018),a zero-knowledge protocol developed by the MIT Media Lab and the first system that enables participants of a distributed ledger to run publicly verifiable analytics on masked data.
基金the National Natural Science Foundation of China (No.60573031)New Century Excellent Talent Program of Education Ministry of China (No.NCET-05-0398)
文摘Precise zero-knowledge was introduced by Micali and Pass in STOC06. This notion captures the idea that the view of a verifier can be reconstructed in almost same time. Following the notion, they constructed some precise zero-knowledge proofs and arguments, in which the communicated messages are polynomial bits. In this paper, we employ the new simulation technique introduced by them to provide a precise simulator for a modified Kilian＇s zero-knowledge arguments with poly-logarithmic efficiency （this modification addressed by Rosen）, and as a result we show this protocol is a precise zero-knowledge argument with poly-logaxithmic efficiency. We also present an alternative construction of the desired protocols.
基金the National Natural Science Foundation of China (No. 60573031)the New Century Excellent Talent Program of Education Ministry of China(NCET-05-0398)
文摘Precise zero-knowledge was introduced by Micali and Pass in STOC'06.This notion captures the idea that the view of any verifier in interaction can be reconstructed in almost time.Pass also obtained a sequential composition lemma for precise zero-knowledge protocols.However,this lemma doesn't provide tight precisions for composed protocols.In this paper we further obtain a sequential composition lemma for a subclass of precise zero-knowledge protocols,which all satisfy a property:their simulators use the code of verifier in almost the black-box way.We call such subclass emulated black-box zero-knowledge protocols.Our lemma provides better precisions for sequential composition of such protocols.
基金This work was supported by China’s National Natural Science Foundation(No.62072249,62072056).Jin Wang and Yongjun Ren received the grant and the URLs to sponsors’websites are https://www.nsfc.gov.cn/.This work was also funded by the Researchers Supporting Project No.(RSP-2021/102)King Saud University,Riyadh,Saudi Arabia.
文摘Since transactions in blockchain are based on public ledger verification,this raises security concerns about privacy protection.And it will cause the accumulation of data on the chain and resulting in the low efficiency of block verification,when the whole transaction on the chain is verified.In order to improve the efficiency and privacy protection of block data verification,this paper proposes an efficient block verification mechanism with privacy protection based on zeroknowledge proof(ZKP),which not only protects the privacy of users but also improves the speed of data block verification.There is no need to put the whole transaction on the chain when verifying block data.It just needs to generate the ZKP and root hash with the transaction information,then save them to the smart contract for verification.Moreover,the ZKP verification in smart contract is carried out to realize the privacy protection of the transaction and efficient verification of the block.When the data is validated,the buffer accepts the complete transaction,updates the transaction status in the cloud database,and packages up the chain.So,the ZKP strengthens the privacy protection ability of blockchain,and the smart contracts save the time cost of block verification.
基金supported by the Deanship of Graduate Studies and Scientific Research at Qassim University(QU-APC-2024-9/1).
文摘Due to the numerous variables to take into account as well as the inherent ambiguity and uncertainty,evaluating educational institutions can be difficult.The concept of a possibility Pythagorean fuzzy hypersoft set(pPyFHSS)is more flexible in this regard than other theoretical fuzzy set-like models,even though some attempts have been made in the literature to address such uncertainties.This study investigates the elementary notions of pPyFHSS including its set-theoretic operations union,intersection,complement,OR-and AND-operations.Some results related to these operations are also modified for pPyFHSS.Additionally,the similarity measures between pPyFHSSs are formulated with the assistance of numerical examples and results.Lastly,an intelligent decision-assisted mechanism is developed with the proposal of a robust algorithm based on similarity measures for solving multi-attribute decision-making(MADM)problems.A case study that helps the decision-makers assess the best educational institution is discussed to validate the suggested system.The algorithmic results are compared with the most pertinent model to evaluate the adaptability of pPyFHSS,as it generalizes the classical possibility fuzzy set-like theoretical models.Similarly,while considering significant evaluating factors,the flexibility of pPyFHSS is observed through structural comparison.
基金Funded by the National Natural Science Foundation of China(No.52370128)the Fundamental Research Funds for the Central Universities(No.2572022AW54)。
文摘This study identified castor oil and phosphate ester as effective retarders through setting time,tensile,and flexural tests,and determined their optimal dosages.The mechanism by which phosphate ester affects the setting time of polyurethane was further investigated using molecular dynamics simulations.Fourier transform infrared spectroscopy was also employed to systematically study the physical and chemical interactions between phosphate esters and polyurethane materials.The results demonstrate that a 1%concentration of phosphate ester provides the most effective retarding effect with minimal impact on the strength of polyurethane.When phosphate ester is added to the B component of the two-component polyurethane system,its interaction energy with component A decreases,as do the diffusion coefficient and aggregation degree of component B on the surface of component A.This reduction in interaction slows the setting time.Additionally,the addition of phosphate ester to polyurethane leads to the disappearance or weakening of functional groups,indicating competitive interactions within the phosphate ester components that inhibit the reaction rate.
基金Supported by Traditional Chinese medicine foundation of Zhejiang province:Clinical Study on the Correlation Between Tourette Syndrome and Anatomical Changes in the Atlantoaxial Joint(2010ZB162)Medical Health Science and Technology Project of Zhejiang Provincial Health Commission:Study on Protein Fingerprinting of Tourette Syndrome(2011KYB142)+1 种基金Renowned Traditional Chinese Medicine Expert Inheritance Studio Construction Project of Zhejiang province(No.GZS2020049)Key Disciplines of Traditional Chinese Medicine Foundation of Zhejiang Province(2012-XK-D20)。
文摘OBJECTIVE:To explore the efficacy and safety of acupuncture combined with atlantoaxial joint bone-setting therapy for the treatment of Tourette syndrome.METHODS:We randomly divided 600 patients at a ratio of 1∶1∶1 into three groups:group A(acupuncture combined with atlantoaxial joint bone setting therapy group),group B(acupuncture group),and group C(tiapride group).After two months of treatment,the Yale global tic severity scale(YGTSS)score reduction,improvement in social function impairment,clinical efficacy,and long-term efficacy in the three groups were compared.RESULTS:After treatment,in the analysis of YGTSS score reduction,social function impairment improvement,the clinical control rate,and long-term efficacy,the results were all Group A>Group B>Group C,with a statistically significant difference(P<0.05).However,the total clinical efficacy of treatment in group A(94.9%)was not significantly different from that in group B(91.8%).Adverse reactions did not occur in groups A and B,and several adverse reactions occurred in 29%(n=58)of the group C patients.CONCLUSION:Compared with traditional drug therapy,acupuncture combined with atlantoaxial joint bone setting therapy has better clinical and long-term efficacy.This treatment strategy can improve the social function of children and prevent adverse reactions to drugs.
