Robust Authenticated Encryption Scheme with Message Linkages

2005 ◽  
pp. 281-288
Author(s):  
Eun-Jun Yoon ◽  
Kee-Young Yoo
Keyword(s):  
Encryption Scheme ◽  
Authenticated Encryption

Improvement of Tseng et al.'s authenticated encryption scheme with message linkages

2005 ◽  
Vol 162 (3) ◽  
pp. 1475-1483 ◽  
Author(s):  
Zhang Zhang ◽  
Shunsuke Araki ◽  
Guozhen Xiao
Keyword(s):  
Encryption Scheme ◽  
Authenticated Encryption

scholarly journals Cryptanalysis of PMACx, PMAC2x, and SIVx

2017 ◽  
pp. 162-176
Author(s):  
Kazuhiko Minematsu ◽  
Tetsu Iwata
Keyword(s):  
Provable Security ◽  
Block Cipher ◽  
Query Complexity ◽  
Block Length ◽  
Encryption Scheme ◽  
Authenticated Encryption ◽  
Pseudorandom Functions ◽  
Tweakable Block Cipher ◽  
Deterministic Authenticated Encryption ◽  
Provably Secure

At CT-RSA 2017, List and Nandi proposed two variable input length pseudorandom functions (VI-PRFs) called PMACx and PMAC2x, and a deterministic authenticated encryption scheme called SIVx. These schemes use a tweakable block cipher (TBC) as the underlying primitive, and are provably secure up to the query complexity of 2n, where n denotes the block length of the TBC. In this paper, we falsify the provable security claims by presenting concrete attacks. We show that with the query complexity of O(2n/2), i.e., with the birthday complexity, PMACx, PMAC2x, and SIVx are all insecure.

AUTHENTICATED ENCRYPTION SCHEME BASED ON PAILLIER SYSTEM WITH VERIFIABLE PUBLIC KEYS

2012 ◽  
Vol 2 (1) ◽  
Author(s):  
Tzong-Sun Wu ◽  
Yih-Sen Chen ◽  
Han-Yu Lin ◽  
Tang-Kai Chang
Keyword(s):  
Encryption Scheme ◽  
Authenticated Encryption ◽  
Public Keys

Security Analysis of Zhang et al. Authenticated Encryption Scheme

2021 ◽  
pp. 60-64
Author(s):  
Mohamed Rasslan ◽  
Mahmoud M. Nasreldin
Keyword(s):  
Security Analysis ◽  
Encryption Scheme ◽  
Authenticated Encryption

scholarly journals A Pairing-Based Three-Party Authenticated Encryption Scheme without Shared Secrets

Symmetry ◽  
2019 ◽  
Vol 11 (5) ◽  
pp. 605
Author(s):  
Han-Yu Lin
Keyword(s):  
Computational Efficiency ◽  
Encryption Scheme ◽  
Authenticated Encryption ◽  
Random Oracles ◽  
Comparison Results ◽  
Communication Environments ◽  
Single User ◽  
Designated Verifier

The Traditional Authenticated Encryption (AE) scheme is a single-user cryptographic mechanism which only enables one designated verifier to authenticate the ciphertext. Although several group-oriented AE variants have also been proposed to eliminate such a limitation, they require shared verification. This motivated us to think of a scenario of three-party communication environments where each party runs independent processes without cooperation. In this paper, we realize a novel three-party AE (abbreviated to TPAE) scheme in which two designated verifiers can solely decrypt the same ciphertext and then inspect the validity of embedded signature. Additionally, we also show that our TPAE construction is computationally secure using the well-defined IND-CCA2 and the EF-CMA adversary games in the proof model of random oracles. The comparison results will demonstrate the computational efficiency of our mechanism.

scholarly journals Lightweight Authenticated-Encryption Scheme for Internet of Things Based on Publish-Subscribe Communication

IEEE Access ◽  
2020 ◽  
Vol 8 ◽  
pp. 60539-60551 ◽  
Author(s):  
Abebe Diro ◽  
Haftu Reda ◽  
Naveen Chilamkurti ◽  
Abdun Mahmood ◽  
Noor Zaman ◽  
...  
Keyword(s):  
Internet Of Things ◽  
Encryption Scheme ◽  
Authenticated Encryption
Sign in / Sign up

Export Citation Format

Share Document