期刊文献+
共找到14,609篇文章
< 1 2 250 >
每页显示 20 50 100
A Novel Approach to Estimating Proof Test Coverage for Emergency Shutdown Valves using a Fuzzy Inference System
1
作者 Steve Kriescher Roderick Thomas +2 位作者 Chris Phillips Neil Mac Parthaláin David J.Smith 《Journal of Dynamics, Monitoring and Diagnostics》 2025年第1期44-52,共9页
Published proof test coverage(PTC)estimates for emergency shutdown valves(ESDVs)show only moderate agreement and are predominantly opinion-based.A Failure Modes,Effects,and Diagnostics Analysis(FMEDA)was undertaken us... Published proof test coverage(PTC)estimates for emergency shutdown valves(ESDVs)show only moderate agreement and are predominantly opinion-based.A Failure Modes,Effects,and Diagnostics Analysis(FMEDA)was undertaken using component failure rate data to predict PTC for a full stroke test and a partial stroke test.Given the subjective and uncertain aspects of the FMEDA approach,specifically the selection of component failure rates and the determination of the probability of detecting failure modes,a Fuzzy Inference System(FIS)was proposed to manage the data,addressing the inherent uncertainties.Fuzzy inference systems have been used previously for various FMEA type assessments,but this is the first time an FIS has been employed for use with FMEDA.ESDV PTC values were generated from both the standard FMEDA and the fuzzy-FMEDA approaches using data provided by FMEDA experts.This work demonstrates that fuzzy inference systems can address the subjectivity inherent in FMEDA data,enabling reliable estimates of ESDV proof test coverage for both full and partial stroke tests.This facilitates optimized maintenance planning while ensuring safety is not compromised. 展开更多
关键词 emergency shutdown valves failure modes effects diagnostics analysis fuzzy inference systems proof test coverage
在线阅读 下载PDF
Fool-Proof法在图书馆工作中的应用浅探 被引量:3
2
作者 黄建年 《冶金信息导刊》 2007年第1期36-39,22,共5页
防呆法在企业生产中有大量的应用,在一些大型企业中也取得了显著的效果。作为一个服务部门和信息生产部门,图书馆应用防呆法无疑有助于图书馆的自动化和规范化。根据防呆法原理从10个方面详细列举了防呆法在图书馆的可能应用。
关键词 Fool-proof PKKA-YOKE 愚巧法 防错法 图书馆
在线阅读 下载PDF
A Blockchain-Based Efficient Verification Scheme for Context Semantic-Aware Ciphertext Retrieval
3
作者 Haochen Bao Lingyun Yuan +2 位作者 Tianyu Xie Han Chen Hui Dai 《Computers, Materials & Continua》 2026年第1期550-579,共30页
In the age of big data,ensuring data privacy while enabling efficient encrypted data retrieval has become a critical challenge.Traditional searchable encryption schemes face difficulties in handling complex semantic q... In the age of big data,ensuring data privacy while enabling efficient encrypted data retrieval has become a critical challenge.Traditional searchable encryption schemes face difficulties in handling complex semantic queries.Additionally,they typically rely on honest but curious cloud servers,which introduces the risk of repudiation.Furthermore,the combined operations of search and verification increase system load,thereby reducing performance.Traditional verification mechanisms,which rely on complex hash constructions,suffer from low verification efficiency.To address these challenges,this paper proposes a blockchain-based contextual semantic-aware ciphertext retrieval scheme with efficient verification.Building on existing single and multi-keyword search methods,the scheme uses vector models to semantically train the dataset,enabling it to retain semantic information and achieve context-aware encrypted retrieval,significantly improving search accuracy.Additionally,a blockchain-based updatable master-slave chain storage model is designed,where the master chain stores encrypted keyword indexes and the slave chain stores verification information generated by zero-knowledge proofs,thus balancing system load while improving search and verification efficiency.Finally,an improved non-interactive zero-knowledge proof mechanism is introduced,reducing the computational complexity of verification and ensuring efficient validation of search results.Experimental results demonstrate that the proposed scheme offers stronger security,balanced overhead,and higher search verification efficiency. 展开更多
关键词 Searchable encryption blockchain context semantic awareness zero-knowledge proof
在线阅读 下载PDF
电影《相助》片尾曲《The Living Proof》的功能文体学分析
4
作者 盛桂兰 《兰州教育学院学报》 2018年第10期98-100,共3页
电影歌曲作为整部电影的有机组成部分,其重要性不可小觑,一首好的歌曲能达到锦上添花的观影效果。目前国内对电影歌词的研究,大多集中在音乐学、美学、文学等语言学之外的领域,从功能语言学的角度对电影歌曲的解读尚且不多。本文拟以系... 电影歌曲作为整部电影的有机组成部分,其重要性不可小觑,一首好的歌曲能达到锦上添花的观影效果。目前国内对电影歌词的研究,大多集中在音乐学、美学、文学等语言学之外的领域,从功能语言学的角度对电影歌曲的解读尚且不多。本文拟以系统功能语法理论为指导,从语境、经验功能、人际功能着手解析电影《相助》片尾曲《The Living Proof》,以期丰富系统功能语法的研究内容,为电影歌词的分析提供新的视角,帮助观影者深度理解影片主题。 展开更多
关键词 《相助》 《The LIVING proof 系统功能语法
在线阅读 下载PDF
FORMAL PROOF OF RELATIVE STRENGTH OF SECURITY AMONG ECK2007 MODEL AND OTHER PROOF MODELS FOR KEY AGREEMENT PROTOCOLS 被引量:2
5
作者 夏金月 王建东 +2 位作者 方黎明 任勇军 卞仕柱 《Transactions of Nanjing University of Aeronautics and Astronautics》 EI 2008年第4期282-288,共7页
The differences among the extended Canetti & Krawezyk 2007 model (ECK2007) and other four models, i.e., the Bellare & Rogaway (1993, 1995)models (BR93,BR95), the Bellare, Pointcheval & Rogaway (2000) model ... The differences among the extended Canetti & Krawezyk 2007 model (ECK2007) and other four models, i.e., the Bellare & Rogaway (1993, 1995)models (BR93,BR95), the Bellare, Pointcheval & Rogaway (2000) model (BPR2000) and the Canetti & Krawczyk (2001) model (CK2001) are given. The relative strength of security among these models is analyzed. To support the implication or non-implication relation among these models, the formal proof or the counter-example is provided. 展开更多
关键词 CRYPTOGRAPHY security data key agreement protocol proof model
在线阅读 下载PDF
Blockchain-Assisted Improved Cryptographic Privacy-Preserving FL Model with Consensus Algorithm for ORAN
6
作者 Raghavendra Kulkarni Venkata Satya Suresh kumar Kondeti +1 位作者 Binu Sudhakaran Pillai Surendran Rajendran 《Computers, Materials & Continua》 2026年第1期1862-1884,共23页
The next-generation RAN,known as Open Radio Access Network(ORAN),allows for several advantages,including cost-effectiveness,network flexibility,and interoperability.Now ORAN applications,utilising machine learning(ML)... The next-generation RAN,known as Open Radio Access Network(ORAN),allows for several advantages,including cost-effectiveness,network flexibility,and interoperability.Now ORAN applications,utilising machine learning(ML)and artificial intelligence(AI)techniques,have become standard practice.The need for Federated Learning(FL)for ML model training in ORAN environments is heightened by the modularised structure of the ORAN architecture and the shortcomings of conventional ML techniques.However,the traditional plaintext model update sharing of FL in multi-BS contexts is susceptible to privacy violations such as deep-leakage gradient assaults and inference.Therefore,this research presents a novel blockchain-assisted improved cryptographic privacy-preserving federated learning(BICPPFL)model,with the help of ORAN,to safely carry out federated learning and protect privacy.This model improves on the conventional masking technique for sharing model parameters by adding new characteristics.These features include the choice of distributed aggregators,validation for final model aggregation,and individual validation for BSs.To manage the security and privacy of FL processes,a combined homomorphic proxy-reencryption(HPReE)and lattice-cryptographic method(HPReEL)has been used.The upgraded delegated proof of stake(Up-DPoS)consensus protocol,which will provide quick validation of model exchanges and protect against malicious attacks,is employed for effective consensus across blockchain nodes.Without sacrificing performance metrics,the BICPPFL model strengthens privacy and adds security layers while facilitating the transfer of sensitive data across several BSs.The framework is deployed on top of a Hyperledger Fabric blockchain to evaluate its effectiveness.The experimental findings prove the reliability and privacy-preserving capability of the BICPPFL model. 展开更多
关键词 Open radio access network homomorphic proxy-re-encryption lattice-cryptography hyperledger fabric blockchain technology upgraded delegated proof of stake federated learning
在线阅读 下载PDF
Comments and Research on Proofs of Chain Rule 被引量:1
7
作者 张通 《Chinese Quarterly Journal of Mathematics》 CSCD 2001年第3期100-104,共5页
In this paper we point out that the proofs of Chain Rule in many intensively used textbooks are not strict an construct anexa mple of a composite function f(u) which is differentiable with respects t o the independe... In this paper we point out that the proofs of Chain Rule in many intensively used textbooks are not strict an construct anexa mple of a composite function f(u) which is differentiable with respects t o the independednt variable u, but is not differentiable with respect to the dependent variable u=g(x). A strict proof of Chain Rule is presented. Incon sistency of the form and content of Chain Rule is disclosed. 展开更多
关键词 Chain Rule proof unstrict
在线阅读 下载PDF
Study on Ignition Proof AZ91D Magnesium Alloy Chips with Cerium Addition 被引量:8
8
作者 周宏 李伟 +1 位作者 王明星 赵宇 《Journal of Rare Earths》 SCIE EI CAS CSCD 2005年第4期466-469,共4页
The effect of Ce on ignition point of AZ91D magnesium alloy chips was studied. For the AZ91D and the AZ91D-xCe magnesium alloys, changing the sizes of the chips in the range of 58 - 270 μm has a limited influence on ... The effect of Ce on ignition point of AZ91D magnesium alloy chips was studied. For the AZ91D and the AZ91D-xCe magnesium alloys, changing the sizes of the chips in the range of 58 - 270 μm has a limited influence on ignition point, however, the shift of the content of Ce has much effect on ignition point. Increasing the Ce content, x from 0.15 to 0.25, the ignition point increases with increasing of Ce; however, x from 0.25 to 0.45, the ignition point decreases with increasing of Ce. By the addition of Ce of 0.25 %. the ignition point is raised by 43℃. 展开更多
关键词 metal materials ignition proof CERIUM CHIPS magnesium alloy rare earths
在线阅读 下载PDF
Group Signature Based on Non-interactive Zero-Knowledge Proofs 被引量:2
9
作者 周福才 徐剑 +1 位作者 李慧 王兰兰 《China Communications》 SCIE CSCD 2011年第2期34-41,共8页
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. 展开更多
关键词 group signature non-interactive zero-knowledge proofs commitment scheme groth-sahai proofs system
在线阅读 下载PDF
Effect of yttrium,calcium and zirconium on ignition-proof principle and mechanical properties of magnesium alloys 被引量:7
10
作者 FAN Jianfeng CHEN Zhiyuan +2 位作者 YANG Weidong FANG Shuang XU Bingshe 《Journal of Rare Earths》 SCIE EI CAS CSCD 2012年第1期74-78,共5页
Good ignition-proof principle and mechanical properties were realized in Mg-Y-Ca-Zr alloy system.By adding Y and Ca elements,the ignition point of Mg-3.5Y-0.8Ca alloy was improved to over 1173 K,and the alloy could be... Good ignition-proof principle and mechanical properties were realized in Mg-Y-Ca-Zr alloy system.By adding Y and Ca elements,the ignition point of Mg-3.5Y-0.8Ca alloy was improved to over 1173 K,and the alloy could be melted in air without any protections.The ef-fect of Zr addition on the microstructures and mechanical properties of Mg-3.5Y-0.8Ca alloys were investigated,and Mg-3.5%Y-0.8%Ca-0.4%Zr alloy had good comprehensive properties with tensile strength of 190 MPa and elongation of 11%.Auger electron spectros-copy(AES)and X-ray diffraction(XRD)analysis revealed that the oxide film formed on the surface of Mg-3.5Y-0.8Ca alloy was mainly composed of Y2O3.Thermogravimetric measurements in dry air indicated that the oxidation dynamics curves measured at 773,873 and 973 K followed the cubic law.Moreover,the semiconductor characteristic of Y2O3 film and its effect on ignition-proof properties of Magnesium al-loys were discussed from the viewpoint of electrochemistry. 展开更多
关键词 magnesium alloys ignition proof principle mechanical properties rare earths
原文传递
A SIMPLE PROOF OF STABILITY AND CONVERGENCE IN L_2 FOR SOME DIFFERENCE SCHEMES AND THEIR EXTRAPOLATION METHOD FOR PARABOLIC EQUATIONS 被引量:1
11
作者 孙志忠 《Journal of Southeast University(English Edition)》 EI CAS 1994年第2期1-6,共6页
ASIMPLEPROOFOFSTABILITYANDCONVERGENCEINL_2FORSOMEDIFFERENCESCHEMESANDTHEIREXTRAPOLATIONMETHODFORPARABOLICEQU... ASIMPLEPROOFOFSTABILITYANDCONVERGENCEINL_2FORSOMEDIFFERENCESCHEMESANDTHEIREXTRAPOLATIONMETHODFORPARABOLICEQUATIONSSunZhizhong... 展开更多
关键词 simpld proof Wabelic equatiuns DIFFERENCE SCHEMES STABILITY convergenee EXTRAPOLATION METHOD
在线阅读 下载PDF
Game-Based Automated Security Proofs for Cryptographic Protocols 被引量:1
12
作者 顾纯祥 光焱 祝跃飞 《China Communications》 SCIE CSCD 2011年第4期50-57,共8页
Provable security has become a popular approach for analyzing the security of cryptographic protocols.However,writing and verifying proofs by hand are prone to errors.This paper advocates the automatic security proof ... Provable security has become a popular approach for analyzing the security of cryptographic protocols.However,writing and verifying proofs by hand are prone to errors.This paper advocates the automatic security proof framework with sequences of games.We make slight modifications to Blanchet's calculus to make it easy for parsing the initial game.The main contribution of this work is that it introduces algebraic properties with observational equivalences to automatic security proofs,and thus can deal with some practical cryptographic schemes with hard problems.We illustrate the use of algebraic properties in the framework by proving the semantic security of the ElGamal encryption scheme. 展开更多
关键词 cryptographic protocols probable security automatic security proof process calculus
在线阅读 下载PDF
Local Geometric Proof of Riemann Conjecture 被引量:3
13
作者 Chuanmiao Chen 《Advances in Pure Mathematics》 2020年第10期589-610,共22页
Riemann hypothesis (RH) is a difficult problem. So far one doesn’t know how to go about it. Studying ζ and using analysis method likely are two incor-rect guides. Actually, a unique hope may study Riemann function &... Riemann hypothesis (RH) is a difficult problem. So far one doesn’t know how to go about it. Studying ζ and using analysis method likely are two incor-rect guides. Actually, a unique hope may study Riemann function <img alt="" src="Edit_8fcdfff5-6b95-42a4-8f47-2cabe2723dfc.bmp" />, <img alt="" src="Edit_6ce3a4bd-4c68-49e5-aabe-dec3e904e282.bmp" />, <img alt="" src="Edit_29ea252e-a81e-4b21-a41c-09209c780bb2.bmp" /> by geometric analysis, which has the symmetry: v=0 if β=0, and basic expression <img alt="" src="Edit_bc7a883f-312d-44fd-bcdd-00f25c92f80a.bmp" />. We show that |u| is single peak in each root-interval <img alt="" src="Edit_d7ca54c7-4866-4419-a4bd-cbb808b365af.bmp" /> of u for fixed β ∈(0,1/2]. Using the slope u<sub>t</sub>, we prove that v has opposite signs at two end-points of I<sub>j</sub>. There surely exists an inner point such that , so {|u|,|v|/β} form a local peak-valley structure, and have positive lower bound <img alt="" src="Edit_bac1a5f6-673e-49b6-892c-5adff0141376.bmp" /> in I<sub>j</sub>. Because each t must lie in some I<sub>j</sub>, then ||ξ|| > 0 is valid for any t (i.e. RH is true). Using the positivity <img alt="" src="Edit_83c3d2cf-aa7e-4aba-89f5-0eb44659918a.bmp" /> of Lagarias (1999), we show the strict monotone <img alt="" src="Edit_87eb4e9e-bc7b-43e3-b316-5dcf0efaf0d5.bmp" /> for β > β<sub>0</sub> ≥ 0 , and the peak-valley structure is equiva-lent to RH, which may be the geometric model expected by Bombieri (2000). This research follows Liuhui’s methodology: “Computing can detect the un-known and method”. 展开更多
关键词 Riemann Conjecture Local Geometric proof Symmetry Peak-Valley Struc-ture EQUIVALENCE Liuhui’s Methodology
在线阅读 下载PDF
A Privacy-Preserving Grouping Proof Protocol Based on ECC with Untraceability for RFID 被引量:1
14
作者 Wen-Tsai Ko Shin-Yan Chiou +1 位作者 Erl-Huei Lu Henry Ker-Chang Chang 《Applied Mathematics》 2012年第4期336-341,共6页
An RFID (Radio-Frequency IDentification) system provides the mechanism to identify tags to readers and then to execute specific RFID-enabled applications. In those applications, secure protocols using lightweight cryp... An RFID (Radio-Frequency IDentification) system provides the mechanism to identify tags to readers and then to execute specific RFID-enabled applications. In those applications, secure protocols using lightweight cryptography need to be developed and the privacy of tags must be ensured. In 2010, Batina et al. proposed a privacy-preserving grouping proof protocol for RFID based on ECC (Elliptic Curve Cryptography) in public-key cryptosystem. In the next year, Lv et al. had shown that Batina et al.’s protocol was insecure against the tracking attack such that the privacy of tags did not be preserved properly. Then they proposed a revised protocol based on Batina et al.’s work. Their revised protocol was claimed to have all security properties and resisted tracking attack. But in this paper, we prove that Lv et al.’s protocol cannot work properly. Then we propose a new version protocol with some nonce to satisfy the functions of Batina et al.’s privacy-preserving grouping proof protocol. Further we try the tracing attack made by Lv et al. on our protocol and prove our protocol can resist this attack to recover the untraceability. 展开更多
关键词 ECC RFID GROUPING proof PRIVACY-PRESERVING
在线阅读 下载PDF
Transparent broadband microwave metamaterial absorber with thermal insulating and soundproof 被引量:2
15
作者 YANG Chang CHEN Sai +2 位作者 NIU Shuai XIAO Lin QU Yan-chen 《Optoelectronics Letters》 EI 2021年第2期85-89,共5页
Nowadays, multi-functional materials are desperately required for adapting the complex environment, which urges us to take more factors into consideration. Here, we proposed a broadband microwave absorber with multi-f... Nowadays, multi-functional materials are desperately required for adapting the complex environment, which urges us to take more factors into consideration. Here, we proposed a broadband microwave absorber with multi-functionality such as optically transparent, thermal insulating and soundproof properties. Using indium tin oxide(ITO) based metamaterial, the device can achieve above 90% microwave absorption from 5.6 GHz to 23 GHz(cover X and Ku band). Moreover, with designed vacuum structure inside, the device is thermal insulating and soundproof. These multi-functional advantages give the absorber more flexibility in electromagnetic shielding and stealth application, which can be potentially applied in windows related industry. 展开更多
关键词 ABSORBER MICROWAVE proof
原文传递
Proof of concept study to identify candidate biomarkers of fibrosis using high throughput peptide aptamer microarray and validate by enzyme linked immunosorbant assay 被引量:1
16
作者 Sam Straw Paul Ko Ferrigno +2 位作者 Qifeng Song Darren Tomlinson Francesco Del Galdo 《Journal of Biomedical Science and Engineering》 2013年第8期32-42,共11页
Background: Nine proteins were identified as putative profibrotic biomarkers in systemic sclerosis (SSc) and an unrelated fibrotic disease in a previously published proteomic study. As the majority of these proteins w... Background: Nine proteins were identified as putative profibrotic biomarkers in systemic sclerosis (SSc) and an unrelated fibrotic disease in a previously published proteomic study. As the majority of these proteins were orphans of commercially available antibodies, the nine proteins were investigated to determine whether binding peptide aptamers of the Stefin A quadruple mutant-Tracy variant (referred to as “affimers”) could be validated by enzyme linked immunosorbant assay (ELISA) to allow the quantification of these candidate biomarkers in the sera of SSc patients. Materials and Methods: Candidate biomarker peptides were analysed by high throughput affimer microarray to identify binding affimers. Two candidate biomarkers were prioritised, and binding affimers were expressed from genetically modified BL21 competent E. coli strains and purified. These affimers were used in indirect ELISA, and then sandwich ELISA formats against the candidate biomarker recombinant proteins osteonectin and pigment epi-thetlium-derived factor (PEDF). Results: 39 affimers were identified as binders for eight of the nine candidate biomarker peptides were by affimer microarray;six for osteonectin and eleven for PEDF. Two of the six and all eleven were able to recognize physiological concentrations (5 and 1 μg·ml﹣1) of osteonectin and PEDF, respectively by indirect ELISA. In sandwich ELISA format: two affimers were able to detect recombinant PEDF;however, the two affimers identified in indirect ELISA were unable to recognise recombinant osteonectin, and were thus hypothesised to bind to osteonectin at the same binding site. Discussion: SSc is currently an orphan of fully validated biomarkers, which is required for the development of stratified medicine in this field. This approach has laid the groundwork for an affimer based on multiplexed assay, to validate biomarkers in the sera of SSc patients in the future. 展开更多
关键词 FIBROSIS Biomarker Peptide APTAMER SYSTEMIC SCLEROSIS proof of Concept
暂未订购
An Elementary Proof of Fermat’s Last Theorem for Epsilons 被引量:2
17
作者 Bibek Baran Nag 《Advances in Pure Mathematics》 2021年第8期735-740,共6页
The author presents a new approach which is used to solve an important Diophantine problem. An elementary argument is used to furnish another fully transparent proof of Fermat’s Last Theorem. This was first stated by... The author presents a new approach which is used to solve an important Diophantine problem. An elementary argument is used to furnish another fully transparent proof of Fermat’s Last Theorem. This was first stated by Pierre de Fermat in the seventeenth century. It is widely regarded that no elementary proof of this theorem exists. The author provides evidence to dispel this belief. 展开更多
关键词 DIOPHANTINE EQUATIONS Fermat Fermat’s LAST THEOREM ELEMENTARY Number Modular proof Factorize
在线阅读 下载PDF
Evaluating Pedagogical Quality of Learning Activities Using Fuzzy Evaluation Mappings: The Case of Pedagogical Games of Mathematical Proof 被引量:1
18
作者 Pascal Stiefenhofer 《Applied Mathematics》 2022年第5期432-452,共21页
This paper introduces a conceptual framework for developing pedagogical games of mathematical proof (PGMP) designed to help non-STEM students learn mathematical reasoning in a playful manner and without “fear”. With... This paper introduces a conceptual framework for developing pedagogical games of mathematical proof (PGMP) designed to help non-STEM students learn mathematical reasoning in a playful manner and without “fear”. Within the constructivist learning paradigm it develops an in-class learning activity where social science students learn the concept of mathematical deduction playfully using toys to construct tables from which formal proofs of propositions are derived without calculations. A PGMP pedagogy quality assurance evaluation method based on fuzzy evaluation mappings capturing learning effectiveness, learning efficiency, and learning satisfaction is introduced. Our results from an in-class experiment show that pedagogical games of mathematical proof help non-STEM students to effectively engage with mathematical reasoning playfully. The results are consistent according to a quality assurance consistency index. 展开更多
关键词 Pedagogy Quality Assurance Pedagogical Games Mathematics Anxiety proof TOYS
在线阅读 下载PDF
Membership Proof and Verification in Authenticated Skip Lists Based on Heap 被引量:1
19
作者 Shuanghe Peng Zhige Chen Deen Chen 《China Communications》 SCIE CSCD 2016年第6期195-204,共10页
How to keep cloud data intact and available to users is a problem to be solved. Authenticated skip list is an important data structure used in cloud data integrity verification. How to get the membership proof of the ... How to keep cloud data intact and available to users is a problem to be solved. Authenticated skip list is an important data structure used in cloud data integrity verification. How to get the membership proof of the element in authenticated skip list efficiently is an important part of authentication. Kaouthar Blibech and Alban Gabillon proposed a head proof and a tail proof algorithms for the membership proof of elements in the authenticated skip list. However, the proposed algorithms are uncorrelated each other and need plateau function. We propose a new algorithm for computing the membership proof for elements in the authenticated skip list by using two stacks, one is for storing traversal chain of leaf node, the other is for storing authentication path for the leaf. The proposed algorithm is simple and effective without needing plateau function. It can also be applicable for other similar binary hash trees. 展开更多
关键词 authenticated skip list max heap membership proof STACK algorithms
在线阅读 下载PDF
上一页 1 2 250 下一页 到第
使用帮助 返回顶部