The well-known non-interactive and information-theoretic secure verifiable secret sharing scheme presented by Pedersen is over a large prime. In this paper, we construct a novel non-interactive and information-theoret...The well-known non-interactive and information-theoretic secure verifiable secret sharing scheme presented by Pedersen is over a large prime. In this paper, we construct a novel non-interactive and information-theoretic verifiable secret sharing over RSA （Rivest, Shamir, Adleman） modulus and give the rigorous security proof. It is shown how to distribute a secret among a group such that any set of k parties get no information about the secret. The presented scheme is generally applied to constructions of secure distributed multiplication and threshold or forward-secure signature protocols.展开更多
This paper considers a decomposition framework as a mechanism for information hiding for secure communication via open network channels. Two varieties of this framework are provided: one is based on Gaussian arithmeti...This paper considers a decomposition framework as a mechanism for information hiding for secure communication via open network channels. Two varieties of this framework are provided: one is based on Gaussian arithmetic with complex modulus and another on an elliptic curve modular equation. The proposed algorithm is illustrated in a numerical example.展开更多
Information-theoretic principles provide a rigorous foundation for adaptive radar waveform design in contested and dynamically varying environments.This paper addresses the joint optimization of constant modulus wavef...Information-theoretic principles provide a rigorous foundation for adaptive radar waveform design in contested and dynamically varying environments.This paper addresses the joint optimization of constant modulus waveforms to enhance both target detection and parameter estimation concurrently.A unified design framework is developed by maximizing a mutual information upper bound(MIUB),which intrinsically reconciles the tradeoff between detection sensitivity and estimation accuracy without heuristic weighting.Realistic,potentially non-Gaussian statistics of target and clutter returns are modeled using Gaussian mixture distributions(GMDs),enabling tractable closed-form approximations of the MIUB’s Kullback–Leibler divergence and mutual information components.To tackle the ensuing non-convex optimization,a tailored metaheuristic phase-coded dream optimization algorithm(PC-DOA)is proposed,incorporating hybrid initialization and adaptive exploration–exploitation mechanisms for efficient phase-space search.Numerical results substantiate the proposed approach’s superiority in achieving favorable detection estimation trade-offs over existing benchmarks.展开更多
P-集合是由内P-集合XF(internal packet set XF)与外P-集合XF(outer packet set XF)构成的集合对,或者(XF,XF)是P-集合。P-集合具有动态特征。利用内P-集合的结构与动态特征,给出F珔-信息伪装的概念、F珔-信息伪装的结构与特征,给出F珔...P-集合是由内P-集合XF(internal packet set XF)与外P-集合XF(outer packet set XF)构成的集合对,或者(XF,XF)是P-集合。P-集合具有动态特征。利用内P-集合的结构与动态特征,给出F珔-信息伪装的概念、F珔-信息伪装的结构与特征,给出F珔-信息伪装模与真-伪信息筛选定理和真-伪信息筛选的应用。P-集合生成的F珔-信息伪装是P-集合的重要研究分支之一,是信息系统研究中一个新的研究方向。展开更多
基金Supported by the National Natural Science Foun-dation of China (60403005 ,60573026)
文摘The well-known non-interactive and information-theoretic secure verifiable secret sharing scheme presented by Pedersen is over a large prime. In this paper, we construct a novel non-interactive and information-theoretic verifiable secret sharing over RSA （Rivest, Shamir, Adleman） modulus and give the rigorous security proof. It is shown how to distribute a secret among a group such that any set of k parties get no information about the secret. The presented scheme is generally applied to constructions of secure distributed multiplication and threshold or forward-secure signature protocols.
文摘This paper considers a decomposition framework as a mechanism for information hiding for secure communication via open network channels. Two varieties of this framework are provided: one is based on Gaussian arithmetic with complex modulus and another on an elliptic curve modular equation. The proposed algorithm is illustrated in a numerical example.
基金Project supported by the National Natural Science Foundation of China(No.61871384)the Science Fund for Distinguished Young Scholars of Hunan Province(No.2024JJ2066)the Science and Technology Innovation Program of Hunan Province(No.2022RC1092)。
文摘Information-theoretic principles provide a rigorous foundation for adaptive radar waveform design in contested and dynamically varying environments.This paper addresses the joint optimization of constant modulus waveforms to enhance both target detection and parameter estimation concurrently.A unified design framework is developed by maximizing a mutual information upper bound(MIUB),which intrinsically reconciles the tradeoff between detection sensitivity and estimation accuracy without heuristic weighting.Realistic,potentially non-Gaussian statistics of target and clutter returns are modeled using Gaussian mixture distributions(GMDs),enabling tractable closed-form approximations of the MIUB’s Kullback–Leibler divergence and mutual information components.To tackle the ensuing non-convex optimization,a tailored metaheuristic phase-coded dream optimization algorithm(PC-DOA)is proposed,incorporating hybrid initialization and adaptive exploration–exploitation mechanisms for efficient phase-space search.Numerical results substantiate the proposed approach’s superiority in achieving favorable detection estimation trade-offs over existing benchmarks.
文摘P-集合是由内P-集合XF(internal packet set XF)与外P-集合XF(outer packet set XF)构成的集合对,或者(XF,XF)是P-集合。P-集合具有动态特征。利用内P-集合的结构与动态特征,给出F珔-信息伪装的概念、F珔-信息伪装的结构与特征,给出F珔-信息伪装模与真-伪信息筛选定理和真-伪信息筛选的应用。P-集合生成的F珔-信息伪装是P-集合的重要研究分支之一,是信息系统研究中一个新的研究方向。
