Restrictive partially blind signature （RPBS） plays an important role in designing secure electronic cash system Very recently, Wang, Tang and Li proposed a neW ID-based restrictive partially blind signature （ID-RPB...
详细信息
Restrictive partially blind signature （RPBS） plays an important role in designing secure electronic cash system Very recently, Wang, Tang and Li proposed a neW ID-based restrictive partially blind signature （ID-RPBS） and gave the security proof. In this paper, we present a cryptanalysis of the scheme and show that the signature scheme does not satisfy the property of unforgeability as claimed. More precisely, a user can forge a valid message-signature pair （ID, msg, info＇, σ＇） instead of the original one （ID, msg, info, σ）, where info is the original common agreed information and info＇≠info. Therefore, it will be much dangerous if Wang-Tang-Li＇s ID-RPBS scheme is applied to the off-line electronic cash system. For example, a bank is supposed to issue an electronic coin （or bill） of $100 to a user, while the user can change the denomination of the coin （bill） to any value, say $100 000 000, at his will.
Signcryption is a public key cryptographic primitive that performs digital signature and public key encryption simultaneously, at lower computational costs and communication overheads than the signature-then-encryptio...
详细信息
Signcryption is a public key cryptographic primitive that performs digital signature and public key encryption simultaneously, at lower computational costs and communication overheads than the signature-then-encryption approach. In this paper, an efficient certificate-based signcryption scheme based on bilinear pairings is proposed. As compared to traditional and identity-based signcryption schemes, the proposed scheme has the following advantages: it provides implicit certification;it does not have the private key escrow feature of identity-based signcryption schemes, we also analyze the proposed scheme from security and performance points of view.
Biometric authentication and privacy protection are conflicting issues in a practical system. Since biometrics cannot be revoked or canceled if compromised duo to the permanent association with the user, privacy-prese...
详细信息
A (t, n) threshold proxy signcryption scheme allows t or more proxy signcrypters from a designated group of n proxy signcrypters to signcrypt messages on behalf of an original signcrypter. In this paper, a new identit...
详细信息
A new concept of society-oriented designated confirmer signatures (SDCS) is introduced in this paper. SDCS is well suited to applications where the capability of the signer and that of the confirmer are both expected ...
详细信息
A new concept of society-oriented designated confirmer signatures (SDCS) is introduced in this paper. SDCS is well suited to applications where the capability of the signer and that of the confirmer are both expected to be shared among a group of individuals. The ways to share the signing capability and the confirming capability are different due to the distinct stabilities of the signer group and the confirmer group. Based on the techniques of threshold cryptography, a concrete SDCS scheme is proposed and its security is analyzed. Ordinary designated confirmer signatures and threshold designated confirmer signatures can be regarded as special cases of the proposed society-oriented designated confirmer signatures. Mean-while, our scheme can be converted into an ordinary signature scheme or a designated verifier signature scheme.
Zero knowledge sets is a new cryptographic primitive introduced by Micali, Rabin, and Kilian in FOCS 2003. It has been intensively studied recently. However all the existing ZKS schemes follow the basic structure by M...
详细信息
Zero knowledge sets is a new cryptographic primitive introduced by Micali, Rabin, and Kilian in FOCS 2003. It has been intensively studied recently. However all the existing ZKS schemes follow the basic structure by Micali et al. That is, the schemes employ the Merkle tree as a basic structure and mercurial commitments as the commitment units to nodes of the tree. The proof for any query consists of an authentication chain. We propose in this paper a new algebraic scheme that is completely different from all the existing schemes. Our new scheme is computationally secure under the standard strong RSA assumption. Neither mercurial commitments nor tree structure is used in the new construction. In fact, the prover in our construction commits the desired set without any trapdoor information, which is another key important difference from the previous approaches.
Kernel approach has been employed to solve classification problem with complex distribution by mapping the input space to higher dimensional feature space. However, one of the crucial factors in the Kernel approach is...
详细信息
ISBN:
(纸本)9781424418206
Kernel approach has been employed to solve classification problem with complex distribution by mapping the input space to higher dimensional feature space. However, one of the crucial factors in the Kernel approach is the choosing of kernel parameters which highly affect the performance and stability of the kernel-based learning methods. In view of this limitation, this paper adopts the Eigenvalue Stability Bounded Margin Maximization (ESBMM) algorithm to automatically tune the multiple kernel parameters for Kernel-based LDA methods. To demonstrate its effectiveness, the ESBMM algorithm has been extended and applied on two existing kernel-based LDA methods. Experimental results show that after applying the ESBMM algorithm the performance of these two methods are both improved.
A dynamic stock trading system with a distributed shared memory is analyzed formally based on its temporal Petri net model. The functional correctness of the system is formally verified and some important properties o...
详细信息
The definition of XTR system, which is based on the elements' trace compact denotation in the subgroup of the multiplicative group of the finite field, is a new public keysystem. We propose two signature schemes ...
详细信息
The definition of XTR system, which is based on the elements' trace compact denotation in the subgroup of the multiplicative group of the finite field, is a new public keysystem. We propose two signature schemes based on XTR system with short key length, the quick speed of choosing parameters, and the less amount of computation. And we also show our signature schemes are proven secure by using forking lemma in the random oracle model. The security of our schemes is equivalent to solve the discrete logarithm in XTR group.
As an important security service in distributed systems, non-repudiation is required to implement evidence generating or validating in the application layer. Formal methods are powerful tools to provide security servi...
详细信息
暂无评论