期刊文献+
任意字段
题名或关键词
题名
关键词
摘要
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息
共找到326篇文章
< 1 2 … 17 >
每页显示 20 50 100
已选0条
引用分析
参考文献
引证文献
 统计分析
检索结果
已选文献
显示方式：
Construction of k-ary Pseudorandom Elliptic Curve Sequences 认领 引用
1
作者 WU Chenhuang WENG Xin CHEN Zhixiong 《Wuhan University Journal of Natural Sciences》 CAS 2011年第5期452-456,共5页
We present a method for constructing k-ary sequences over elliptic curves. Using the multiplicative character of order k of finite fields, we construct a family of k-ary pseudorandom elliptic curve sequences. The pseu... We present a method for constructing k-ary sequences over elliptic curves. Using the multiplicative character of order k of finite fields, we construct a family of k-ary pseudorandom elliptic curve sequences. The pseudorandom measures, such as the well-distribution measure, the correlation measure of order e, and the linear complexity are estimated by using certain character sums. Such sequences share the same order of magnitude on the well-distribution measure, the correlation measure of order e as the ＇truly＇ random sequences. The method indicates that it is possible to construct ＇good＇ pseudorandom sequences over elliptic curves widely used in public key cryptography. 展开更多
关键词 pseudorandom sequences discrete logarithms elliptic curves character sums
暂未订购 下载PDF
A new pseudorandom number generator based on a complex number chaotic equation 认领 引用
2
作者 刘杨 佟晓筠 《Chinese Physics B》 SCIE EI CAS CSCD 2012年第9期142-148,共7页
In recent years, various chaotic equation based pseudorandom number generators have been proposed. However, the chaotic equations are all defined in the real number field. In this paper, an equation is proposed and pr... In recent years, various chaotic equation based pseudorandom number generators have been proposed. However, the chaotic equations are all defined in the real number field. In this paper, an equation is proposed and proved to be chaotic in the imaginary axis. And a pseudorandom number generator is constructed based on the chaotic equation. The alteration of the definitional domain of the chaotic equation from the real number field to the complex one provides a new approach to the construction of chaotic equations, and a new method to generate pseudorandorn number sequences accordingly. Both theoretical analysis and experimental results show that the sequences generated by the proposed pseudorandom number generator possess many good properties. 展开更多
关键词 chaotic equation pseudorandom number generator complex number
暂未订购 下载PDF
A Fast Pseudorandom Number Generator with BLAKE Hash Function 认领 引用
3
作者 WANG Houzhen ZHANG Huanguo 《Wuhan University Journal of Natural Sciences》 CAS 2010年第5期393-397,共5页
This paper presents a fast pseudorandom generation algorithm,which is based on the BLAKE hash function and can pass the random test of the NIST(National Institute of Standards and Technology)Statistical Test Suite.Thr... This paper presents a fast pseudorandom generation algorithm,which is based on the BLAKE hash function and can pass the random test of the NIST(National Institute of Standards and Technology)Statistical Test Suite.Through theoretical analysis and experimental imitation,our new algorithm is proven to be more secure and efficient than G-SHA1.Simultaneously,we introduce and discuss the BLAKE in detail.Its security shows that can be utilized to generate pseudorandom bit sequences,which the experimental results show the BLAKE hash function has excellent pseudorandomness.Therefore,we believe the BLAKE is one of the most potential candidate algorithms of SHA-3 program. 展开更多
关键词 cryptography pseudorandom number generator hash function National Institute of Standards and Technology Statistical Test Suite
暂未订购 下载PDF
New Pseudorandom Number Generator Artin-Sc hreier Tower for p = 5 认领 引用
4
作者 Song Huiling 《China Communications》 SCIE CSCD 2012年第10期60-67,共8页
The standard method to construct a finite field requires a primitive irreducible polynomial of a given degree. Therefore, it is difficult to apply for the construction of huge finite fields. To avoid this problem, we ... The standard method to construct a finite field requires a primitive irreducible polynomial of a given degree. Therefore, it is difficult to apply for the construction of huge finite fields. To avoid this problem, we propose a new method to construct huge finite fields with the characteristic p = 5 by using an Artin-Schreier tower. Utilizing the recursive basis of the Artin-Schreier tower, we define a nmltiplication algorithm The algorithm can explicitly calculate the multiplication of two elements on the top finite field of this tower, without any primitive element. We also define a linear recurrence equation as an application, which produces a sequence of numbers, and call the new pseudorandom number generator Abstract Syntax Tree （AST） for p = 5. The experircental results show that our new pseudorandom number generator can produce a sequence of numbers with a long period. 展开更多
关键词 finite field pseudorandom number generator AST long period
暂未订购 下载PDF
Method of Designing Generators of Pseudorandom Sequences for Information Protection Based on Shift Register with Non-Linear Feedback Function 认领 引用 被引量：1
5
作者 Saleh Al-Omar 《Journal of Information Security》 2014年第4期218-227,共10页
This paper proposes an efficient, high-tech method of construction of pseudorandom binary sequences generators with a repetition period 2n?for n-bit shift register with a nonlinear feedback function. The developed met... This paper proposes an efficient, high-tech method of construction of pseudorandom binary sequences generators with a repetition period 2n?for n-bit shift register with a nonlinear feedback function. The developed method is illustrated by constructing a nonlinear function feedback shift register. It is proved that the offered method requires the realization of a memory size proportional to n2?that allows making successful use of suitable generators for practical use on the shift register of the longer word. 展开更多
关键词 Pseudorandom Sequences Non-Linear Feedback Function Information Protection
暂未订购 下载PDF
CRYPTANALYSIS OF AN IMAGE ENCRYPTION SCHEME WITH A PSEUDORANDOM PERMUTATION AND ITS IMPROVED VERSION 认领 引用
6
作者 WangJing JiangGuoping LinBing 《Journal of Electronics(China)》 2012年第1期82-93,共12页
Under Kerckhoff principle,this paper discusses the security property of an image encryp-tion scheme with a pseudorandom permutation.Some findings on the security problems of the algo-rithm are reported in the followin... Under Kerckhoff principle,this paper discusses the security property of an image encryp-tion scheme with a pseudorandom permutation.Some findings on the security problems of the algo-rithm are reported in the following:(1) If each row or column of the plain-image matrix is the same,the receiver cannot decrypt correctly.(2) Each plain-text word is correlated with single cipher-text word,but independent of other cipher-text word,which cannot meet the principles of algorithm design-diffusion and confusion.(3) If the cycle numbers are relatively small,statistics attack can be used to reveal some visual information of any other plain-images encrypted with the same secret key.Con-sidering the above problems,we propose an improved algorithm and then analyze its performance.Theoretical analysis and simulation results show that the improved algorithm can obtain better cryptographic properties,such as statistical characteristics,difference characteristics,and so on. 展开更多
关键词 Pseudorandom permutation Diffusion Confusion Theoretical analysis
暂未订购 下载PDF
Pseudorandomness in Central Force Optimization 认领 引用
7
作者 Richard A.Formato 《Journal of Applied Mathematics and Physics》 2025年第12期4567-4597,共31页
This note examines the utility of pseudorandom variables(prv)in Global Search and Optimization(GSO)using Central Force Optimization(CFO)as an example.Most GSO metaheuristics are stochastic in nature,but not all.CFO is... This note examines the utility of pseudorandom variables(prv)in Global Search and Optimization(GSO)using Central Force Optimization(CFO)as an example.Most GSO metaheuristics are stochastic in nature,but not all.CFO is a completely deterministic GSO metaheuristic,but it nevertheless benefits from injecting prv’s,thereby preserving its deterministic nature while improving its decision space(DS)exploration.CFO benefits substantially from the inclusion of a pseudorandom component,that is,a numerical sequence that is precisely known by specification,or by calculation,or both,but which is otherwise arbitrary.The essential requirement is that the sequence be uncorrelated with DS’s topology,so that its effect is to pseudorandomly distribute probes throughout the landscape.While this process may appear to be similar to the randomness in an inherently stochastic algorithm,it is in fact fundamentally different because CFO remains deterministic at every step.Injecting prv’s is not limited to CFO.It is an approach that can be used in any metaheuristic,stochastic or not.In this note three different pseudorandom methods are discussed for CFO(initial probe distribution,repositioning factor,and decision space adaptation).A sample benchmark problem is presented in detail,and summary data are included for a 23-function benchmark suite.In addition,two sample“real world”problems in electromagnetics are presented.CFO’s performance with prv’s is quite good compared to other highly developed,state-of-the-art algorithms. 展开更多
关键词 Central Force Optimization(CFO) Pseudorandom Variables(PRV) Global Search and Optimization(GSO) Deterministic Metaheuristics Decision Space(DS)Exploration
Pseudorandomness of Camellia-Like Scheme 认领 引用 被引量：6
8
作者 吴文玲 《Journal of Computer Science & Technology》 SCIE EI 2006年第1期82-88,共7页
Luby and Rackoff idealized DES by replacing each round function with one large random function. In this paper, the author idealizes Camellia by replacing each S-box with one small random function, which is named Camel... Luby and Rackoff idealized DES by replacing each round function with one large random function. In this paper, the author idealizes Camellia by replacing each S-box with one small random function, which is named Camellialike scheme. It is then proved that five-round Camellia-like scheme is pseudorandom and eight-round Camellia-like scheme is super-pseudorandom for adaptive adversaries. Further the paper considers more efficient construction of Camellia-like scheme, and discusses how to construct pseudorandom Camellia-like scheme from less random functions. 展开更多
关键词 block cipher Camellia random function pseudorandomness super-pseudorandomness
暂未订购 下载PDF
高效的概率门限隐私集合交集协议 认领 引用
9
作者 张恩 刘登辉 杜瑞颖 《计算机学报》 EI CAS CSCD 北大核心 2026年第2期309-327,共19页
概率门限隐私集合交集(Probabilistic Threshold Private Set Intersection,PTPSI)是门限隐私集合交集的一种概率变体,当交集数量处于给定区间内时,会以一定概率计算交集,交集数量越多,计算交集的概率越大。相比确定型门限隐私集合交集... 概率门限隐私集合交集(Probabilistic Threshold Private Set Intersection,PTPSI)是门限隐私集合交集的一种概率变体,当交集数量处于给定区间内时,会以一定概率计算交集,交集数量越多,计算交集的概率越大。相比确定型门限隐私集合交集协议,PTPSI在拼车、联邦学习等场景中展现了更高的效率。然而,现有针对半诚实敌手的PTPSI协议在门限测试阶段依赖昂贵的通用电路计算机制,其计算开销与参与方数量呈指数关系,不能有效扩展至多方场景。针对此问题,首先在半诚实模型下基于双中心零共享技术(Bicentric Zero-Sharing,BZS)设计一种高效的PTPSI协议。在5方场景下,每个参与方集合大小为n=220,门限值设为0.5n,现有协议的运行时间为45.40秒,改进后的协议总运行时间为9.62秒,通信量为187.39 MB,速度提升4.72倍。当参与方数量从5方扩展到32方时,协议总运行时间为9.92秒。为进一步抵抗合谋攻击,提出第二个隐私增强的PTPSI协议,使用不经意伪随机函数来限制聚合参与方的恶意查询,同样场景下,该协议时间成本为30.25秒。两个协议都能抵抗特定N-1个参与方的合谋攻击,且随着参与方数量增多,与现有协议相比,优势更加明显。 展开更多
关键词 概率门限隐私集合交集 门限隐私集合交集 双中心零共享技术 不经意键值存储 不经意伪随机函数
暂未订购 下载PDF
A novel method for generating pseudorandom integer strings and pseudorandom sequences 认领 引用 被引量：1
10
作者 胡德文 《Science China(Technological Sciences)》 CAS 2000年第4期413-420,共8页
A new method, referred to as the full-recurrent-decimal-sequences (FRDS) method, is proposed to generate the pseudorandom integer strings and the pseudorandom sequences. The pseudorandom integer strings properties and... A new method, referred to as the full-recurrent-decimal-sequences (FRDS) method, is proposed to generate the pseudorandom integer strings and the pseudorandom sequences. The pseudorandom integer strings properties and the run-length properties of the FRDS-sequences are investigated . By transformation, a new kind of pseudorandom sequences with optimal auto-correlation functions is suggested. 展开更多
关键词 pseudorandom integer strings run-length linear congruence generator (LCG) primitive root full-recurrent-decimal-sequences (FRDS).
暂未订购 下载PDF
Gowers norms and pseudorandom measures of subsets 认领 引用
11
作者 Huaning LIU Yuchan QI 《Frontiers of Mathematics in China》 SCIE CSCD 2022年第2期289-313,共25页
Let A ■ ■N,and fA(s)={1-|A/N,-|A|/N,for s ∈A,for s■ A.We define the pseudorandom measure of order k of the subset A as follows,P k(A,N)=max D|∑n∈■N|fA(n+c1)fA(n+c2)…fA(n+ck)|where... Let A ■ ■N,and fA(s)={1-|A/N,-|A|/N,for s ∈A,for s■ A.We define the pseudorandom measure of order k of the subset A as follows,P k(A,N)=max D|∑n∈■N|fA(n+c1)fA(n+c2)…fA(n+ck)|where the maximum is taken over all D=(c1,c2,…,CK)∈■k with 0≤c1<c2<…ck≤N-1.The subset A ■ ■N is considered as a pseudorandom subset of degree k if Pk(A,N)is“small”in terms of N.We establish a link be tween the Gowers norm and our pseudorandom measure,and show that“good”pseudorandom subsets must have“small”Gowers norm.We give an example to suggest that subsets with"small" Gowers norm may have large pseudorandom measure.Finally,we prove that the pseudorandom subset of degree L(k)contains an arithmetic progression of length k,where L(k)=2·lcm(2,4,…,2|k/2|),for k≥4,and lcm(a1,a2,…,al)denotes the least common multiple of a1,a2,…,al. 展开更多
关键词 Gowers norm pseudorandom measure subset arithmetic progression
暂未订购 下载PDF
融合TEE-MOPRF的多方隐私集合求交方案 认领 引用
12
作者 李国刚 林德杭 李大为 《西安邮电大学学报》 2026年第3期67-76,共10页
针对互不信任的各个参与方计算集合交集时面临的计算效率和隐私安全平衡的问题,提出一种融合可信执行环境(Trusted Execution Environment,TEE)和多方不经意伪随机函数(Multi-Party Oblivious Pseudorandom Function,MOPRF)的多方隐私... 针对互不信任的各个参与方计算集合交集时面临的计算效率和隐私安全平衡的问题,提出一种融合可信执行环境(Trusted Execution Environment,TEE)和多方不经意伪随机函数(Multi-Party Oblivious Pseudorandom Function,MOPRF)的多方隐私集合求交方案。通过星形网络将复杂多方计算分解为多个双方交互,利用零共享机制降低密码学开销,并借助TEE的硬件隔离能力完成不经意伪随机函数(Oblivious Pseudorandom Function,OPRF)的盲化处理,从而避免大量的密码学操作并快速完成MOPRF。求交阶段使用不经意键值对进行高效集合求交,凭借TEE的隔离能力确保参与方仅能获取最终结果。安全性分析表明,该方案满足半诚实模型下的安全要求,并分析了TEE现实部署下的安全威胁。性能及实验分析结果表明,该方案在保持线性计算复杂度的同时,将多方交互压缩至3轮,整体运行耗时相较于同类代表性方案缩减了约30%,在计算效率与隐私保护之间达到良好平衡。 展开更多
关键词 隐私集合求交 零共享 不经意伪随机函数 可信执行环境 安全多方计算
暂未订购 下载PDF
Boundary evaluation and error correction on pseudorandom spread spectrum photon counting system 认领 引用
13
作者 Shanshan Shen Qian Chen +1 位作者 Weiji He Vuqiang Wang 《Chinese Optics Letters》 SCIE EI CAS CSCD 2017年第9期36-40,共5页
The Cramer–Rao lower bound on range error is modeled for pseudo-random ranging systems using Geiger-mode avalanche photodiodes. The theoretical results are shown to agree with the Monte Carlo simulation, satisfying b... The Cramer–Rao lower bound on range error is modeled for pseudo-random ranging systems using Geiger-mode avalanche photodiodes. The theoretical results are shown to agree with the Monte Carlo simulation, satisfying boundary evaluations. Experimental tests prove that range errors caused by the fluctuation of the number of photon counts in the laser echo pulse leads to the range drift of the time point spread function. The function relationship between the range error and the photon counting ratio is determined by using numerical fitting.Range errors due to a different echo energy is calibrated so that the corrected range root mean square error is improved to 1 cm. 展开更多
关键词 Boundary evaluation and error correction on pseudorandom spread spectrum photon counting system
暂未订购 下载PDF
基于身份加密的可变形加密方案构造 认领 引用
14
作者 李姿璇 张仁军 +2 位作者 王付群 陈克非 沈忠华 《杭州师范大学学报（自然科学版）》 CAS 2026年第3期239-246,共8页
数据通信的机密性高度依赖于密钥的安全性.传统的通信安全主要基于发送者自由假设和接收者隐私假设,但在胁迫环境下,这些假设可能会被破坏,导致消息内容被控制或者密钥泄露.针对接收者隐私假设被破坏这一问题,提出了一种基于IBE-to-CCA... 数据通信的机密性高度依赖于密钥的安全性.传统的通信安全主要基于发送者自由假设和接收者隐私假设,但在胁迫环境下,这些假设可能会被破坏,导致消息内容被控制或者密钥泄露.针对接收者隐私假设被破坏这一问题,提出了一种基于IBE-to-CCA转换的可变形加密方案.该方案通过引入伪随机函数,将基于身份的加密方案升级为可变形加密方案,显著增强了其在密钥泄露情况下的安全性. 展开更多
关键词 可变形加密 IBE-to-CCA转换 隐私保护 身份加密 伪随机函数
暂未订购 下载PDF
适用于轻量级客户端的多方隐私集合求交协议 认领 引用
15
作者 杨乐 何慧阳 +2 位作者 尤玮婧 张佰韬 林璟锵 《信息网络安全》 CSCD 北大核心 2026年第2期251-262,共12页
随着隐私保护需求的增长,多方隐私集合求交(MP-PSI)协议作为一种关键的隐私计算技术,在多个领域受到广泛关注。然而,在计算资源受限的环境中,现有的MP-PSI协议往往面临客户端计算负担较重的问题,限制了其在实际应用中的可行性。为解决... 随着隐私保护需求的增长,多方隐私集合求交(MP-PSI)协议作为一种关键的隐私计算技术,在多个领域受到广泛关注。然而,在计算资源受限的环境中,现有的MP-PSI协议往往面临客户端计算负担较重的问题,限制了其在实际应用中的可行性。为解决这一问题,文章提出一种基于布隆过滤器和同态加密的轻量级客户端MP-PSI协议。该协议通过引入不经意可编程伪随机函数,将大部分计算任务从客户端转移到服务器,从而显著降低了客户端的计算开销并充分利用了服务器的计算资源。实验结果表明,该协议在客户端计算时间和服务器计算效率方面均优于现有方案。协议在半诚实模型中可抵抗至多n-1个参与方合谋攻击,可确保诚实参与方的隐私。该协议为资源受限环境下的隐私保护问题提供了新的解决方案。 展开更多
关键词 多方隐私集合求交 轻量级客户端 布隆过滤器 不经意可编程伪随机函数
暂未订购 下载PDF
简洁低交互的物联网设备认证协议研究 认领 引用 被引量：4
16
作者 王梅 杨潇然 李增鹏 《信息网络安全》 CSCD 北大核心 2025年第7期1032-1043,共12页
针对物联网设备间认证和加密通信效率及安全性的问题,在物联网技术成熟和应用普及的背景下,文章设计并实现了一种简洁低交互的物联网设备认证协议。该协议的设计包括设备信任绑定过程和设备密钥协商过程。信任绑定过程通过交换云服务器... 针对物联网设备间认证和加密通信效率及安全性的问题,在物联网技术成熟和应用普及的背景下,文章设计并实现了一种简洁低交互的物联网设备认证协议。该协议的设计包括设备信任绑定过程和设备密钥协商过程。信任绑定过程通过交换云服务器认证的身份标识公钥来验证通信对方的身份,确保身份标识公钥的安全存储。为保障安全性,认证过程中采用对称加密传输双方的身份标识公钥,其密钥通过不经意伪随机函数计算确定。密钥协商过程则基于HMQV协议协商,后续用于安全通信的会话密钥。与华为设备互联认证协议相比,该协议的交互次数减少。实验结果表明,其计算和通信开销更低,效率更高。 展开更多
关键词 物联网 设备互联 不经意伪随机函数 认证与密钥协商
暂未订购 下载PDF
高效可扩展的隐私集合交集基数方案研究 认领 引用 被引量：2
17
作者 李功丽 刘威辰 郑东 《通信学报》 EI CSCD 北大核心 2025年第5期272-282,共11页
针对现有两方隐私集合交集基数(PSI-CA)方案计算开销大的问题,提出了一种高效的两方PSI-CA协议。该协议利用不经意键值存储(OKVS)和不经意密钥共享伪随机函数(OKS-PRF)隐藏交集元素信息,能显著优化协议的执行时间,同时可扩展到多方PSI-C... 针对现有两方隐私集合交集基数(PSI-CA)方案计算开销大的问题,提出了一种高效的两方PSI-CA协议。该协议利用不经意键值存储(OKVS)和不经意密钥共享伪随机函数(OKS-PRF)隐藏交集元素信息,能显著优化协议的执行时间,同时可扩展到多方PSI-CA场景。实验结果表明,当集合大小为220时,所提两方PSI-CA协议能够在36.61s内完成,执行速度是目前最快两方协议的1.8倍。当参与方数量为23,集合大小为220时,所提多方PSI-CA协议可在115.32s内完成,并能抵抗N-2个参与方合谋。 展开更多
关键词 隐私集合交集基数 抗合谋 不经意键值存储 不经意密钥共享伪随机函数
暂未订购 下载PDF
伪码调相连续波雷达微弱机动目标高精度参数估计方法 认领 引用
18
作者 崔嵬 邢天乐 +1 位作者 金小萍 吴爽 《信号处理》 CSCD 北大核心 2025年第1期31-42,共12页
伪码调相连续波雷达具有探测距离远、测量精度高、抗干扰能力强等优势,是天基雷达空间目标探测的重要手段。本文针对高速伪码调相连续波雷达对远距、机动目标的高精度参数估计问题,提出了一种基于跟踪环路的机动目标参数高精度估计算法... 伪码调相连续波雷达具有探测距离远、测量精度高、抗干扰能力强等优势,是天基雷达空间目标探测的重要手段。本文针对高速伪码调相连续波雷达对远距、机动目标的高精度参数估计问题,提出了一种基于跟踪环路的机动目标参数高精度估计算法。该算法首先利用分数阶傅里叶变换获得载波多普勒频率初始值和多普勒频率变化率的估计,并构造对数据跳变不敏感的相干载波提取环路,实现对伪码调相信号中载波参数的鲁棒提取与精确跟踪,从而得到高精度的相对速度估计结果;之后,利用载波多普勒频率估计结果“修正”本地发射伪码,消除伪码相位偏移。在通过相关处理得到伪码相位初始估计后,构造载波辅助相干伪码跟踪环路,实现对伪码相位的精确跟踪,从而获得高精度的相对距离估计结果。所提算法利用参数跟踪环路实时动态匹配的优点,解决了机动目标回波信号伪码相位偏移和多普勒扩展引入的积累效能降低和检测性能恶化问题,有效提高了机动目标参数估计精度。与部分相关-分数阶傅里叶变换、广义拉登傅里叶变换方法、迭代相邻相关运算方法相比,所提算法将机动目标多维参数搜索与匹配问题转化为两次一维参数精确提取问题,在获得机动目标相对距离、相对速度高精度估计的同时,有效降低了算法的运算量,为航天器空间平台资源强约束下实现自主探测感知提供了一种可行思路。 展开更多
关键词 伪码调相连续波雷达 机动目标 相干载波提取 伪码跟踪 参数估计
暂未订购 下载PDF
支持t-DNF的受限伪随机函数及其在属性加密中的应用 认领 引用
19
作者 马超 高海英 胡斌 《密码学报（中英文）》 CSCD 北大核心 2025年第3期662-678,共17页
在公钥加密和密钥交换等场景中,受限伪随机函数普遍被认为是一种提高密码系统安全性的有效工具.本文首先设计了一种支持t-DNF的受限伪随机函数,并证明了该函数具有单密钥适应安全性和密钥模拟安全性;然后基于该类受限伪随机函数设计了... 在公钥加密和密钥交换等场景中,受限伪随机函数普遍被认为是一种提高密码系统安全性的有效工具.本文首先设计了一种支持t-DNF的受限伪随机函数,并证明了该函数具有单密钥适应安全性和密钥模拟安全性;然后基于该类受限伪随机函数设计了一个支持t-DNF访问结构的密文策略属性加密方案,给出了方案的适应安全性证明,分析比较了该属性加密方案与同类方案的参数大小和算法复杂度,并给出了方案在不同参数下的仿真实验结果.与现有支持DNF访问结构的属性加密方案相比,本文方案具有两个明显提高:一是具有标准安全模型下的适应安全性,二是支持访问结构中的属性否定,即本文方案的安全性更高、访问控制更加灵活. 展开更多
关键词 t-DNF 受限伪随机函数 属性加密
暂未订购 下载PDF
拓展的镜像理论及其在消息认证码中的应用 认领 引用
20
作者 张平 秦佳琦 《信息安全学报》 CSCD 2025年第4期77-90,共14页
拓展的镜像理论是一种用于界定含有仿射等式和不等式方程组系统中未知数的可能解数的方法论,它在对称密码的可证明安全理论中发挥着重要的作用。论文再次聚焦拓展的镜像理论,着力解决一个关键挑战:为广泛参数范围内的仿射等式和不等式... 拓展的镜像理论是一种用于界定含有仿射等式和不等式方程组系统中未知数的可能解数的方法论,它在对称密码的可证明安全理论中发挥着重要的作用。论文再次聚焦拓展的镜像理论,着力解决一个关键挑战:为广泛参数范围内的仿射等式和不等式方程组系统中解数量建立鲁棒的下界估计。主要理论贡献体现在两大关键进展:首先,利用图论描述框架形式化地刻画了这些仿射系统固有的约束条件,为分析提供了直观且强大的视角。其次,基于这一图论视角,为广泛参数范围内的此类系统建立了一个全新且显著改进的解数量下界,为对称密码的普适抗生日界的严格证明奠定了理论基础。然后,应用到两类重要消息认证码——基于两个伪随机置换并联构造的方案EWCDMD和基于两个伪随机置换级联构造的方案EWCDM——的抗生日界安全性证明中,展示了增强的拓展的镜像理论的实际效力。利用拓展的镜像理论框架和广泛参数下的鲁棒下界,严格证明了EWCDMD和EWCDM均能达到抗生日界安全性。至关重要的是,推导出了一个广泛范围内均适用的普适安全界,证明了这两种构造均可提供2n/3比特普适安全性,其中n表示底层伪随机置换的比特长度。通过与以前的工作进行详细比较,凸显了该工作的独特优势和崭新贡献。最后,讨论了基于多个独立伪随机置换构造的抗生日界安全的消息认证码方案的安全性证明,并遗留了基于多变量拓展的镜像理论的图理论完善的开放性问题。 展开更多
关键词 拓展的镜像理论 消息认证码 图论 伪随机置换 抗生日界安全
暂未订购 下载PDF
已选0条
引用分析
参考文献
引证文献
 统计分析
检索结果
已选文献
上一页 1 2 … 17 下一页 到第 页
在线咨询 使用帮助 返回顶部 意见反馈