A Novel Visual Multi-Secret Sharing Scheme Based on Folding-up Operation

The Visual multi-secret sharing （VMSS） scheme is characterized by encoding several secret images into a set of noise-like shares. Most existing VMSS meth- ods have to distort shares to embed additional secret im- ages. As a result, the quality of the decoded original secret image is degraded. This paper proposes a folding-up op- eration based VMSS scheme, which is able to encode one secret image and a group of tag images into shares. The secret image is revealed by stacking all shares, and fold- ing up each chosen share discloses the tag image. The proposed scheme encodes tag images without affecting the quality of the reconstructed secret image. The quality of the decoded secret image is equal to that of the conven- tional Visual secret sharing （VSS） scheme. The superiority of the proposed method is experimental verified.     

Circular threshold quantum secret sharing

This paper proposes a circular threshold quantum secret sharing （TQSS） scheme with polarized single photons. A polarized single photon sequence runs circularly among any t or more of n parties and any t or more of n parties can reconstruct the secret key when they collaborate. It shows that entanglement is not necessary for quantum secret sharing. Moreover, the theoretic efficiency is improved to approach 100% as the single photons carrying the secret key are deterministically forwarded among any t or more of n parties, and each photon can carry one bit of information without quantum storage. This protocol is feasible with current technology.     

Quantum state sharing of an arbitrary qudit state by using nonmaximally generalized GHZ state

We present a scheme for quantum state sharing of an arbitrary qudit state by using nonmaximally entangled generalized Greenberger-Horne-Zeilinger （GHZ） states as the quantum channel and generalized Bell-basis states as the joint measurement basis. We show that the probability of successful sharing an unknown qudit state depends on the joint measurements chosen by Alice. We also give an expression for the maximally probability of this scheme.     

Deterministic Time-Varying Packet Fair Queueing for Integrated Services Networks

In integrated services networks, the provision of Quality of Service (QoS) guarantees depends critically upon the scheduling algorithm employed at the network layer. In this work we review fundamental results on scheduling, and we focus on Packet Fair Queueing (PFQ) algorithms, which have been proposed for QoS wireline-wireless networking. The basic notion in PFQ is that the bandwidth allocated to a session is proportional to a positive weight _i . Because of the fixed weight assignment, the inherent in PFQ delay-bandwidth coupling imposes limitations on the range of QoS that can be supported. We develop PFQ with deterministic time-varying weight assignments, and we propose a low-overhead algorithm capable of supporting arbitrary piecewise linear service curves which achieve delay-bandwidth decoupling. Unlike existing service-curve based algorithms, our time-varying PFQ scheme does not exhibit the punishment phenomenon, and allows sessions to exploit the extra bandwidth in under-loaded networks.     

Threshold Visual Cryptography Schemes with Specified Whiteness Levels of Reconstructed Pixels

In 1994, Naor and Shamir introduced an unconditionally secure method for encoding black and white images. This method, known as a threshold visual cryptography scheme (VCS), has the benefit of requiring no cryptographic computation on the part of the decoders. In a -VCS, a share, in the form of a transparency, is given to ">n users. Any ">k users can recover the secret simply by stacking transparencies, but ">k-1 users can gain no information about the secret whatsoever.In this paper, we first explore the issue of contrast, by demonstrating that the current definitions are inadequate, and by providing an alternative definition. This new definition motivates an examination of minimizing pixel expansion subject to fixing the VCS parameters ">h and ">l. New bounds on pixel expansion are introduced, and connections between these bounds are examined. The best bound presented is tighter than any previous bound. An analysis of connections between (2, ">n) schemes and designs such as BIBD's, PBD's, and (">r, )-designs is performed. Also, an integer linear program is provided whose solution exactly determines the minimum pixel expansion of a (2, ">n)-VCS with specified ">h and >l.     

A New Signature Scheme with Shared Verification

1Introduction Withthedevelopmentofcomputerandnetworkcom municationtechnology,andwiththedifferenceofuser s demands,digitalsignaturetechniquesarebeingexpand edgreatly,fromthesinglesignature,singleverification modetothemulti user sone.Forexample,adocument sy…     

新形势下我国西部广电网络发展的障碍与对策

我国广电网络正处在由模拟向数字转换的新的发展阶段,面对全国各试点城市的数字电视热潮,冷静分析了我国西部地区广电网络发展的现状,归纳并总结了西部地区发展数字电视所面临的困难、存在的问题及阻碍发展的因素,提出了对促进西部地区数字电视发展的一些看法。     

软件企业知识共享影响因素模式研究

知识被认为是企业最重要的战略资源，企业成功与否取决于知识管理的成败。知识共享是企业实施知识管理活动的重要议题。本文详细分析了软件企业员工知识的特点，识别出影响员工知识共享的关键因素，提出了影响软件企业知识共享的基本模式。     

基于Harn签名方案的远距离通行字认证方案

本文首先利用Ｓｈａｍｉｒ的秘密共享方法将Ｃｈａｎｇ－Ｌｉａｏ通行字认证方案转变成（ｔ，ｎ）共享认证方案，从而使ｎ个认证者中任意ｔ个人能够认证通行字的正确性。其次提出了一个基于Ｈａｒｎ数字签名方案的远距离通行字认证方案。     

New Alternatives to the Estimation Problem in Hardware-Software Codesign of Complex Embedded Systems: The H.261 Video Co-dec Case Study

As Codesign problems become larger and more realistic, the required time to estimate their solutions turns into an important bottleneck. This paper presents a new approach to improve the traditional estimation techniques, in order to avoid this drawback. The presented method has been successfully tested on a large experimental benchmark, attaining quality levels close to those provided by the Synopsys Behavioral Compiler. Finally, a case study based on the standard H.261 video co-dec is described, proving the convenience of the technique on real-life situations. The obtained results show a significant improvement in the process time, while keeping the good precision and fidelity levels that the traditional estimation models usually offer.