军事学 >>> 军事学
搜索结果: 16-30 共查到军事学 provable security相关记录32条 . 查询时间(0.426 秒)
We analyze the security of the SHA-3 finalist BLAKE. The BLAKE hash function follows the HAIFA design methodology, and as such it achieves optimal preimage, second preimage and collision resistance, a...
We analyze the security of the SHA-3 finalist BLAKE. The BLAKE hash function follows the HAIFA design methodology, and as such it achieves optimal preimage, second preimage and collision resistance, a...
We analyze the security of the SHA-3 finalist BLAKE. The BLAKE hash function follows the HAIFA design methodology, and as such it achieves optimal preimage, second preimage and collision resistance, a...
Probable security is an important criteria for analyzing the security of cryptographic protocols. However, writing and verifying proofs by hand are prone to errors. This paper introduces the game-base...
In ATC 2007, an identity based signcryption scheme for multiple receivers was proposed by Yu et al. In this paper, we first show that Yu et al.’s signcryption scheme is insecure by demonstrating an ...
We consider the impact of the possibility of decryption failures in proofs of security for padding schemes, where these failures are both message and key dependent. We explain that an average case f...
In a hierarchical structure, an entity has access to another if and only if the former is a superior of the later. The access control scheme for a hierarchy represented by a partially ordered set (p...
We give an informal analysis and critique of several typical "provable security" results. In some cases there are intuitive but convincing argu- ments for rejecting the conclusions suggested by the ...
The object of this paper is the concrete security of recent multivariate signature schemes. A major challenge is to reconcile some ”tricky” ad-hoc constructions that allow to make short signatures, ...
This paper examines methods for formally proving the security of cryptographic schemes.We show that, despite many years of active research, there are fundamental problems which have yet to be solved...
This paper examines methods for formally proving the security of cryptographic schemes.We show that, despite many years of active research, there are fundamental problems which have yet to be solved...
Standards bodies have been addressing the key-wrap problem, a cryptographic goal that has never received a provable-security treatment. In response, we provide one, giving definitions, constructions, ...
Pseudorandom Generators (PRGs) based on the RSA inversion (one-wayness) problem have been extensively studied in the literature over the last 25 years. These generators have the attrac-tive feature o...

中国研究生教育排行榜-

正在加载...

中国学术期刊排行榜-

正在加载...

世界大学科研机构排行榜-

正在加载...

中国大学排行榜-

正在加载...

人 物-

正在加载...

课 件-

正在加载...

视听资料-

正在加载...

研招资料 -

正在加载...

知识要闻-

正在加载...

国际动态-

正在加载...

会议中心-

正在加载...

学术指南-

正在加载...

学术站点-

正在加载...