Digital Rights Management：Model,Technology and Application

with rapid achievement of current information technology and computing ability and applications,much more digital content such as films,cartoons,design drawings,office documents and software source codes are produced in daily work,however to protect the content being copying,shared or deliberately stolen by inside or outside,digital rights management(DRM) became more and more important for digital content protection.In this paper,we studied various DRM model,technology and application,and first proposed DRM Security Infrastructure(DSI),in which we defined encryption,hash,signature algorithm,watermarking algorithms,authentication,usage control,trusted counter,conditional trace,secure payment,and based on the DSI we then proposed a whole classification approach and architecture of all kinds of DRMs,in which we proposed 6 typical classes of copyrights and content protection DRMs architecture:(1) Software-oriented DRM,(2) e Book-oriented DRM,(3) Video-oriented DRM,(4) Image-Oriented DRM(5) Unstructured data oriented DRM,(6) Text-oriented DRM.Based on the above DSI,we then proposed a dynamic DRM model selection method for various DRM application,which can be adapted dynamically for different technology of different applications,which can provide awhole solution for variant DRM development in a rapid and customized mode.The proposed DRM method,technology and application in this paper provided a common,flexible and extendable solution for variant DRM scenes,and can support rapid and customized development.Moreover,we proposed an opinion that the future life will enter into a new era that the content usage and consumption will not again adopt DRM technology rather than with law,liberty and morality.

A Master-Slave Blockchain Paradigm and Application in Digital Rights Management

Upon flaws of current blockchain platforms of heavyweight, large capacity of ledger, and time-consuming of synchronization of data, in this paper, we proposed a new paradigm of master-slave blockchain scheme(MSB) for pervasive computing that suitable for general PC, mobile device such as smart phones or PADs to participants in the working of mining and verification, in which we separated traditional blockchain model in 2 layer defined as master node layer and a series of slavery agents layer, then we proposed 2 approaches for partially computing model(PCM) and non-computing of model(NCM) in the MSB blockchain, Finally large amounts of simulations manifest the proposed master-slave blockchain scheme is feasible, extendible and suitable for pervasive computing especially in the 5 G generation environment, and can apply in the DRM-related applications.

A Blockchain-Based Credible and Secure Education Experience Data Management Scheme Supporting for Searchable Encryption

With the in-depth application of new technologies such as big data in education fields,the storage and sharing model of student education records data still faces many challenges in terms of privacy protection and efficient transmission.In this paper,we propose a data security storage and sharing scheme based on consortium blockchain,which is a credible search scheme without verification.In our scheme,the implementation of data security storage is using the blockchain and storage server together.In detail,the smart contract provides protection for data keywords,the storage server stores data after data masking,and the blockchain ensures the traceability of query transactions.The need for precise privacy data is achieved by constructing a dictionary.Cryptographic techniques such as AES and RSA are used for encrypted storage of data,keywords,and digital signatures.Security analysis and performance evaluation shows that the availability,high efficiency,and privacy-preserving can be achieved.Meanwhile,this scheme has better robustness compared to other educational records data sharing models.

Generalized Inverse Analysis on the Domain ?(A, A^+) in B(E,F)

Let B(E,F) be the set of all bounded linear operators from a Banach space E into another Banach space F,B^+(E, F) the set of all double splitting operators in B(E, F)and GI(A) the set of generalized inverses of A ∈ B^+(E, F). In this paper we introduce an unbounded domain ?(A, A^+) in B(E, F) for A ∈ B^+(E, F) and A^+∈GI(A), and provide a necessary and sufficient condition for T ∈ ?(A, A^+). Then several conditions equivalent to the following property are proved: B = A+(IF+(T-A)A^+)^(-1) is the generalized inverse of T with R(B)=R(A^+) and N(B)=N(A^+), for T∈?(A, A^+), where IF is the identity on F. Also we obtain the smooth(C~∞) diffeomorphism M_A(A^+,T) from ?(A,A^+) onto itself with the fixed point A. Let S = {T ∈ ?(A, A^+) : R(T)∩ N(A^+) ={0}}, M(X) = {T ∈ B(E,F) : TN(X) ? R(X)} for X ∈ B(E,F)}, and F = {M(X) : ?X ∈B(E, F)}. Using the diffeomorphism M_A(A^+,T) we prove the following theorem: S is a smooth submanifold in B(E,F) and tangent to M(X) at any X ∈ S. The theorem expands the smooth integrability of F at A from a local neighborhoold at A to the global unbounded domain ?(A, A^+). It seems to be useful for developing global analysis and geomatrical method in differential equations.

An efficient confidentiality protection solution for pub/sub system

Publish/subscribe(pub/sub)systems are widely used in large-scale messaging systems due to their asynchronous and decoupled nature.With the population of pub/sub cloud services,the privacy protection problem of pub/sub systems has started to emerge,and events and subscriptions are exposed when executing event matching on untrustworthy cloud brokers.However,as the number of subscriptions increases,the effectiveness of the previous confidentiality protection approaches declines drastically.In this paper,we propose SBM(scalable blind matching),an effective confidentiality protection scheme for pub/sub systems.To the best of our knowledge,SBM is the first scheme that applies order-preserving encryption algorithm to protect the system’s confidentiality and ensure its scalability.In this scheme,SBM-I is highly effective in subscription matching but is unable to achieve ideal security IND-OCPA,whereas SBM-II is suggested to ensure system security and SGX is used to reduce interaction and boost ciphertext matching performance.The experiment demonstrates that this method has better matching performance compared to others:the average matching time of SBM-I is 3–4 orders of magnitude faster than the matching algorithm MP and SGX-based algorithm SCBR when the number of subscriptions is 500,000,and the average matching time of SBM-II is 40 times faster than MP and 24 times than SCBR.