|
|
|
题名
|
作者
|
年代
|
出处
|
被引量
|
| 1 | Secure DRM Scheme Based on Blockchain with High Credibility显示文摘Upon the fairness, security and flexibility problems of traditional digital rights management, we proposed a blockchain infrastructure service based DRM platform with high-level credit and security, in which we first proposed a Blockchain as a service(Baa S) architecture to decrease the complexity and difficulty of building up a blockchain-based business model, the Baa S infrastructure transparently provides easily-developed user interface to implement all core functions such as genesis block creation, consensus mechanism definition, node initialization and running, wallet management, address management,blockchain explorer et al. Then based on the Baa S infrastructure we proposed a blockchain-based DRM platform with high-level credit and security for Content provider(CP), Service provider(SP) and customers. We designed the blockchain as infrastructure service for DRM business model and provided core content rights information storage in blockchain for tamper-resistant copyrights protection from being misused, and the content consumers can use blockchain-based digital assets for content consumption payment, and the platform can help the content demandside and supply-side trading and the blockchain recorded the trade data as tamper-resistant evidence. Evaluation experiments manifests the proposed scheme is reliable and secure, and provided an efficient methodology for blockchain application business model implementation. | MA Zhaofeng HUANG Weihua GAO Hongmin | 2018 | Chinese Journal of Electronics2018，27，5： | 8 |
| 2 | EABDS: Attribute-Based Secure Data Sharing with Efficient Revocation in Cloud Computing显示文摘Ciphertext-policy attribute-based encryption(CP-ABE) is becoming a promising solution to guarantee data security in cloud computing. In this paper,we present an attribute-based secure data sharing scheme with Efficient revocation(EABDS) in cloud computing.Our scheme first encrypts data with Data encryption key(DEK) using symmetric encryption and then encrypts DEK based on CP-ABE, which guarantees the data confidentiality and achieves fine-grained access control. In order to solve the key escrow problem in current attribute based data sharing schemes, our scheme adopts additively homomorphic encryption to generate attribute secret keys of users by attribute authority in cooperation with key server, which prevents attribute authority from accessing the data by generating attribute secret keys alone.Our scheme presents an immediate attribute revocation method that achieves both forward and backward security.The computation overhead of user is also reduced by delegating most of the decryption operations to the key server.The security and performance analysis results show that our scheme is more secure and efficient. | HUANG Qinlong MA Zhaofeng YANG Yixian FU Jingyi NIU Xinxin | 2015 | Chinese Journal of Electronics2015，24，4： | 8 |
| 3 | 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. | Zhaofeng Ma | 2017 | China Communications2017，14，6： | 6 |
| 4 | 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. | Zhaofeng Ma Weihua Huang Wei Bi Hongmin Gao Zhen Wang | 2018 | China Communications2018，15，8： | 5 |
| 5 | Compressive Sensing-Based Audio Semi-fragile Zero-Watermarking Algorithm显示文摘A novel compressive sensing-based audio semi-fragile zero-watermarking algorithm is proposed in this paper. This algorithm transforms the original audio signal into the wavelet domain and applies compressive sensing theory to the approximation wavelet coefficients.The zero-watermarking is constructed according to the positive and negative properties of elements in the measurement vector. The experimental results show that the proposed algorithm is robust against common audio signal processing and fragile to malicious tampering. Compared with the existing algorithms, the proposed algorithm improves malicious tampering detection accuracy in common audio signal processing environments. | TANG Xin MA Zhaofeng NIU Xinxin YANG Yixian | 2015 | Chinese Journal of Electronics2015，24，3： | 5 |
| 6 | Control of endwall secondary flow in a compressor cascade with dielectric barrier discharge plasma actuation显示文摘Three dielectric barrier discharge plasma actuators were mounted at the positions of 20%,40%and 60%of chord length on the endwall in a compressor cascade.The downstream flow field of the cascade has been measured with a mini five-hole pressure probe with and without the plasma actuation.The measured results show that the plasma actuation most effectively reduces total pressure loss and flow blockage when the actuators are operated simultaneously.As each of the actuators is operated independently,the actuator at the position of 20%of chord length most effectively reduces flow blockage, and the actuator at the position of 60%of chord length fairly reduces total pressure loss.However, negative pressure loss reduction occurs with the plasma actuator at the position of 40%of chord length.In brief,the plasma actuation placed on the endwall in the cascade apparently influences the endwall secondary flow,and the optimal locations and strength of actuation are critical for the control of endwall secondary flow in a compressor cascade with the plasma actuators. | LI Gang XU YanJi LIN Bin ZHU JunQiang NIE ChaoQun MA HongWei WANG ZhaoFeng | 2009 | Science China(Technological Sciences)2009，52，12： | 5 |
| 7 | Mesoscopic superelasticity,superplasticity,and superrigidity显示文摘Atomic-undercoordination-induced local bond contraction,bond strength gain,and the associated temperature (T)-dependent atomic-cohesive-energy and binding-energy-density are shown to originate intrinsically the exotic paradox of superplasticity,superelasticity,and superrigidity demonstrated by solid sizing from monatomic chain to mesoscopic grain.The paradox follows these relationships:(ε(K,T)y(K,T)σ(K,T))∝(exp(B/△T_(mk)),(η_1△T_(mk))d~(-3),[1+AK~(-2/2)exp(△T_(mk)/T)]△T_(mk)d~(-3)),(Plastic strain)(Elastic modulus)(Yield stress,IHPR)where A,B,η1,d and△T_(mk)=Tm(K) Tare size (K)-dependent physical parameters.Tm (K) is the melting point.Mechanical work hardening during compressing and self-heating during stretching modulate the measured outcome extrinsically.Superplasticity dominates in the solid-quasimolten-liquid transition state.The competition between the accumulation and annihilation of dislocations activates the inverse Hall-Petch relationship.Therefore,it is essential for one to discriminate the intrinsic competition between the local bond energy density gain and the atomic cohesive energy loss from the extrinsic factors of pressure and temperature in dealing with atomistic mechano-thermo dynamics. | MA ZengSheng ZHOU ZhaoFeng HUANG YongLi ZHOU YiChun SUN ChangQing | 2012 | Science China(Physics,Mechanics & Astronomy)2012，55，6： | 3 |
| 8 | Attribute Based DRM Scheme with Dynamic Usage Control in Cloud Computing显示文摘In order to achieve fine-grained access control in cloud computing,existing digital rights management(DRM) schemes adopt attribute-based encryption as the main encryption primitive.However,these schemes suffer from inefficiency and cannot support dynamic updating of usage rights stored in the cloud.In this paper,we propose a novel DRM scheme with secure key management and dynamic usage control in cloud computing.We present a secure key management mechanism based on attribute-based encryption and proxy re-encryption.Only the users whose attributes satisfy the access policy of the encrypted content and who have effective usage rights can be able to recover the content encryption key and further decrypt the content.The attribute based mechanism allows the content provider to selectively provide fine-grained access control of contents among a set of users,and also enables the license server to implement immediate attribute and user revocation.Moreover,our scheme supports privacy-preserving dynamic usage control based on additive homomorphic encryption,which allows the license server in the cloud to update the users' usage rights dynamically without disclosing the plaintext.Extensive analytical results indicate that our proposed scheme is secure and efficient. | HUANG Qinlong | 2014 | China Communications2014，11，4： | 3 |
| 9 | A Video Watermarking DRM Method Based on H.264 Compressed Domain with Low Bit-Rate Increasement显示文摘It gets more and more important for video copyright protection,it is necessary to provide efficient H.264 compression domain watermarking for video Digital rights management(DRM).A new watermarking method based on H.264 compressed domain is proposed for video DRM,in which the embedding and extracting procedure are performed using the syntactic elements of the compressed bit stream.In this way,complete decoding is unnecessary in both embedding and extracting processes.Based on the analysis of the time and space,some appropriate sub-blocks are selected for embedding watermarks,increasing watermark robustness while reducing the declination of the visual quality.In order to avoid bit-rate increasing and strengthen the security of the proposed video watermarking scheme,only a set of nonzero coefficients quantized in different parts of macroblocks is chosen for inserting watermark.The experiment results show the proposed scheme can achieve excellent robustness against some common attacks,the proposed scheme is secure and efficient for video content DRM protection. | MA Zhaofeng HUANG Jianqing JIANG Ming NIU Xinxin | 2016 | Chinese Journal of Electronics2016，25，4： | 3 |
| 10 | Secure Data Sharing and Retrieval Using Attribute-Based Encryption in Cloud-Based OSNs显示文摘The Online social networks(OSNs) offer attractive means for social interactions and data sharing,but also raise a number of security and privacy issues. Since the OSNs service provider is always semi-trusted, current solutions propose to encrypt data before sharing. However,data encryption causes a lot of inconveniences and large overheads for data dissemination and data retrieval. In this paper, we propose a secure data sharing and retrieval scheme in cloud-based OSNs. Based on ciphertext-policy attribute-based encryption, our scheme achieves multiparty access control, which allows data owners to outsource encrypted data to the OSNs service provider for sharing,and enables data disseminators to disseminate the data owners' data by customizing new access policy. Our scheme also provides searchable encryption scheme to support fast searches in massive amount of encrypted data from both data owners and data disseminators. Further, our scheme preserves the privacy of data owners and data retrievers during the data sharing and retrieval processes. In addition, the computation overhead of data retrievers is reduced by delegating most of the decryption operations to the OSNs service provider. The security and performance analysis results indicate that our scheme is secure and privacy-preserving. | HUANG Qinlong MA Zhaofeng YANG Yixian FU Jingyi NIU Xinxin | 2014 | Chinese Journal of Electronics2014，23，3： | 3 |
| 11 | A Novel Image Digital Rights Management Scheme with High-Level Security,Usage Control and Traceability显示文摘Current methods of image protection based on chaos encryption can only provide security in Human visual system(HVS) level, however they can not provide usage control when the image is opened, printed or exported. To solve this problem, we proposed a novel image digital rights management scheme for Confidential image data security based on encryption and watermark(CIDSEW) with high-level security, usage control and traceability, in which we employed full content image encryption for confidentiality of the image to be protected, and we firstly proposed strict and detailed Usage control(UC) scheme for Confidential image data(CIData) usage password-based authentication, opening times, printing and exporting control. And when the CIData need to delivery or export to other users or domain, we proposed the secure export and misused tracing and detect approach, in which before the ciphered CIData is exported, we decrypted the CIData in a plain mode, and simultaneously we embedded user-identity-related and hardware-related information as robust watermark for traceability and responsibility confirmation. Finally, we evaluated the proposed CIDSEW by groups of variant size image data for security and efficiency,a large amount of groups of experiments manifest the proposed CIDSEW is secure, efficient, pervasive and robust for confident image data protection, usage control and misuse tracing. | MA Zhaofeng HUANG Jianqing JIANG Ming NIU Xinxin | 2016 | Chinese Journal of Electronics2016，25，3： | 2 |
| 12 | 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. | Zihan Li Zhaofeng Ma | 2021 | China Communications2021，18，6： | 2 |
| 13 | Improving Security and Sharing in Online Social Efficiency for Encrypted Data Networks显示文摘Despite that existing data sharing systems in online social networks(OSNs)propose to encrypt data before sharing,the multiparty access control of encrypted data has become a challenging issue.In this paper,we propose a secure data sharing scheme in OSNs based on ciphertext-policy attributebased proxy re-encryption and secret sharing.In order to protect users' sensitive data,our scheme allows users to customize access policies of their data and then outsource encrypted data to the OSNs service provider.Our scheme presents a multiparty access control model,which enables the disseminator to update the access policy of ciphertext if their attributes satisfy the existing access policy.Further,we present a partial decryption construction in which the computation overhead of user is largely reduced by delegating most of the decryption operations to the OSNs service provider.We also provide checkability on the results returned from the OSNs service provider to guarantee the correctness of partial decrypted ciphertext.Moreover,our scheme presents an efficient attribute revocation method that achieves both forward and backward secrecy.The security and performance analysis results indicate that the proposed scheme is secure and efficient in OSNs. | HUANG Qinlong | 2014 | China Communications2014，11，3： | 2 |
| 14 | The smooth Banach submanifold B*(E,F) in B(E,F)显示文摘Let E,F be two Banach spaces,B(E,F),B+(E,F),Φ(E,F),SΦ(E,F) and R(E,F) be bounded linear,double splitting,Fredholm,semi-Frdholm and finite rank operators from E into F,respectively. Let Σ be any one of the following sets:{T ∈Φ(E,F):Index T=constant and dim N(T)=constant},{T ∈ SΦ(E,F):either dim N(T)=constant< ∞ or codim R(T)=constant< ∞} and {T ∈ R(E,F):Rank T=constant< ∞}. Then it is known that Σ is a smooth submanifold of B(E,F) with the tangent space TAΣ={B ∈ B(E,F):BN(A)-R(A) } for any A ∈Σ. However,for B*(E,F)={T ∈ B+(E,F):dimN(T)=codimR(T)= ∞} without the characteristic numbers,dimN(A) ,codimR(A) ,index(A) and Rank(A) of the equivalent classes above,it is very diffcult to find which class of operators in B*(E,E) forms a smooth submanifold of B(E,F) . Fortunately,we find that B*(E,F) is just a smooth submanifold of B(E,F) with the tangent space TAB*(E,F)={T ∈ B(E,F) :T N(A) -R(A) } for each A ∈ B*(E,F) . Thus the geometric construction of B+(E,F) is obtained,i.e.,B+(E,F) is a smooth Banach submanifold of B(E,F) ,which is the union of the previous smooth submanifolds disjoint from each other. Meanwhile we give a smooth submanifold S(A) of B(E,F) ,modeled on a fixed Banach space and containing A for any A ∈ B+(E,F) . To end these,results on the generalized inverse perturbation analysis are generalized. Specially,in the case E=F=Rn,it is obtained that the set Σr of all n × n matrices A with Rank(A)=r < n is an arcwise connected and smooth hypersurface(submanifold) in B(Rn) with dimΣr=2nr-r2. Then a new geometrical construction of B(Rn) ,analogous to B+(E,F) ,is given besides its analysis and algebra constructions known well. | MA ZhaoFeng MA JiPu | 2009 | Science China Mathematics2009，52，11： | 2 |
| 15 | Robust Audio Watermarking Algorithm Based on Empirical Mode Decomposition显示文摘A novel robust audio watermarking algorithm based on empirical mode decomposition is proposed.The intrinsic feature of the final residual decomposed from the audio frame is selected to embed watermark and the algorithm works by shifting each element of the final residual to make its sum greater or less than 0. The experimental results show that the proposed algorithm does not change the property of the final residual after embedding watermark and the watermark is robust against various kinds of attacks. Compared with existing classic algorithms based on Empirical mode decomposition(EMD), the proposed algorithm largely improves both the robustness and imperceptibility of watermarking. | TANG Xin MA Zhaofeng NIU Xinxin YANG Yixian | 2016 | Chinese Journal of Electronics2016，25，6： | 2 |
| 16 | A novel R-loop in mouse mitochondrial DNA显示文摘Mammalian mitochondrial D-loop L-strand RNA (DL-RNA) is thought functionally not important because no obvious function has been found so far. In this study, we detected a novel D-loop L-strand RNA (DL-RNA) in mouse mitochondrion by RT-PCR. The L-strand RNA spans the whole D-loop region of mouse mtDNA, and is resistant to RNase A and RNase T1 but not RNase H digestion. After binding of the L-strand RNA to D-loop, the DL-RNA complex can protect the D-loop from digestion by restriction endonuclease HaeⅢ. These results indicate that a novel RNA-DNA triplex hybrid (R-loop) can be formed in mouse mtDNA D-loop region, and that the DL-RNA structure is capable of protecting the D-loop from certain microbial restriction enzyme digestion. And the similar R-loop structure can not be found in Cyt.b gene in control experiment which confirmed this R-loop is not the fleeting structure in RNA transcription. Considering the D-loop represents the control region of mtDNA, the novel triplex DNA-RNA complex may play an important role in mtDNA replication and transcription. | HUANG Zhaofeng, ZHANG Yi, MA Runlin and LIU Yinong(Institute of Genetics and Developmental Biology, Chinese Academy of Sciences, Beijing 100101, China) | 2003 | Progress in Natural Science:Materials International2003，13，7： | 1 |
| 17 | NASA--Ap- proved Rotary Bioreactor Enhances Proliferation and Osteo- genesis of Human Peridontal Ligament Stem Cells 显示文摘 | Shi Li Zhaofeng Ma Zhongying Niu | 2009 | Stem Cells Dev2009，18，9： | 1 |
| 18 | NASA-Ap proved Rotary Bioreactor Enhances Proliferation and Osteo- genesis of Human Periodontal Ligament 显示文摘 | Shi Li Zhaofeng Ma Zhongying Niu | 2009 | Stem Cells2009，18，9： | 1 |
| 19 | 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. | Zhaofeng Ma | 2018 | Analysis in Theory and Applications2018，34，2： | 1 |
| 20 | Attribute Based DRM Scheme with Efficient Revocation in Cloud Computing显示文摘 | Qinlong Huang Zhaofeng Ma Jingyi Fu Xinxin Niu Yixian Yang | 2013 | Journal of Computers2013，，11： | 1 |
您所在的机构暂未开通此部分的功能，请联系管理员