scispace - formally typeset
Search or ask a question
Topic

Authenticated encryption

About: Authenticated encryption is a research topic. Over the lifetime, 1328 publications have been published within this topic receiving 25968 citations. The topic is also known as: AEAD & Authenticated Encryption with Associated Data.


Papers
More filters
Patent
Young-Taek Cho1
20 Aug 2009
TL;DR: In this article, the security printing method of the image forming system may include receiving print data in an image forming apparatus, determining whether the received print data includes an authenticated encryption code, and if it is determined that the print data does not include the authenticated encryption codes, forming an image to include an image.
Abstract: An image forming system and a security printing method of the image forming system. The security printing method of the image forming system may include receiving print data in an image forming apparatus, determining whether the received print data includes an authenticated encryption code, and if it is determined that the print data does not include the authenticated encryption code, forming an image to include an image to indicate that the print may not be a print by security print. The security printing method have an advantage of performing a print operation to print data authenticated by a host device with no security application or even in print performance by Direct Printing, with strengthened security.

3 citations

Posted Content
TL;DR: This paper presents several issues of the RCB block cipher mode and results show that RCB fails to provide authenticity, even in the absence of leakage.
Abstract: Leakage-resilient cryptography is about security in the presence of leakage from side-channels. In this paper, we present several issues of the RCB block cipher mode. Agrawal et al [2] proposed recently RCB as a leakage-resilient authenticated encryption (AE) scheme. Our main result is that RCB fails to provide authenticity, even in the absence of leakage.

3 citations

Book ChapterDOI
S Rajashree1, R. Sukumar1
01 Jan 2022
TL;DR: This chapter proposes an authenticated encryption mechanism to securely communicate home automation data to the destination which can be validated and decrypted to get back the original message ensuring no tampering of data has occurred while communicating the data.
Abstract: IoT makes use of individual entities that are interconnected with one another and have pre-programmed components to respond to variations. One part of smart cities is the smart home. The automation of the smart home requires all components like lights, fans, refrigerators, or any other appliances to work remotely which requires data to be sent to remote users accurately and securely. The sensors required in a smart home include a gas sensor, temperature sensor, passive infrared sensor, and some alarm system in case of emergency. All these sensors produce enormous amounts of timestamped data that needs to be sent through insecure channel internet to reach to the destined remote account that can handle the situation and can take necessary action depending on values sent by these sensors. This chapter proposes an authenticated encryption mechanism to securely communicate home automation data to the destination which can be validated and decrypted to get back the original message ensuring no tampering of data has occurred while communicating the data. For the purpose of simplicity, this chapter considers data from gas sensor, temperature sensor, buzzer, and passive infrared sensor.

3 citations

Journal ArticleDOI
TL;DR: A new SSE scheme with multi-data-owner functionalities that provides identity-concealment, authentication of data user to server and confidentiality of search token, which reaches almost the same level of efficiency as Sun et al.
Abstract: Based on Sun et al. ’s multi-client symmetric searchable encryption (SSE) scheme (at ESORICS 2016), and combining Zhao’s identity-concealed authenticated encryption (CCS 2016), a new SSE scheme with multi-data-owner functionalities is proposed. By setting two key generation centers, our scheme first implements multi-data-owner SSE. In particular, compared with Sun et al. ’s scheme, the new scheme not only meets the same security requirements stated by them, but also further strengthens the securities of the same category relevant scheme by providing identity-concealment, authentication of data user to server and confidentiality of search token. The identity-concealment aims to provide privacy protection (Forward ID-Privacy) for data users by hiding their identity information, while the authentication is to resist the camouflage attack by applying certificate-based mechanism to our scheme. In particular, the confidentiality of the search token provides replay-attack-resistant by encrypting the plaintext search token generated by data user. While in other works, the adversary can employ the previously generated plaintext search tokens to force the server to perform the same search queries. Furthermore, by efficiency analysis, our scheme reaches almost the same level of efficiency as Sun et al. ’s scheme.

3 citations

Proceedings ArticleDOI
01 May 2017
TL;DR: The aim of the paper is providing resistance of the deniable encryption protocols to coercive attacks at which coercer has possibility to cause repeated encryption of the same input messages and/or to estimate the duration of the decryption procedure performed for disclosing the secret message.
Abstract: The aim of the paper is providing resistance of the deniable encryption protocols to coercive attacks at which coercer has possibility to cause repeated encryption of the same input messages and/or to estimate the duration of the decryption procedure performed for disclosing the secret message. It is used the method of randomizing the encryption process and the same decryption algorithm is specified to disclose both the secret and the fake messages. There are introduced randomized pseudo-probabilistic block algorithms for deniable encryption which are implemented as probabilistic simultaneous encryption of the fake and secret message. The proposed algorithms include encryption of the secret message block and the fake message block followed by a randomized mapping the pair of intermediate ciphertext blocks into a single block of the output ciphertext. The mapping procedure represents solving the system of three linear congruencies.

3 citations


Network Information
Related Topics (5)
Public-key cryptography
27.2K papers, 547.7K citations
90% related
Cryptography
37.3K papers, 854.5K citations
89% related
Encryption
98.3K papers, 1.4M citations
86% related
Hash function
31.5K papers, 538.5K citations
84% related
Authentication
74.7K papers, 867.1K citations
83% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
202319
202252
202167
2020109
2019111
201897