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 a society oriented signature scheme, a signature is produced by several co-signers simultaneously in a group. Saeednia proposed an identity-based society oriented signature scheme. However, there are some security weaknesses in the scheme. Zhu and Wang et al. showed two different attacks against the identity-based society oriented signature scheme respectively. In this paper, we proposed an improved...
Password-based authenticated group key exchange protocols allow group users to jointly share a session key based on a human-memorizable password. In this paper, we present an undetectable online dictionary attack on N-EKE-D, a recent provably secure protocol designed to explicitly resist this type of attack. Thus, our result contradicts the design goal. We also give a simple attack on the key indistinguishability...
When humans interact with machines in their daily networks, it is important that security of the communications is offered, and where the involved shared secrets used to achieve this are easily remembered by humans. Password-based authenticated group key exchange (PAGKE) schemes allow group users to share a session key based on a human-memorizable password. In this paper, we consider two PAGKE schemes...
The concept of asymmetric cryptographic algorithms introduced by W. Diffie and M. Hellman in 1976 is considered. The problems of factorization of large integers and finding discrete logarithms for elements of finite large-order groups are presented. It is proved that asymmetric cryptographic algorithms based on the problem of finding a discrete logarithm for points of an elliptic curve over a finite...
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.