|
|
|
题名
|
作者
|
年代
|
出处
|
被引量
|
| 1 | Strong Verifiable Secret Sharing Scheme显示文摘 | Harn L Lin Changlu | 2010 | Information Sciences2010，180，16： | 1 |
| 2 | Design of DLbased certificateless digital signatures显示文摘 | Lein Harn Jian Ren Changlu Lin | 2009 | Journal of Systems and Software2009，82，5： | 1 |
| 3 | Fair secret reconstructionin (tn) secret sharing显示文摘 | Harn L Lin Changlu Li Yong | 2015 | Journal of Information Securityand Application2015，23，： | 1 |
| 4 | Strong ( n , t , n ) verifiable secret sharing scheme显示文摘 | Lein Harn Changlu Lin | 2010 | Information Sciences2010，，16： | 1 |
| 5 | Authenticated Group Key Transfer Protocol Based on Secret Sharing显示文摘 | Harn L Lin Changlu | 2010 | IEEE Transactions on Computers2010，59，6： | 1 |
| 6 | Authenticated Group Key Transfer Protocol Based on Secret Sharing显示文摘 | Harn L Lin Changlu | | 0，，06： | 1 |
| 7 | Design of DL-Based Certificateless Digital Signatures显示文摘 | Ham L Ren Jian Lin Changlu | 2009 | The Journal of Systems and Software2009，，82： | 1 |
| 8 | Efficient On-line/Off-line Sig- nature Schemes Based on Multiple-collision Trapdoor Hash Families显示文摘 | Harm L Hsin W J Lin Changlu | 2009 | Journal of Systems and Software2009，82，5： | 1 |
| 9 | Design of DL-based certificateless digital signatures显示文摘 | HARN L REN JIAN LIN CHANGLU | 2009 | The Journal of Systems and Software2009，82，5： | 1 |
| 10 | Strong(n, t, n)verifiable secret shar-ing scheme显示文摘 | Ham L Lin Changlu | 2010 | Information Sciences2010，180，16： | 1 |
| 11 | Strong(n,t,n)Verifiable Secret Sharing Scheme显示文摘 | Harn L Lin Changlu | | 0，，16： | 1 |
| 12 | Provably Secure Self-Certified Signature Schemes with Message Recovery显示文摘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. | Zhang Shengyuan Tang Fei Lin Changlu Ke Pinhui | 2012 | China Communications2012，9，10： | 0 |
| 13 | A Pore-Forming Strategy Toward Porous Carbon-Based Substrates for High Performance Flexible Lithium Metal Full Batteries显示文摘Self-standing carbon-based substrates with satisfied structural stability and property adjustability have promising applications in flexible lithium(Li)metal batteries(FLMBs).Current strategies for modifying carbon materials are normally carried out on powder carbon,and very few of them are suitable for self-standing carbon substrates.Herein,a pore-forming strategy based on the redox chemistry of metallic oxide nanodots is developed to prepare two porous carbon substrates for anode and cathode.Starting with cotton cloth,the resulting hollow carbon fibers substrate with nanopores effectively prevents from Li dendrites formation and large volume change in lithium metal anode(LMA).Simulations indicate that the porous structure leads to homogeneous ion flux,Li-ion concentration,and electric field during Li deposition.Li symmetrical cell based on this substrate remains stable for 8300 h with an ultralow voltage hysteresis of 9 mV.Via a similar route,porous carbon cloth substrate is obtained for subsequently seeding V_(2)O_(5)nanowires to prepare the cathode.The assembled FLMBs pouch cell delivers a capacity of 8.2 mAh with a high capacity retention of~100%even under dramatic deformation.The demonstrated strategy has far-reaching potential in preparing free-standing porous carbon-based materials for flexible energy storage devices. | Yanfei Li Shuyang Ye Jian Lin Yihan Song Xinglong Wu Jingping Zhang Changlu Shao Zhongmin Su Haizhu Sun Dwight S.Seferos | 2023 | Energy & Environmental Materials2023，6，3： | 0 |
| 14 | Zero-pole cancellation for identity-based aggregators:a constant-size designated verifier-set signature显示文摘In this paper we present a designated verifier-set signature(DVSS),in which the signer allows to designate many verifiers rather than one verifier,and each designated verifier can verify the validity of signature by himself.Our research starts from identity-based aggregator(IBA)that compresses a designated set of verifier’s identities to a constant-size random string in cryptographic space.The IBA is constructed by mapping the hash of verifier’s identity into zero or pole of a target curve,and extracting one curve’s point as the result of aggregation according to a specific secret.Considering the different types of target curves,these two IBAs are called as zeros-based aggregator and poles-based aggregator,respectively.Based on them,we propose a practical DVSS scheme constructed from the zero-pole cancellation method which can eliminate the same elements between zeros-based aggregator and poles-based aggregator.Due to this design,our DVSS scheme has some distinct advantages:(1)the signature supporting arbitrary dynamic verifiers extracted from a large number of users;and(2)the signature with short and constant length.We rigorously prove that our DVSS scheme satisfies the security properties:correctness,consistency,unforgeability and exclusivity.This is a preview of subscription content,log in to check access. | E CHEN Yan ZHU Changlu LIN Kewei LV | 2020 | Frontiers of Computer Science2020，14，4： | 0 |
| 15 | Ramp Scheme Based on CRT for Polynomial Ring over Finite Field显示文摘Chinese Reminder Theorem(CRT)for integers has been widely used to construct secret sharing schemes for different scenarios,but these schemes have lower information rates than that of Lagrange interpolation-based schemes.In ASIACRYPT 2018,Ning,et al.constructed a perfect(r,n)-threshold scheme based on CRT for polynomial ring over finite field,and the corresponding information rate is one which is the greatest case for a(r,n)-threshold scheme.However,for many practical purposes,the information rate of Ning,et al.scheme is low and perfect security is too much security.In this work,the authors generalize the Ning,et al.(r,n)-threshold scheme to a(t,r,n)-ramp scheme based on CRT for polynomial ring over finite field,which attains the greatest information rate(r−t)for a(t,r,n)-ramp scheme.Moreover,for any given 2≤r_(1) | DING Jian KE Pinhui LIN Changlu WANG Huaxiong | 2023 | Journal of Systems Science & Complexity2023，36，1： | 0 |
您所在的机构暂未开通此部分的功能，请联系管理员