Internet applications become increasingly widely used for millions of people in the world and on the other hand the accidents or disruptions of service are also dramatically increasing. Accidents or Disruptions occur ...
详细信息
The well-known non-interactive and information-theoretic secure verifiable secret sharing scheme presented by Pedersen is over a large prime. In this paper, we construct a novel non-interactive and information-theoret...
详细信息
The well-known non-interactive and information-theoretic secure verifiable secret sharing scheme presented by Pedersen is over a large prime. In this paper, we construct a novel non-interactive and information-theoretic verifiable secret sharing over RSA （Rivest, Shamir, Adleman） modulus and give the rigorous security proof. It is shown how to distribute a secret among a group such that any set of k parties get no information about the secret. The presented scheme is generally applied to constructions of secure distributed multiplication and threshold or forward-secure signature protocols.
Region duplication forgery, in which a part of a digital image is copied and then pasted to another portion of the same image in order to conceal an important object in the scene, is one of the common image forgery te...
详细信息
Moving object segmentation in the compressed domain plays an important role in many real-time applications, e.g. video indexing, video surveillance, etc. H.264/AVC is the up-to-date video coding standard, which employ...
详细信息
ISBN:
(纸本)300018726X
Moving object segmentation in the compressed domain plays an important role in many real-time applications, e.g. video indexing, video surveillance, etc. H.264/AVC is the up-to-date video coding standard, which employs several new coding tools and provides a different video format. In this paper, a robust spatio-temporal segmentation approach to extract moving objects in the compressed domain for H.264 video stream is proposed. Coarse moving objects are firstly extracted from the motion vector field through the MRF classification process. Spatial segmentation is based on the HT coefficient, which is used to refine the object boundary of temporal segmentation results. Fusion of spatio-temporal segmentation is based on region projection based labeling technique. Further edge refinement is performed to smooth the object boundaries. The performance of the proposed approach is illustrated by simulation carried on several test sequences. Experimental results show that the proposed approach can provide the visually similar results as by using spatial domain process with much less computational complexity.
Side-channel attacks （SCA） may exploit leakage information to break cryptosystems. In this paper we present a new SCA resistant Elliptic Curve scalar multiplication algorithm. The proposed algorithm, builds a sequen...
详细信息
Side-channel attacks （SCA） may exploit leakage information to break cryptosystems. In this paper we present a new SCA resistant Elliptic Curve scalar multiplication algorithm. The proposed algorithm, builds a sequence of bit-strings representing the scalar k, characterized by the fact that all bit-strings are different from zero; this property will ensure a uniform computation behavior for the algorithm, and thus will make it secure against simple power analysis attacks （SPA）. With other randomization techniques, the proposed countermeasures do not penalize the computation time. The proposed scheme is more efficient than MOEller＇s one, its cost being about 5% to 10% smaller than MOEller＇s one.
According to the various security access methods applied to wireless local area network (WLAN), an approach to integrating WPA and WAPI is presented, which can make wireless terminals able to access WLAN expediently. ...
详细信息
According to the various security access methods applied to wireless local area network (WLAN), an approach to integrating WPA and WAPI is presented, which can make wireless terminals able to access WLAN expediently. With the related access information, this approach can recognize the network type, and then adaptively choose the corresponding protocol to access the network.
By using the Lagrange interpolation formula and the technology of signature of equality, a (k, n) threshold nominative proxy signature scheme is proposed, where an original signer delegates his (her) signing power to ...
详细信息
By using the Lagrange interpolation formula and the technology of signature of equality, a (k, n) threshold nominative proxy signature scheme is proposed, where an original signer delegates his (her) signing power to a proxy, who generates a nominative signature on behalf of the original signer and only k or more active verifiers in the n nominees (verifiers) nominated by the proxy signer can verify the signature signed by the proxy. If necessary, these (k or more) active nominees (verifiers) can prove its validity to a third party. In this scheme, the secret shares are generated and en- crypted by the original signer. At the same time, the ciphertexts of the secret shares are used as parts of the signature. Then, the secret shares need not be sent to the nominees (verifiers) secretly. The ordinary nominative proxy signature can be viewed as a (1, 1) threshold nominative proxy signature. The ordinary nominative proxy signature can be viewed as a special case of a (k, n) threshold nominative proxy signature. According to the security analysis of this paper, it is found that our scheme is secure against a proxy signing key forgery attack and existential forgery on an adaptive chosen message attack.
The paper puts forward a new proof of compliance algorithm in PolicyMaker, the algorithm applies graphic theory's DFS notion and the dynamic character, in the face of withdrawing the delegation, deletes the delega...
详细信息
The paper puts forward a new proof of compliance algorithm in PolicyMaker, the algorithm applies graphic theory's DFS notion and the dynamic character, in the face of withdrawing the delegation, deletes the delegation side, then newly searches, finds other chain discovery until the end. It solves the negative credentials, compared with the time and space complicated degree of the original arithmetic, the algorithm is more simple and shortcut.
The decentralized and anonymous characteristics of P2P environments make the task of controlling access to sharing information more difficult, which cannot be done by traditional access control methods. In this paper,...
详细信息
PMI （privilege management infrastructure） is used to perform access control to resource in an E-commerce or E-government system. With the ever-increasing need for secure transaction, the need for systems that offer ...
详细信息
PMI （privilege management infrastructure） is used to perform access control to resource in an E-commerce or E-government system. With the ever-increasing need for secure transaction, the need for systems that offer a wide variety of QoS （quality-of-service） features is also growing. In order to improve the QoS of PMI system, a cache based on RBAC （Role-based Access control） and trust is proposed. Our system is realized based on Web service. How to design the cache based on RBAC and trust in the access control model is deseribed in detail. The algorithm to query role permission in cache and to add records in cache is dealt with. The policy to update cache is introduced also.
暂无评论