Temporal logics of knowledge are useful for reasoning about situations where we require both dynamic aspects and informational aspects relating to knowledge. So, the application of temporal logics of knowledge is inve...
详细信息
A novel FCSR-based generalized self-shrinking stream sequence generator (called F-GSS) has been proposed. The F-GSS keystream generator has passed the NIST's statistical test suite, which shows that F-GSS has good...
详细信息
To solve the problem of the abuse in electronic payment protocols, a new abuse-free fair electronic payment protocol is proposed in this paper. The proposed protocol solves the problems in Parks' protocol and furt...
详细信息
Kerberos protocol is a famous identity authentication protocol and it is widely used in the network as a standard. But there is still not a strict proof of it base on the Formal method. That is very nervous for the us...
详细信息
security is a big challenge when wireless sensor networks are deployed in a hostile environment. Due to the computational and storage overheads, traditional asymmetric cryptographic protocols are not suitable for the ...
详细信息
ISBN:
(纸本)9781424438839
security is a big challenge when wireless sensor networks are deployed in a hostile environment. Due to the computational and storage overheads, traditional asymmetric cryptographic protocols are not suitable for the resource-constrained wireless sensor nodes. Several key pre-distribution schemes have been proposed in literature to establish pairwise key between sensor nodes, but most of which only work for small-scale networks due to their linearly increased communication overhead and key storage overhead. Furthermore, some existing key pre-distribution schemes are not secure when the number of compromised sensor nodes exceeds a threshold value. In this paper a novel key pre-distribution scheme was put forward based on one-way hash chain and bivariate polynomial, which can afford sufficient security no matter how many sensor nodes are compromised compared with existing typical key pre-distribution schemes. Better network connectivity, lower key storage overhead and lower communication overhead can also be achieved by the proposed scheme.
We propose a （L, n）-threshold quantum secret sharing protocol of secure direct communication following some ideas of Zhang＇s protocol [Phys. Lett. A 342 （2005） 60] and Tokunaga et al.＇s protocol [Phys. Rev. A 71...
详细信息
We propose a （L, n）-threshold quantum secret sharing protocol of secure direct communication following some ideas of Zhang＇s protocol [Phys. Lett. A 342 （2005） 60] and Tokunaga et al.＇s protocol [Phys. Rev. A 71 （2005） 012314]. The sender distributes the classical secret shares to his or her n agents and each agent owns a secret share in advance. The sender＇s secure direct communication message can be extracted by an agent subset by collaboration in such a way that at least t or more agents can obtain the secret message with the mutual assistances but any t - 1 or fewer agents cannot. In contrast to the previous multiparty quantum secret sharing protocols in which the sender＇s secret message can be recovered only if all the agents collaborate, our protocol is more practical and more flexible.
A successful transaction of digital contents is primarily dependent on security policies, trust mechanisms and benefits balances, as well as the simple adoption of the combination of enhanced security policies would n...
详细信息
A successful transaction of digital contents is primarily dependent on security policies, trust mechanisms and benefits balances, as well as the simple adoption of the combination of enhanced security policies would not effectively establish a trust relationship among various stakeholders in the DRM (Digital rights management) -enabling contents value chain. With respect to a generic DRM ecosystem, the hierarchy analyses of the multi-participant trust architecture were proposed based on the game-theoretic adoptions of security policies. By using formalized definitions of security components and services' utilities, we presented the choice of policies with the external relativity, in the contents acquisition scenario, as a multi - Player simultaneous-move game referred to contents provider, digital services/rights provider and consumer. Also, in term of security policies combinations' utilities and benefit effects on participants, we further gained the game's Nash Equilibrium, which is a stable profile of security policies achieving the optimal balance of the security and utilities, thus establishing and strengthening the multiparty trust. The analytic conclusions show that enhanced security policies profile does not necessarily achieve optimal benefits balance in the one-stage game, for a small quantity of digital contents transactions. Whereas, the profile could transform into Nash Equilibrium with the increase of transaction sessions, meanwhile being Pareto Optimality.
This paper presents a concrete democratic group signature scheme which holds （t, n）-threshold traceability. In the scheme, the capability of tracing the actual signer is distributed among n group members. It gives a...
详细信息
This paper presents a concrete democratic group signature scheme which holds （t, n）-threshold traceability. In the scheme, the capability of tracing the actual signer is distributed among n group members. It gives a valid democratic group signature such that any subset with more than t members can jointly reconstruct a secret and reveal the identity of the signer. Any active adversary cannot do this even if he can corrupt up to t - 1 group members.
It is a significant challenge to find out suitable cryptography for wireless sensor networks owing to limitations of power, computation capability and storage resources. Many schemes based on public or symmetric key c...
详细信息
This article presents the formal definition and description of popular topics on the Internet,analyzes the relationship between popular words and topics,and finally introduces a method that uses statistics and correla...
详细信息
This article presents the formal definition and description of popular topics on the Internet,analyzes the relationship between popular words and topics,and finally introduces a method that uses statistics and correlation of the popular words in traffic content and network flow characteristics as input for extracting popular topics on the *** on this,this article adapts a clustering algorithm to extract popular topics and gives formalized *** test results show that this method has an accuracy of 16.7%in extracting popular topics on the *** with web mining and topic detection and tracking(TDT),it can provide a more suitable data source for effective recovery of Internet public opinions.
暂无评论