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.
In this paper, we present a two-party key agreement protocol, which is secure in standard model. By using the Goldreich-Levin hardcore predicate, we reduce the security of our scheme to Computational Bilinear Diffie-Hellman assumption, and a proof is given. Furthermore, with the consistency of messages exchanged publicly verifiable, our scheme achieves most of the known security attributes.
Since more sensitive data are stored and shared on third-party sites, we may need a system capable of one-to-many communication and data encryption without knowing specific recipients. However, the traditional public key crypto system and broadcast encryption system can't solve both of the problems at the same time. Attribute-Based Encryption (ABE) offers both of the desired abilities. In this paper,...
In traditional rational multi-party computation, parties are assumed to have utility functions and they act according to the utility assumptions. In economics and political scenarios, parties in multi-party computation may have some other properties such as reputation which plays an important role on boosting mutual cooperation in multiparty computation. In this paper we put forward a new kind of...
The empty threat is not credible, because the actions are taken simultaneously. To eliminate the empty threat, a non-simultaneous channel is used in this paper. Zhifang Zhang \cite{zzf1} proposes a 2-out-of-2 rational secret sharing in extensive form to eliminate the empty threats while she does not consider the cost when neither players broadcast their shares and uses simultaneous channels in $Norm(k)$...
Rational secret sharing, first introduced by Halpern and Teague, means that whether players send their shares relies on their utilities, whereas in traditional scheme, players are assumed to contribute their shares willingly. This paper introduces a new kind of player and puts forward a 2-out-of-2 rational secret sharing scheme where players run their reconstruction protocol in standard communication...
Anonymity of user is an important property in the cryptographic protocol, to protect the privacy of the participants. In this paper, we propose a new primitive, fully anonymous signcryption, which provide anonymity of both sender and receiver along with the advantage of traditional ring signcryption (only provides anonymity of sender) scheme. We also construct a fully anonymous identity-based signcryption...
In this paper, we formalize the notion of identity-based broadcast group-oriented encryption scheme and present a construction for it based on Gentry??s IBE scheme. In our new scheme, the broadcaster could encrypt the message using the designated receive group??s identity and any receiver in the designated group can independently decrypt the ciphertext. The newly proposed scheme has the following...
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.