cdh problem
Recently Published Documents


TOTAL DOCUMENTS

2
(FIVE YEARS 0)

H-INDEX

1
(FIVE YEARS 0)

We consider non-commutative generalization of CDH problem [1,2] on base of metacyclic group G of type Millera Moreno (minimal non-abelian group). We show that conjugacy problem in this group are intractable. The algorithm of generating (desinging) of common key in non-commutative group with 2 mutually commuting subgroups are constructed by us.


2014 ◽  
Vol 696 ◽  
pp. 259-265 ◽  
Author(s):  
Shun Yao Yang

Current remote attestation schemes in trusted cloud computing lack of dynamic measure scheme of virtual computing nodes. In this paper, by the analysis and comparison of existing remote attestation technology, we propose a trust measure of virtual computing node running state, and a remote attestation scheme based on the trust measure results and CP-ABE attribute access control. By RO security analysis, and a simulation, we verify the security and efficiency of the program. The trust measure of platform running state is mainly based on the trust rating of the programs running on the platform, and a total trust value of the platform by an algorithm. The trust measure of virtual computing node running state is mainly based on the trust measure of the programs running on the platform and CP-ABE attribute access control. The remote attestation for the trust measure of platform running state is based on CDH problem. In this paper, we carry out simulation experiment with different proportions of non-credible nodes and the experiment results verify the trust evaluation efficiency of the scheme on the virtual machine.


Sign in / Sign up

Export Citation Format

Share Document