地方立法质量提升的路径选择

我国地方性法规数量庞大但质量较低,成为困扰地方立法发展的一个主要问题。提高我国地方立法质量,应当从立法范围的界线把握、立法指向的公权力选择、立法程序的科学化以及解决立法冲突和改进立法技术等方面进行积极探索。具体路径有:准确界定以程序立法为核心的地方立法范围、选择以财政权为核心的控权性立法主旨、完善立法程序、解决立法冲突和改进立法技术等。

法与民主

民主作为现代文明的符号在某种程度上领统着生活于其中的人们的视域。本文认为对"民主"一词的由来、基本精义的阐述及法与民主关系的科学揭示将有助于我们实施依法治国方略,正确地把握控权性法律规范,是实施这一方略的关键环节。

Attribute-Based Access Control for Multi-Authority Systems with Constant Size Ciphertext in Cloud Computing

In most existing CP-ABE schemes, there is only one authority in the system and all the public keys and private keys are issued by this authority, which incurs ciphertext size and computation costs in the encryption and decryption operations that depend at least linearly on the number of attributes involved in the access policy. We propose an efficient multi-authority CP-ABE scheme in which the authorities need not interact to generate public information during the system initialization phase. Our scheme has constant ciphertext length and a constant number of pairing computations. Our scheme can be proven CPA-secure in random oracle model under the decision q-BDHE assumption. When user's attributes revocation occurs, the scheme transfers most re-encryption work to the cloud service provider, reducing the data owner's computational cost on the premise of security. Finally the analysis and simulation result show that the schemes proposed in this thesis ensure the privacy and secure access of sensitive data stored in the cloud server, and be able to cope with the dynamic changes of users' access privileges in large-scale systems. Besides, the multi-authority ABE eliminates the key escrow problem, achieves the length of ciphertext optimization and enhances the effi ciency of the encryption and decryption operations.

Attribute-Based Access Control Scheme with Efficient Revocation in Cloud Computing

Attribute-based encryption(ABE) supports the fine-grained sharing of encrypted data.In some common designs,attributes are managed by an attribute authority that is supposed to be fully trustworthy.This concept implies that the attribute authority can access all encrypted data,which is known as the key escrow problem.In addition,because all access privileges are defined over a single attribute universe and attributes are shared among multiple data users,the revocation of users is inefficient for the existing ABE scheme.In this paper,we propose a novel scheme that solves the key escrow problem and supports efficient user revocation.First,an access controller is introduced into the existing scheme,and then,secret keys are generated corporately by the attribute authority and access controller.Second,an efficient user revocation mechanism is achieved using a version key that supports forward and backward security.The analysis proves that our scheme is secure and efficient in user authorization and revocation.

Fuel-optimal trajectory design using solar electric propulsion under power constraints and performance degradation

The fuel-optimal transfer trajectories using solar electric propulsion are designed considering the power constraints and solar array performance degradation.Three different performance degradation models including linear,positive and negative exponential degradations are used in the analysis of three typical rendezvous missions including Apophis,Venus and Ceres,respectively.The optimal control problem is formulated using the calculus of variations and Pontryagin’s maximum principle,which leads to a bang-bang control that is solved by indirect method combined with a homotopic technique.In demonstrating the effects of the power constraints and solar array performance degradation on the power budget and fuel consumption,the time histories of the power profile and the fuel consumptions are compared for the three missions.This study indicates that it is necessary to consider the power constraints and solar array performance degradation for the SEP-based low-thrust trajectory design,espacially for long-duration outbound flights.

Watermarking Data Cubes

We propose a robust watermarking scheme and several extensions for digital right management of data cubes.The ownership information is hidden into a data cube by modifying a set of selected cell values.Its owner can use his private key to control all the watermarking parameters freely.Neither original data cube nor the watermark is required in watermark detection.Detailed analysis and extensive experiments are conducted for the proposed schemes in terms of watermark detectability,robustness and efficiency.Our results show that the scheme performs well in actual applications.