The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Recent technological advances have given rise to the popularity and success of cloud storage. However, the prospect of outsourcing an increasing amount of data to a third party and the abstract nature of the cloud foster the proliferation of security and privacy challenges, namely, the remote data possession checking. This paper addresses this critical security concern, when storing sensitive data...
The present study investigates the difficulty of solving the mathematical problem, namely DLP (Discrete Logarithm Problem) for ephemeral keys. DLP is the basis for many public key cryptosystems. The ephemeral keys are used in such systems to ensure the security. The DLP defined on a prime field Zp* of random prime is considered in the present study. The most effective method to solve the DLP is the...
Identity-based (ID based) public key cryptosystem gives an efficient alternative for key management as compared to certificate based public key settings. A proxy signature is a method for an entity to delegate signing capabilities to other participants so that they can sign on behalf of the entity with in a given context. In this paper, we have proposed a new ID-based proxy signature which is more...
Signcryption has clear advantage over traditional sign-then-encrypt schemes. However, the computational overhead for signcryption is still too heavy when it is applied to resource-constraint systems. In this paper, we propose a generic construction of the identity-based online/offline signcryption, where most of computations are carried out when the associated message is still unavailable and the...
A new scheme of dynamic group blind signature based on elliptic curve discrete logarithm problem (ECDLP) which extends the dynamic group blind signature and the knowledge signature to the elliptic curve cyclic group is generalized. The scheme runs in time slice manner and can be proved security with zero knowledge proof. It supports the dynamic addition and deletion of the group members freely. And...
In spite of many advantages the identity-based cryptosystem provides over traditional public key based cryptosystem, the paradigm requires frequently user authentication and secure channel for private key issue, which have handicapped its wide acceptance and restrict its usage to a small and closed groups where a central trusted authority exists and is easily accessible. In this paper we propose a...
Ad hoc anonymous identification scheme is a multi-user cryptographic primitive that allows participants from a user population to form ad hoc groups, and then prove membership anonymously in such groups. This paper proposes a new ID-based ad-hoc anonymous identification scheme from pairings. The new scheme is efficient both in computation and communication compared to previous works.
As various applications of SIP-based VoIP networks have been proposed, security has become one of the big research challenges and is receiving increasing attention. In this paper, we present a certificate-based two party authentication key agreement protocol for SIP-based VoIP networks and prove its security in the random oracle model. Additionally, our scheme could be used for multiple CAs environment...
Digital signature schemes allow a signer to transform any arbitrary message into a signed message, such that anyone can verify the validity of the signed message by the signerpsilas public key. But, sometimes, we need to constrain the signerpsilas signature times. In this letter, we propose a k-times short signature scheme and show that the scheme is secure without random oracle. The scheme makes...
A practical publicly verifiable secret sharing (PVSS) is constructed based on the bilinear pairing on elliptic curves, which has all advantages of B. Schoenmakerspsila PVSS and its secret is not the form of discrete logarithm, thus this PVSS is extremely practical. Moreover, in the schemepsilas distribution of shares phase, only using bilinearity of bilinear pairing, anybody can verify whether the...
As two special digital signatures, group signature and designatedverifier signature play very important roles in the e-commerce. A group signature scheme allows a group member to anonymously sign message on behalf of the group, In case of a dispute, the group manager can reveal the actual identity of signer. Group signature is widely used in e-cash, e-voting, e-bid and so on. In a designated verifier...
Huge interest and demand on information superhighway have pressed various telecommunications research fronts and lead to a new form of future Internet consisting of wired and wireless segments where resource-constrained devices such as palm pilots and sensors may become integral parts of the Internet rather than access-only platforms. One of the key design problems is the security in such heterogeneous...
Following the idea of Xing et al., we investigate a general method for constructing families of pseudorandom sequences with low correlation and large linear complexity from elliptic curves over finite fields in this correspondence. With the help of the tool of exponential sums on elliptic curves, we study their periods, linear complexities, linear complexity profiles, distributions of r-patterns,...
In this paper, we propose a new efficient identity based proxy signature scheme. Compared with the previously proposed proxy signature schemes, ours combines the properties of proxy signature and the identity based signature, and has much more advantages than the traditional proxy signature schemes without the identity based characteristic. In addition, we also modify the general scheme into an extensive...
This paper presents an extremely efficient, non-interactive protocol for verifiable secret sharing. Verifiable secret sharing (VSS) is a way of bequeathing information to a set of processors such that a quorum of processors is needed to access the information. VSS is a fundamental tool of cryptography and distributed computing. Seemingly difficult problems such as secret bidding, fair voting, leader...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.