如何构造针对一般存取结构的理想的多秘密共享方案是一个比较困难的问题.本文首先解决了Spiez等最近提出的一个公开问题[Finite Fields and Their Application,2011,17:329–342],即在特权数组存在的前提下,设计求得任意长度的特权数组...如何构造针对一般存取结构的理想的多秘密共享方案是一个比较困难的问题.本文首先解决了Spiez等最近提出的一个公开问题[Finite Fields and Their Application,2011,17:329–342],即在特权数组存在的前提下,设计求得任意长度的特权数组的算法.进一步,我们利用特权数组理论,以Pang等和Yang等的方案为例,分析了大多现有的基于Shamir门限体制的多秘密共享方案均不是完善的.最后,基于特权数组的算法,本文提出了一个多秘密共享方案,我们证明了该方案是理想的,并且方案的存取结构中的授权集比门限方案的更加丰富.展开更多
A new design solution of data access layer for N-tier architecture is presented. It can solve the problems such as low efficiency of development and difficulties in transplantation, update and reuse. The solution util...A new design solution of data access layer for N-tier architecture is presented. It can solve the problems such as low efficiency of development and difficulties in transplantation, update and reuse. The solution utilizes the reflection technology of .NET and design pattern. A typical application of the solution demonstrates that the new solution of data access layer performs better than the current N-tier architecture. More importantly, the application suggests that the new solution of data access layer can be reused effectively.展开更多
文摘如何构造针对一般存取结构的理想的多秘密共享方案是一个比较困难的问题.本文首先解决了Spiez等最近提出的一个公开问题[Finite Fields and Their Application,2011,17:329–342],即在特权数组存在的前提下,设计求得任意长度的特权数组的算法.进一步,我们利用特权数组理论,以Pang等和Yang等的方案为例,分析了大多现有的基于Shamir门限体制的多秘密共享方案均不是完善的.最后,基于特权数组的算法,本文提出了一个多秘密共享方案,我们证明了该方案是理想的,并且方案的存取结构中的授权集比门限方案的更加丰富.
基金the Foundation for Key Teachers of Chongqing University (200209055).
文摘A new design solution of data access layer for N-tier architecture is presented. It can solve the problems such as low efficiency of development and difficulties in transplantation, update and reuse. The solution utilizes the reflection technology of .NET and design pattern. A typical application of the solution demonstrates that the new solution of data access layer performs better than the current N-tier architecture. More importantly, the application suggests that the new solution of data access layer can be reused effectively.
