Kolmogorov's exponential inequalities are basic tools for studying the strong limit theorems such as the classical laws of the iterated logarithm for both independent and dependent random variables. This paper est...Kolmogorov's exponential inequalities are basic tools for studying the strong limit theorems such as the classical laws of the iterated logarithm for both independent and dependent random variables. This paper establishes the Kolmogorov type exponential inequalities of the partial sums of independent random variables as well as negatively dependent random variables under the sub-linear expectations. As applications of the exponential inequalities, the laws of the iterated logarithm in the sense of non-additive capacities are proved for independent or negatively dependent identically distributed random variables with finite second order moments.For deriving a lower bound of an exponential inequality, a central limit theorem is also proved under the sublinear expectation for random variables with only finite variances.展开更多
We prove a new Donsker’s invariance principle for independent and identically distributed random variables under the sub-linear expectation.As applications,the small deviations and Chung’s law of the iterated logari...We prove a new Donsker’s invariance principle for independent and identically distributed random variables under the sub-linear expectation.As applications,the small deviations and Chung’s law of the iterated logarithm are obtained.展开更多
In this paper, we discuss the moving-average process Xk = ∑i=-∞ ^∞ ai＋kεi, where {εi;-∞ 〈 i 〈 ∞} is a doubly infinite sequence of identically distributed ψ-mixing or negatively associated random variables w...In this paper, we discuss the moving-average process Xk = ∑i=-∞ ^∞ ai＋kεi, where {εi;-∞ 〈 i 〈 ∞} is a doubly infinite sequence of identically distributed ψ-mixing or negatively associated random variables with mean zeros and finite variances, {ai;-∞ 〈 i 〈 -∞） is an absolutely solutely summable sequence of real numbers.展开更多
The present paper first shows that, without any dependent structure assumptions for a sequence of random variables, the refined results of the complete convergence for the sequence is equivalent to the corresponding c...The present paper first shows that, without any dependent structure assumptions for a sequence of random variables, the refined results of the complete convergence for the sequence is equivalent to the corresponding complete moment convergence of the sequence. Then this paper investigates the convergence rates and refined convergence rates （or complete moment convergence） for probabilities of moderate deviations of moving average processes. The results in this paper extend and generalize some well-known results.展开更多
In the study, the digital multi-signature scheme, constructed by theintegration of one-way hash function and identification scheme, are proposed based on the ellipticcurve cryptosystem (ECC). To the efficiency in perf...In the study, the digital multi-signature scheme, constructed by theintegration of one-way hash function and identification scheme, are proposed based on the ellipticcurve cryptosystem (ECC). To the efficiency in performance, the ECC has been generally regarded aspositive; and the security caused by the Elliptic Curve Discrete Logarithm Problem (ECDLP) is highlyalso taken highly important. The main characteristic of the proposed scheme is that the length ofthe multi-signature is fixed rather than changeable and it will not increase with the number ofgroup members.展开更多
Let{X,Xn;n≥1} be a sequence of i,i.d, random variables, E X = 0, E X^2 = σ^2 〈 ∞.Set Sn=X1＋X2＋…＋Xn,Mn=max k≤n│Sk│,n≥1.Let an=O（1/loglogn）.In this paper,we prove that,for b〉-1,lim ε→0 →^2（b＋1）∑n=1...Let{X,Xn;n≥1} be a sequence of i,i.d, random variables, E X = 0, E X^2 = σ^2 〈 ∞.Set Sn=X1＋X2＋…＋Xn,Mn=max k≤n│Sk│,n≥1.Let an=O（1/loglogn）.In this paper,we prove that,for b〉-1,lim ε→0 →^2（b＋1）∑n=1^∞ （loglogn）^b/nlogn n^1/2 E{Mn-σ（ε＋an）√2nloglogn}＋σ2^-b/（b＋1）（2b＋3）E│N│^2b＋3∑k=0^∞ （-1）k/（2k＋1）^2b＋3 holds if and only if EX=0 and EX^2=σ^2〈∞.展开更多
Ⅰ. INTRODUCTIONLet X<sub>1</sub>, X<sub>2</sub>, X<sub>3</sub>, …be i. i. d. random variables each having distribution function F（x）, and X<sub>n</sub>, 1≤…≤X<...Ⅰ. INTRODUCTIONLet X<sub>1</sub>, X<sub>2</sub>, X<sub>3</sub>, …be i. i. d. random variables each having distribution function F（x）, and X<sub>n</sub>, 1≤…≤X<sub>n,n</sub> the order statistics of X<sub>1</sub>, …, X<sub>n</sub>. Suppose that there exist constants α<sub>&</sub>gt;O and β<sub>n</sub>∈R and some r∈R such展开更多
Let {X,X n;n≥1} be a strictly stationary sequence of ρ-mixing random variables with mean zero and finite variance. Set S n=n k=1X k,M n=max k≤n｜S k｜,n≥1. Suppose lim n→∞ES2 n/n=∶σ2>0 and ∞...Let {X,X n;n≥1} be a strictly stationary sequence of ρ-mixing random variables with mean zero and finite variance. Set S n=n k=1X k,M n=max k≤n｜S k｜,n≥1. Suppose lim n→∞ES2 n/n=∶σ2>0 and ∞n=1ρ 2/d(2n)<∞, where d=2,if -1<b<0 and d>2(b+1),if b≥0. It is proved that,for any b>-1, limε0ε 2(b+1)∞n=1(loglogn)bnlognP{M n≥εσ2nloglogn}= 2(b+1)πГ(b+3/2)∞k=0(-1)k(2k+1) 2b+2,where Г(·) is a Gamma function.展开更多
A hyperelliptic curve digital signature algorithm （HECDSA） can be viewed as the hyperelliptic curve analogue of the standard digital signature algorithm （DSA）. This article discusses divisor evaluations, the basic...A hyperelliptic curve digital signature algorithm （HECDSA） can be viewed as the hyperelliptic curve analogue of the standard digital signature algorithm （DSA）. This article discusses divisor evaluations, the basic HECDSA, variants, two HECDSA equations and a 4-tuple HECDSA scheme, and puts forward a generalized equation for HECDSA. From this generalized equation, seven general HECDSA types are derived based on the efficiency requirements. Meanwhile, the securities of these general HECDSA types are analyzed in detail.展开更多
Several public-key encryption schemes used to solve the problem of ciphertext data processing on the fly are discussed. A new targeted fully homomorphic encryption scheme based on the discrete logarithm problem is pre...Several public-key encryption schemes used to solve the problem of ciphertext data processing on the fly are discussed. A new targeted fully homomorphic encryption scheme based on the discrete logarithm problem is presented. Public-key encryption cryptosystems are classified to examine homomorphic encryption. Without employing techniques proposed by Gentry such as somewhat homomorphic and bootstrapping techniques, or relinearization technique proposed by Brakerski et al., a new method called ＂Double Decryption Algorithm＂ is employed in our cryptography to satisfy a fully or targeted fully homomorphic property. Inspired by EIGamal and BGN cryptography, we obtain the desired fully homomorphic property by selecting a new group and adding an extra component to the ciphertext. Proof of semantic security is also demonstrated.展开更多
本文以5个学科的SCI期刊和论文为研究对象,取不同底数的对数对每一学科论文被引频次进行转换,计算各期刊对数矫正影响因子(IF_(log)),以各期刊IF_(log)除以所在学科所有期刊IF_(log)平均值,进行学科标准化处理,创建学科标准化影响因子(c...本文以5个学科的SCI期刊和论文为研究对象,取不同底数的对数对每一学科论文被引频次进行转换,计算各期刊对数矫正影响因子(IF_(log)),以各期刊IF_(log)除以所在学科所有期刊IF_(log)平均值,进行学科标准化处理,创建学科标准化影响因子(cnIF_(log)),探讨cnIF_(log)在学术期刊跨学科评价中的优越性。研究结果显示,5个学科期刊的IF_(log)均呈正态分布,且无论同一学科还是不同学科期刊的IF_(log1.5)、IF_(ln)、IF_(log5)、IF_(log10)之间均呈100%正相关(r=1.000,P=0.000)。与影响因子(IF2018)、平均影响因子百分位(average impact factor percentile,aJIFP)、期刊PR8指数(journal index of eight percentile rank classes,JIPR8)、IFlog和相对影响因子(relative IF2018,rIF2018)等指标相比,cnIF_(log1.5)(category normalization for IF_(log1.5))在5个学科期刊中变异程度最小、与aJIFP和JIPR8的相关度最高,具有理想的区分度和稳定性。无论同一学科还是跨学科期刊评价,cnIF_(log1.5)均是理想的评价指标。展开更多
Signcryption, which was introduced by ZHEN~ is a cryptographic primitive that fulfils the functions of both digital signature and encryption and guarantees confidentiality, integrity and non-repudiation in a more effi...Signcryption, which was introduced by ZHEN~ is a cryptographic primitive that fulfils the functions of both digital signature and encryption and guarantees confidentiality, integrity and non-repudiation in a more effi- cient way. Certificateless signcryption and pro- xy signcryption in identity-based cryptography were proposed for different applications. Most of these schemes are constructed by bilinear pairings from elliptic curves. However, some schemes were recently presented without pai- rings. In this paper, we present a certificateless proxy identity-based signcryption scheme with- out bilinear pairings, which is efficient and secure.展开更多
We obtain a general invariance principle of G-Brownian motion for the law of the iterated logarithm(LIL for short). For continuous bounded independent and identically distributed random variables in G-expectation spac...We obtain a general invariance principle of G-Brownian motion for the law of the iterated logarithm(LIL for short). For continuous bounded independent and identically distributed random variables in G-expectation space, we also give an invariance principle for LIL. In some sense, this result is an extension of the classical Strassen's invariance principle to the case where probability measure is no longer additive. Furthermore,we give some examples as applications.展开更多
Limit theorems for non-additive probabilities or non-linear expectations are challenging issues which have attracted a lot of interest recently.The purpose of this paper is to study the strong law of large numbers and...Limit theorems for non-additive probabilities or non-linear expectations are challenging issues which have attracted a lot of interest recently.The purpose of this paper is to study the strong law of large numbers and the law of the iterated logarithm for a sequence of random variables in a sub-linear expectation space under a concept of extended independence which is much weaker and easier to verify than the independence proposed by Peng[20].We introduce a concept of extended negative dependence which is an extension of the kind of weak independence and the extended negative independence relative to classical probability that has appeared in the recent literature.Powerful tools such as moment inequality and Kolmogorov’s exponential inequality are established for these kinds of extended negatively independent random variables,and these tools improve a lot upon those of Chen,Chen and Ng[1].The strong law of large numbers and the law of iterated logarithm are also obtained by applying these inequalities.展开更多
基金supported by National Natural Science Foundation of China (Grant No. 11225104)the National Basic Research Program of China (Grant No. 2015CB352302)the Fundamental Research Funds for the Central Universities
文摘Kolmogorov's exponential inequalities are basic tools for studying the strong limit theorems such as the classical laws of the iterated logarithm for both independent and dependent random variables. This paper establishes the Kolmogorov type exponential inequalities of the partial sums of independent random variables as well as negatively dependent random variables under the sub-linear expectations. As applications of the exponential inequalities, the laws of the iterated logarithm in the sense of non-additive capacities are proved for independent or negatively dependent identically distributed random variables with finite second order moments.For deriving a lower bound of an exponential inequality, a central limit theorem is also proved under the sublinear expectation for random variables with only finite variances.
基金This research supported by Grants from the National Natural Science Foundation of China(No.11225104)and the Fundamental Research Funds for the Central Universities.
文摘We prove a new Donsker’s invariance principle for independent and identically distributed random variables under the sub-linear expectation.As applications,the small deviations and Chung’s law of the iterated logarithm are obtained.
基金Research supported by National Natural Science Foundation of China
文摘In this paper, we discuss the moving-average process Xk = ∑i=-∞ ^∞ ai＋kεi, where {εi;-∞ 〈 i 〈 ∞} is a doubly infinite sequence of identically distributed ψ-mixing or negatively associated random variables with mean zeros and finite variances, {ai;-∞ 〈 i 〈 -∞） is an absolutely solutely summable sequence of real numbers.
基金National Natural Science Foundation of China (Grant No.60574002)MASCOS grant from Australian Research CouncilNational Natural Science Foundation of China (Grant No.70671018)
文摘The present paper first shows that, without any dependent structure assumptions for a sequence of random variables, the refined results of the complete convergence for the sequence is equivalent to the corresponding complete moment convergence of the sequence. Then this paper investigates the convergence rates and refined convergence rates （or complete moment convergence） for probabilities of moderate deviations of moving average processes. The results in this paper extend and generalize some well-known results.
文摘In the study, the digital multi-signature scheme, constructed by theintegration of one-way hash function and identification scheme, are proposed based on the ellipticcurve cryptosystem (ECC). To the efficiency in performance, the ECC has been generally regarded aspositive; and the security caused by the Elliptic Curve Discrete Logarithm Problem (ECDLP) is highlyalso taken highly important. The main characteristic of the proposed scheme is that the length ofthe multi-signature is fixed rather than changeable and it will not increase with the number ofgroup members.
基金Research supported by National Nature Science Foundation of China:10471126
文摘Let{X,Xn;n≥1} be a sequence of i,i.d, random variables, E X = 0, E X^2 = σ^2 〈 ∞.Set Sn=X1＋X2＋…＋Xn,Mn=max k≤n│Sk│,n≥1.Let an=O（1/loglogn）.In this paper,we prove that,for b〉-1,lim ε→0 →^2（b＋1）∑n=1^∞ （loglogn）^b/nlogn n^1/2 E{Mn-σ（ε＋an）√2nloglogn}＋σ2^-b/（b＋1）（2b＋3）E│N│^2b＋3∑k=0^∞ （-1）k/（2k＋1）^2b＋3 holds if and only if EX=0 and EX^2=σ^2〈∞.
基金Project supported by the National Natural Science Foundation of China.
文摘Ⅰ. INTRODUCTIONLet X<sub>1</sub>, X<sub>2</sub>, X<sub>3</sub>, …be i. i. d. random variables each having distribution function F（x）, and X<sub>n</sub>, 1≤…≤X<sub>n,n</sub> the order statistics of X<sub>1</sub>, …, X<sub>n</sub>. Suppose that there exist constants α<sub>&</sub>gt;O and β<sub>n</sub>∈R and some r∈R such
基金Research supported by the National Natural Science Foundation of China (1 0 0 71 0 72 )
文摘Let {X,X n;n≥1} be a strictly stationary sequence of ρ-mixing random variables with mean zero and finite variance. Set S n=n k=1X k,M n=max k≤n｜S k｜,n≥1. Suppose lim n→∞ES2 n/n=∶σ2>0 and ∞n=1ρ 2/d(2n)<∞, where d=2,if -1<b<0 and d>2(b+1),if b≥0. It is proved that,for any b>-1, limε0ε 2(b+1)∞n=1(loglogn)bnlognP{M n≥εσ2nloglogn}= 2(b+1)πГ(b+3/2)∞k=0(-1)k(2k+1) 2b+2,where Г(·) is a Gamma function.
基金supported by the National Natural Science Foundation of China (60763009)the Science and Technology Key Project of the Ministry of Education of China (207089)Zhejiang Natural Science Foundation of Outstanding Youth Team Project (R1090138)
文摘A hyperelliptic curve digital signature algorithm （HECDSA） can be viewed as the hyperelliptic curve analogue of the standard digital signature algorithm （DSA）. This article discusses divisor evaluations, the basic HECDSA, variants, two HECDSA equations and a 4-tuple HECDSA scheme, and puts forward a generalized equation for HECDSA. From this generalized equation, seven general HECDSA types are derived based on the efficiency requirements. Meanwhile, the securities of these general HECDSA types are analyzed in detail.
基金supported by the National Natural Science Foundation of China (No. 61370188)Beijing Higher Education Young Elite Teacher Project+1 种基金Fundamental Research Funds for the Central Universities (Nos. 2014CLJH09 and 2014GCYY05)Research Funds of Information Security Key Laboratory of Beijing Electronic Science and Technology Institute
文摘Several public-key encryption schemes used to solve the problem of ciphertext data processing on the fly are discussed. A new targeted fully homomorphic encryption scheme based on the discrete logarithm problem is presented. Public-key encryption cryptosystems are classified to examine homomorphic encryption. Without employing techniques proposed by Gentry such as somewhat homomorphic and bootstrapping techniques, or relinearization technique proposed by Brakerski et al., a new method called ＂Double Decryption Algorithm＂ is employed in our cryptography to satisfy a fully or targeted fully homomorphic property. Inspired by EIGamal and BGN cryptography, we obtain the desired fully homomorphic property by selecting a new group and adding an extra component to the ciphertext. Proof of semantic security is also demonstrated.
文摘本文以5个学科的SCI期刊和论文为研究对象,取不同底数的对数对每一学科论文被引频次进行转换,计算各期刊对数矫正影响因子(IF_(log)),以各期刊IF_(log)除以所在学科所有期刊IF_(log)平均值,进行学科标准化处理,创建学科标准化影响因子(cnIF_(log)),探讨cnIF_(log)在学术期刊跨学科评价中的优越性。研究结果显示,5个学科期刊的IF_(log)均呈正态分布,且无论同一学科还是不同学科期刊的IF_(log1.5)、IF_(ln)、IF_(log5)、IF_(log10)之间均呈100%正相关(r=1.000,P=0.000)。与影响因子(IF2018)、平均影响因子百分位(average impact factor percentile,aJIFP)、期刊PR8指数(journal index of eight percentile rank classes,JIPR8)、IFlog和相对影响因子(relative IF2018,rIF2018)等指标相比,cnIF_(log1.5)(category normalization for IF_(log1.5))在5个学科期刊中变异程度最小、与aJIFP和JIPR8的相关度最高,具有理想的区分度和稳定性。无论同一学科还是跨学科期刊评价,cnIF_(log1.5)均是理想的评价指标。
基金supported by the National Natural Science Foundation of China under Grants No.61272499,No.10990011
文摘Signcryption, which was introduced by ZHEN~ is a cryptographic primitive that fulfils the functions of both digital signature and encryption and guarantees confidentiality, integrity and non-repudiation in a more effi- cient way. Certificateless signcryption and pro- xy signcryption in identity-based cryptography were proposed for different applications. Most of these schemes are constructed by bilinear pairings from elliptic curves. However, some schemes were recently presented without pai- rings. In this paper, we present a certificateless proxy identity-based signcryption scheme with- out bilinear pairings, which is efficient and secure.
基金supported by China Postdoctoral Science Foundation(Grant No.2013M541899)the Natural Science Foundation of Shandong Province of China(Grant Nos.ZR2013AQ021 and ZR2014AM002)+1 种基金National Natural Science Foundation of China(Grant Nos.11471190,11401414 and 11231005)the Natural Science Foundation of Jiangsu Province of China(Grant No.BK20140299)
文摘We obtain a general invariance principle of G-Brownian motion for the law of the iterated logarithm(LIL for short). For continuous bounded independent and identically distributed random variables in G-expectation space, we also give an invariance principle for LIL. In some sense, this result is an extension of the classical Strassen's invariance principle to the case where probability measure is no longer additive. Furthermore,we give some examples as applications.
基金Project Supported by NSFC (10131040)SRFDP (2002335090)
文摘A law of iterated logarithm for R/S statistics with the help of the strong approximations of R/S statistics by functions of a Wiener process is shown.
基金Research supported by grants from the NSF of China(1173101212031005)+2 种基金Ten Thousands Talents Plan of Zhejiang Province(2018R52042)NSF of Zhejiang Province(LZ21A010002)the Fundamental Research Funds for the Central Universities。
文摘Limit theorems for non-additive probabilities or non-linear expectations are challenging issues which have attracted a lot of interest recently.The purpose of this paper is to study the strong law of large numbers and the law of the iterated logarithm for a sequence of random variables in a sub-linear expectation space under a concept of extended independence which is much weaker and easier to verify than the independence proposed by Peng[20].We introduce a concept of extended negative dependence which is an extension of the kind of weak independence and the extended negative independence relative to classical probability that has appeared in the recent literature.Powerful tools such as moment inequality and Kolmogorov’s exponential inequality are established for these kinds of extended negatively independent random variables,and these tools improve a lot upon those of Chen,Chen and Ng[1].The strong law of large numbers and the law of iterated logarithm are also obtained by applying these inequalities.
