scispace - formally typeset
Search or ask a question
JournalISSN: 1753-0563

International Journal of Applied Cryptography 

Inderscience Publishers
About: International Journal of Applied Cryptography is an academic journal published by Inderscience Publishers. The journal publishes majorly in the area(s): Encryption & Cryptography. It has an ISSN identifier of 1753-0563. Over the lifetime, 73 publications have been published receiving 1825 citations.

Papers published on a yearly basis

Papers
More filters
Journal ArticleDOI
TL;DR: It is shown how the proposed protocol for secure comparison of integers based on homomorphic encryption can be used to improve security of online auctions, and that it is efficient enough to be used in practice.
Abstract: We propose a protocol for secure comparison of integers based on homomorphic encryption. We also propose a homomorphic encryption scheme that can be used in our protocol, makes it more efficient than previous solutions, and can also be used as the basis of efficient and general secure Multiparty Computation (MPC). We show how our comparison protocol can be used to improve security of online auctions, and demonstrate that it is efficient enough to be used in practice. For comparison of 16 bits numbers with security based on 1024 bits RSA (executed by two parties), our implementation takes 0.28 sec including all computation and communication. Using precomputation, one can save a factor of roughly 10.

223 citations

Journal ArticleDOI
TL;DR: The use of machine learning techniques are explored to relax parametric assumptions and to deal with high dimensional feature vectors in cryptography.
Abstract: In cryptography, a side-channel attack is any attack based on the analysis of measurements related to the physical implementation of a cryptosystem. Nowadays, the possibility of collecting a large amount of observations paves the way to the adoption of machine learning techniques, i.e., techniques able to extract information and patterns from large datasets. The use of statistical techniques for side-channel attacks is not new. Techniques like the template attack have shown their effectiveness in recent years. However, these techniques rely on parametric assumptions and are often limited to small dimensionality settings, which limit their range of application. This paper explores the use of machine learning techniques to relax such assumptions and to deal with high dimensional feature vectors.

117 citations

Journal ArticleDOI
TL;DR: The number of additional bits required from chosen plain text attack-secure CP-ABE to chosen ciphertext attack- secure CP- ABE is reduced by 90% with respect to that of the previous scheme.
Abstract: An Attribute-Based Encryption (ABE) is an encryption scheme where users with some attributes can decrypt ciphertexts associated with these attributes. The length of the ciphertext depends on the number of attributes in previous ABE schemes. In this paper, we propose a new Ciphertext-Policy Attribute-Based Encryption (CP-ABE) with constant ciphertext length. In our scheme, the number of pairing computations is also constant. In addition, the number of additional bits required from chosen plaintext attack-secure CP-ABE to chosen ciphertext attack-secure CP-ABE is reduced by 90% with respect to that of the previous scheme.

115 citations

Journal ArticleDOI
Qiang Tang1
TL;DR: To mitigate the inherent offline message recovery attacks, the work about public key encryption schemes supporting fine-grained authorisation (FG-PKEET) is extended to a two-proxy setting, where two proxies need to collaborate in order to perform an equality test.
Abstract: In this paper, we extend the work about public key encryption schemes supporting fine-grained authorisation (FG-PKEET), done by Tang (2011b). First of all, we correct some flaws in Tang (2011b) and discuss how to extend the proposed cryptosystem to support approximate equality test. Secondly, we present a comparison between FG-PKEET and other similar primitives including AoN-PKEET by Tang (2011a) and PKEET by Yang et al. (2010), and demonstrate their differences in complexity and achieved security. Thirdly, to mitigate the inherent offline message recovery attacks, we extend FG-PKEET to a two-proxy setting, where two proxies need to collaborate in order to perform an equality test. Finally, we propose a cryptosystem and prove its security in the two-proxy setting.

115 citations

Journal ArticleDOI
TL;DR: A correction to the cryptosystem proposed in Damgard et al. is described, which is necessary, as the Cryptosystem is not secure without it.
Abstract: In this paper, we describe a correction to the cryptosystem proposed in Damgard et al. from Int. J. Applied Cryptography, Vol. 1, No. 1. Although, the correction is small and does not affect the performance of the protocols from Damgard et al., it is necessary, as the cryptosystem is not secure without it.

107 citations

Performance
Metrics
No. of papers from the Journal in previous years
YearPapers
20228
20204
20178
20148
20134
20129