These articles have been peer-reviewed and accepted for publication but are pending final changes, are not yet published and may not appear here in their final order of publication until they are assigned to issues. Therefore, the content conforms to our standards but the presentation (e.g. typesetting and proof-reading) is not necessarily up to the Inderscience standard. Additionally, titles, authors, abstracts and keywords may change before publication. Articles will not be published until the final proofs are validated by their authors.
Forthcoming articles must be purchased for the purposes of research, teaching and private study only. These articles can be cited using the expression "in press". For example: Smith, J. (in press). Article Title. Journal Title.
Articles marked with this shopping trolley icon are available for purchase - click on the icon to send an email request to purchase.
International Journal of Applied Cryptography (2 papers in press)
Efficient coding for secure computing with additively-homomorphic encrypted data by Thijs Veugen Abstract: A framework is introduced for efficiently computing with encrypted data. We assume a semi-honest security model with two computing parties. Two different coding techniques are used with additively homomorphic encryption, such that many values can be put into one large encryption, and additions and multiplications can be performed on all values simultaneously. For more complicated operations such as comparisons and equality tests, bit-wise secret sharing is proposed as an additional technique that has a low computational and communication complexity, and which allows for precomputing. The framework is shown to significantly improve the computational complexity of state-of-the-art solutions on generic operations such as secure comparisons and secure set intersection. Keywords: packing; batching; homomorphic encryption; secure comparison; secure equality; secure set intersection; vector addition chain.
Delegation-based conversion from CPA- to CCA-secure predicate encryption by Mridul Nandi, Tapas Pandit Abstract: In 2011, Yamada et al. provided the generic delegation-based conversion and verifiability-based conversion from CPA- to CCA-secure attribute-based encryption (ABE). In 2012, Yamada et al. generalised the verifiability-based conversion from ABE (Yamada et al. 2011) to the predicate encryption (PE). In the aforementioned conversions, the decryption algorithm of the target CCA-secure PE scheme runs the decryption of the primitive CPA-secure PE scheme. In addition for verifiability-based conversions, the decryption algorithm of the target CCA-secure PE scheme has to perform the verifiability testing. We observe that for bilinear-pairing-based PE schemes, the cost of the verifiability testing is nearly equal to the cost of the CPA-decryption. So, the cost of CCA-decryption blows up to the double of the cost of CPA-decryption. Therefore, the conversion (CPA to CCA) based on delegation is mostly acceptable whenever the delegation-based conversion is available for the primitive PE scheme. In this paper, we investigate a generic delegation-based conversion from CPA- to CCA-secure predicate encryption schemes. Our conversion generalises the delegation-based conversion of Yamada et al., proposed in 2011, from ABE to PE. We show that our conversion captures many subclasses of PE, i.e., (hierarchical) inner-product encryption, (doubly-)spatial encryption and functional encryption for regular languages. Keywords: Predicate Encryption; Delegation; CPA to CCA Conversion.