检索结果-南通市图书馆

standard model of knowledge representation

维普期刊数据库博看期刊评论

在线全文

学校读者我要写书评

暂无评论

Frontiers of Mechanical Engineering 2016年第3期11卷 275-288页

作者： Wensheng YIN School of Mechanical Science and Engineering Huazhong University of Science and Technology Wuhan 430074 China

Knowledge representation is the core of artificial intelligence research. Knowledge representation methods include predicate logic, semantic network, computer programming language, database, mathematical model, graphics language, natural language, etc. To establish the intrinsic link between various knowledge representation methods, a unified knowledge representa- tion model is necessary. According to ontology, system theory, and control theory, a standard model of knowledge representation that reflects the change of the objective world is proposed. The model is composed of input, processing, and output. This knowledge representation method is not a contradiction to the traditional knowledge representation method. It can express knowledge in terms of multivariate and multidimensional. It can also express process knowledge, and at the same time, it has a strong ability to solve problems. In addition, the standard model of knowledge representation provides a way to solve problems of non-precision and inconsistent knowledge.

关键词： knowledge representation standard model ontology system theory control theory multidimensional representation

standard model Review and a New 5D Multi-Brane Proposition

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Journal of High Energy Physics, Gravitation and Cosmology 2022年第1期8卷 195-227页

作者： Jami Hossain Independent Researcher Gurgaon India

Based on a comprehensive review of mainly the non-quantum aspects of the standard model of cosmology, the 5 dimensional models, and the analysis here, we propose a 5 dimensional model with expanding 4D multi-branes. A review of the standard model in the context of many new developments and discoveries in cosmology in the recent times, such as the accelerated expansion of the universe, Plank cosmic microwave measurements, dark energy survey, Hubble tension etc. tends to indicate that the standard model is essentially a patchwork of different theoretical models that have been pieced together in an attempt to explain different aspects of the astrophysical observations, which do not necessarily emanate from a full end-to-end understanding of a physical process. The purpose of each individual theoretical piece such as “inflation” is limited to providing an explanation to the problem area or a gap in our understanding. A number of new theories such as the five-dimensional universe, the bulk and brane, extended theories of gravity, and conformal cyclic cosmology offer alternate ways of addressing the existential aspects of the universe but these models too remain hypothetical with shortcomings and a lack of conclusive evidence. The model proposed by us, presents a way forward in addressing dark matter and dark energy as manifestations of the multiple underlying branes in the aftermath of the big-bang. In the process, we present a theorem of the dimensionality of the expanding universe, which necessitates the need for at least one more dimension in addition to the 4 dimensions of spacetime. While carrying out the review of the standard model, we present new analysis and facts that strengthen the case for the 5th dimension. According to the multi-brane hypothesis presented here, our observed universe could be one of the many branes, and it is more likely than not that in the aftermath of the big-bang that generated our brane, more branes were generated, which further points towards a much more pro

关键词： Big-Bang Dark Matter Dark Energy Cosmological Constant standard model Brane 5D Universe Accelerated Expansion

Generic Certificateless Encryption Secure Against Malicious-but-Passive KGC Attacks in the standard model

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Journal of Computer Science & Technology 2010年第4期25卷 807-826页

作者：黄琼王石 Department of Computer Science City University of Hong Kong

Despite the large number of certificateless encryption schemes proposed recently, many of them have been found insecure under a practical attack, called malicious-but-passive KGC （Key Generation Center） attack. In this work we propose the first generic construction of certificateless encryption, which can be proven secure against malicious-but- passive KGC attacks in the standard model. In order to encrypt a message of any length, we consider the KEM/DEM （key encapsulation mechanism/data encapsulation mechanism） framework in the certificateless setting, and propose a generic construction of certificateless key encapsulation mechanism （CL-KEM） secure against malicious-but-passive KGC attacks in the standard model. It is based on an identity-based KEM, a public key encryption and a message authentication code. The high efficiency of our construction is due to the efficient implementations of these underlying building blocks, and is comparable to Bentahar et al.＇s CL-KEMs, which have only been proven secure under the random oracle model with no consideration of the malicious-but-passive KGC attack. We also introduce the notion of certificateless tag-based KEM （CL-TKEM）, which is an extension of Abe et al.＇s work to the certificateless setting. We show that an efficient CL-TKEM can be constructed by modifying our CL-KEM scheme. We also show that with a CL-TKEM and a data encapsulation mechanism secure under our proposed security model, an efficient certificateless hybrid encryption can be constructed by applying Abe et al.＇s transformation in the certificateless setting.

关键词： certificateless encryption malicious-but-passive KGC attack standard model key encapsulation mechanism

维普期刊数据库

Designated Cloud Server Public Key Encryption with Keyword Search from Lattice in the standard model

在线全文

学校读者我要写书评

暂无评论

Chinese Journal of Electronics 2018年第2期27卷 304-309页

作者： ZHANG Xiaojun XU Chunxiang XIE Run JIN Chunhua School of Computer Science Southwest Petroleum University School of Computer Science and Engineering University of Electronic Science and Technology of China

Recently, how to retrieve the encrypted data efficiently from a cloud storage system becomes a hot topic. Public key encryption with keyword search(PEKS)can allow one to search the encrypted data with a keyword efficiently. Due to the booming of post-quantum cryptography, we propose public key encryption with keyword search from lattice assumption, which can resist quantum computer attacks. We delegate a particular cloud server to search the results, thus only the designated cloud server can finish the test process. Our scheme has been proved ciphertext indistinguishability in the standard model, which can reflect its security in the real world. To the best of our knowledge, our scheme is the first construction based on lattice in the standard model, which is a step stone in the post-quantum cryptographic communication.

关键词： Cloud storage Public key encryption with keyword search Lattice assumption standard model

Improved lattice-based CCA2-secure PKE in the standard model

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Science China(Information Sciences) 2020年第8期63卷 147-168页

作者： Jiang ZHANG Yu YU Shuqin FAN Zhenfeng ZHANG State Key Laboratory of Cryptology Guangdong Provincial Key Laboratory of Data Security and Privacy Protection Jinan University Department of Computer Science and Engineering Shanghai Jiao Tong University Trusted Computing and Information Assurance Laboratory Institute of SoftwareChinese Academy of Sciences

Based on the identity-based encryption(IBE) from lattices by Agrawal et al.(Eurocrypt’10),Micciancio and Peikert(Eurocrypt’12) presented a CCA1-secure public-key encryption(PKE), which has the best known efficiency in the standard model and can be used to obtain a CCA2-secure PKE from lattices by using the generic BCHK transform(SIAM J Comput, 2006) with a cost of introducing extra overheads to both computation and storage for the use of other primitives such as signatures and commitments. In this paper, we propose a more efficient standard model CCA2-secure PKE from lattices by carefully combining a different message encoding(which encodes the message into the most significant bits of the LWE’s "secret term") with several nice algebraic properties of the tag-based lattice trapdoor and the LWE problem(such as unique witness and additive homomorphism). Compared to the best known lattice-based CCA1-secure PKE in the standard model due to Micciancio and Peikert(Eurocrypt’12), we not only directly achieve the CCA2-security without using any generic transform(and thus do not use signatures or commitments), but also reduce the noise parameter roughly by a factor of 3. This improvement makes our CCA2-secure PKE more efficient in terms of both computation and storage. In particular, when encrypting a 256-bit(respectively,512-bit) message at 128-bit(respectively, 256-bit) security, the ciphertext size of our CCA2-secure PKE is even 33%–44%(respectively, 36%–46%) smaller than that of their CCA1-secure PKE.

关键词： lattice public-key encryption chosen ciphertext security standard model

A new construction on randomized message-locked encryption in the standard model via UCEs

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Science China(Information Sciences) 2017年第5期60卷 65-83页

作者： Huige WANG Kefei CHEN Baodong QIN Xuejia LAI Yunhua WEN Department of Computer Science and Engineering Shanghai Jiao Tong University Department of Network Engineering Anhui Science and Technology University Department of Mathematics Hangzhou Normal University Department of Computer Science and Engineering Southwest University of Science and Technology

We present a new primitive of randomized message-locked encryption(MLE) in this paper and define a new security model for it. The new primitive, named message-locked encryption3(hereafter referred as MLE3),is actually a variant of randomized message-locked encryption(Bellare et al. Eurocrypt’13). In order to prevent trivial attacks, our primitive admits a semi-trusted server, which is allowed to hold a secret key of public key encryption(PKE), to verify the correctness of a tag. The new security notion, called privacy chosen-distribution attacks3(PRV-CDA3), requires that a ciphertext generated by encrypting an unpredictable message and another ciphertext(possible invalid) chosen randomly from a ciphertext space are indistinguishable. Compared with the priori proposed security notion, privacy chosen-distribution attacks(PRV-CDA)(Bellare et al. Eurocrypt’13),which requires that two ciphertexts generated by encrypting two unpredictable messages are indistinguishable,the security notion we propose is much stronger. Based on the new primitive, under the blackbox reductions,we put forward a novel construction which achieves both privacy chosen-distribution attacks3(PRV-CDA3) and strong tag consistency(STC) securities in the standard model via universal computational extractors(UCEs)(Bellare et al. Crypto’13). In addition, our scheme also provides the validity-testing for ciphertext.

关键词： message-locked encryption3(MLE3) universal computational extractors(UCEs) privacy chosen distribution attacks3(PRV-CDA3) strong tag consistency(STC) standard model

Identity-based aggregate signcryption in the standard model from multilinear maps

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Frontiers of Computer Science 2016年第4期10卷 741-754页

作者： Hao WANG Zhen LIU Zhe LIU Duncan S. WONG School of Information Science and Engineering Shandong Normal University Jinan 250014 China Shandong Provincial Key Labe ratory for Novel Distributed Computer Software Technology Jinan 250014 China Security and Data Sciences Hong Kong Applied Science and Technology Research Institute (ASTRI) Hong Kong China Laboratory of Algorithmics Cryptology and Security (LACS) University of Luxembourg Luxembourg L-1359 Luxembourg

Signcryption is a public key cryptographic method that achieves unforgeability and confidentiality simultaneously with significantly smaller overhead than that required by ＂digital signature followed by public key encryption＂. It does this by signing and encr.ypting a message in a single step. An aggregate signcryption scheme allows individual signcryption ciphertexts intended for the same recipi- ent to be aggregated into a single （shorter） combined ciphertext without losing any of the security guarantees. We present an aggregate signcryption scheme in the identity-based setting using multilinear maps, and provide a proof of security in the standard model. To the best of our knowledge, our new scheme is the first aggregate signcryption scheme that is secure in the standard model.

关键词： identity-based aggregate signcryption multilinear maps standard model GGH framework

Secure proxy signature scheme with fast revocation in the standard model

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

The Journal of China Universities of Posts and Telecommunications 2009年第4期16卷 116-124页

作者： LIU Zhen-hua HU Yu-pu ZHANG Xiang-song MA Hua Applied Mathematics Department Xidian University Xi'an 710071 China Key Laboratory of Computer Networks and Information Security Ministry of Education Xidian University Xi'an 710071 China

Proxy signature is an important cryptographic primitive and has been suggested in numerous applications, Tne revocation oI delegated rights is an essential issue of the proxy signature schemes. In this article, a security model of proxy signature schemes with fast revocation is formalized. Under the formal security framework, a proxy signature scheme with fast revocation based on bilinear pairings is proposed. A security mediator （SEM）, which is an on-line partially trusted server, is introduced to examine whether a proxy signer signs according to the warrant or he/she exists in the revocation list. Moreover, the proxy signer must cooperate with the SEM to generate a valid proxy signature, thus the proposed scheme has the property of fast revocation. The proposed scheme is provably secure based on the computational Diffie-Hellman （CDH） intractability assumption without relying on the random oracles, and satisfies all the security requirements for a secure proxy signature.

关键词： public key cryptography proxy signature proxy revocation security mediator bilinear pairings standard model

维普期刊数据库

Adaptively secure hierarchical identity-based signature in the standard model

在线全文

学校读者我要写书评

暂无评论

The Journal of China Universities of Posts and Telecommunications 2010年第6期17卷 95-100页

作者： ZHANG Le-you HU Yu-pu WU Qing Department of Mathematics Science Xidian University Xi'an 710071 China Key Laboratory of Computer Networks and Information Security Xidian University Xi'an 710071 China School of Automation Xi'an Institute of Posts and Telecommunications Xi'an 710121 China

Hierarchical identity-based signature （HIBS） has wide applications in the large network. However,the existing works cannot solve the trade-off between the security and efficiency. The main challenge at present is to construct a high efficient and strong secure HIBS with a low computation cost. In this paper,a new construction of HIBS scheme is proposed. The new scheme achieves the adaptive security which is a strong security in the identity-based cryptography. But our scheme has short public parameters and the private keys size shrinks as the hierarchy depth increases. The signature size is a constant and the cost of verification only requires four bilinear pairings,which are independent of hierarchy depth. Furthermore,under the q-strong computational diffie-Hellman problem （q-SDH） assumption,the scheme is provably secure against existential forgery for adaptive chosen message and identity attack in the standard model.

关键词： Hierarchical identity-based signature adaptive security standard model q-SDH problem provably secure

维普期刊数据库