A Pairing-Based Three-Party Authenticated Encryption Scheme without Shared Secrets
نویسندگان
چکیده
منابع مشابه
An Efficient Public Key Encryption Scheme Using Shared Secrets
This paper describes the combination of Shamir secret sharing method with the trap door characteristics of discrete logarithm mod a large prime number as employed in the Diffie-Hellman exchange scheme. The purpose of this combination is to protect the privacy of the numbers held by the parties of the shared secret, while at the same time authorizing them to broadcast data in the clear which whe...
متن کاملConvertible authenticated encryption scheme
The digital signature provides the functions of integration, authentication, and non-repudiation for the signing message. In some applications, however, the signature only needs to be verified by some specified recipients while keeping the message secret from the public. The authenticated encryption schemes can be used to achieve this purpose. To protect the recipient’s benefit in the case of a...
متن کاملPairing-Based Two-Party Authenticated Key Agreement Protocol
To achieve secure data communications, two parties should be authenticated by each other and agree on a secret session key by exchanging messages over an insecure channel. In this paper, based on the bilinear pairing, we present a new two-party authenticated key agreement protocol, and use the techniques from provable security to examine the security of our protocol within Bellare-Rogaway model.
متن کاملConvertible Authenticated Encryption Scheme Without Using Conventional One-Way Function
An authenticated encryption allows the designated recipient to verify the authenticity while recovering the message. To protect the recipient’s benefit in case of a later dispute, a convertible authenticated encryption scheme allows the recipient to convert the authenticated encryption into an ordinary signature so that it becomes a publicly verifiable. This paper shows a universal forgery atta...
متن کاملAn Efficient Certificateless Proxy Re-Encryption Scheme Without Pairing
Proxy re-encryption (PRE) is a cryptographic primitive introduced by Blaze, Bleumer and Strauss [4] to provide delegation of decryption rights. PRE allows re-encryption of a ciphertext intended for Alice (delegator) to a ciphertext for Bob (delegatee) via a semi-honest proxy, who should not learn anything about the underlying message. In 2003, Al-Riyami and Patterson introduced the notion of ce...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Symmetry
سال: 2019
ISSN: 2073-8994
DOI: 10.3390/sym11050605