Int. J. Appl. Cryptogr.最新文献

Dynamic MDS diffusion layers with efficient software implementation 动态MDS扩散层与高效的软件实现

Int. J. Appl. Cryptogr. Pub Date : 2020-05-04 DOI: 10.1504/ijact.2020.10029198

M. R. M. Shamsabad, S. M. Dehnavi

引用次数: 3

Computing the optimal ate pairing over elliptic curves with embedding degrees 54 and 48 at the 256-bit security level 在256位安全级别下，计算嵌入度为54和48的椭圆曲线上的最优ate配对

Int. J. Appl. Cryptogr. Pub Date : 2020-05-04 DOI: 10.1504/ijact.2020.10027563

Narcisse Bang Mbiang, Emmanuel Fouotsa, Diego F. Aranha

引用次数: 11

Delegation-based conversion from CPA to CCA-secure predicate encryption 基于委托的从CPA到cca安全谓词加密的转换

Int. J. Appl. Cryptogr. Pub Date : 2020-05-03 DOI: 10.1504/ijact.2020.10029197

M. Nandi, Tapas Pandit

引用次数: 3

A new authenticated encryption technique for handling long ciphertexts in memory constrained devices 在内存受限设备中处理长密文的一种新的身份验证加密技术

Int. J. Appl. Cryptogr. Pub Date : 2017-09-04 DOI: 10.1504/IJACT.2017.10007291

Megha Agrawal, D. Chang, S. K. Sanadhya

{"title":"A new authenticated encryption technique for handling long ciphertexts in memory constrained devices","authors":"Megha Agrawal, D. Chang, S. K. Sanadhya","doi":"10.1504/IJACT.2017.10007291","DOIUrl":"https://doi.org/10.1504/IJACT.2017.10007291","url":null,"abstract":"In authenticated encryption schemes, there are two techniques for handling long ciphertexts while working within the constraints of a low buffer size: releasing unverified plaintext (RUP) or producing intermediate tags (PIT). In this paper, in addition to the two techniques, we propose another way to handle a long ciphertext with a low buffer size by storing and releasing only one (generally, or only few) intermediate state without releasing or storing any part of an unverified plaintext and without need of generating any intermediate tag. In this paper we explain this generalised technique using our new construction sp-AELM. sp-AELM is a sponge-based authenticated encryption scheme that provides support for limited memory devices. We also provide its security proof for privacy and authenticity in an ideal permutation model, using a code-based game playing framework. Furthermore, we also present two more variants of sp-AELM that serve the same purpose and are more efficient than sp-AELM. The ongoing CAESAR competition has nine submissions which are based on the sponge construction. We apply our generalised technique of storing single intermediate state to all these submissions, to determine their suitability with a crypto module having limited memory. Our findings show that only ASCON and one of the PRIMATE's modes (namely GIBBON) satisfy the limited memory constraint using this technique, while the remaining schemes (namely, Artemia, ICEPOLE, Ketje, Keyak, NORX, Π-cipher, STRIBOB and two of the PRIMATEs modes: APE and HANUMAN) are not suitable for this scenario directly.","PeriodicalId":350332,"journal":{"name":"Int. J. Appl. Cryptogr.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116304376","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 6

A new public remote integrity checking scheme with user and data privacy 一种新的具有用户和数据隐私的公共远程完整性检查方案

Int. J. Appl. Cryptogr. Pub Date : 2017-09-04 DOI: 10.1504/IJACT.2017.10007296

Yiteng Feng, Guomin Yang, Joseph K. Liu

{"title":"A new public remote integrity checking scheme with user and data privacy","authors":"Yiteng Feng, Guomin Yang, Joseph K. Liu","doi":"10.1504/IJACT.2017.10007296","DOIUrl":"https://doi.org/10.1504/IJACT.2017.10007296","url":null,"abstract":"With cloud storage, users can store their data files on a remote cloud server with a high quality on-demand cloud service and are able to share their data with other users. Since cloud servers usually are not regarded as fully trusted and the cloud data can be shared amongst users, the integrity checking of the remote files has become an important issue. A number of remote data integrity checking protocols have been proposed in the literature to allow public auditing of cloud data by a third party auditor (TPA). However, user privacy is not taken into account in most of the existing protocols. We believe that preserving the anonymity (i.e., identity privacy) of the data owner is also very important in many applications. In this paper, we propose a new remote integrity checking scheme which allows the cloud server to protect the identity information of the data owner against the TPA. We also define a formal security model to capture the requirement of user anonymity, and prove the anonymity of the proposed scheme. Moreover, we improve the existing security model for data privacy against the TPA, and show that an extended version of our protocol is secure under the strengthened security model.","PeriodicalId":350332,"journal":{"name":"Int. J. Appl. Cryptogr.","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132673561","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 5

Preventing fault attacks using fault randomisation with a case study on AES 利用故障随机化防止故障攻击，并以AES为例进行研究

Int. J. Appl. Cryptogr. Pub Date : 2017-09-04 DOI: 10.1504/IJACT.2017.10007295

S. Ghosh, Dhiman Saha, A. Sengupta, D. R. Chowdhury

引用次数: 5

CCA-secure revocable identity-based encryption schemes with decryption key exposure resistance 具有抗解密密钥暴露的cca安全可撤销的基于身份的加密方案

Int. J. Appl. Cryptogr. Pub Date : 2017-09-04 DOI: 10.1504/IJACT.2017.10007294

Yuu Ishida, Junji Shikata, Yohei Watanabe

{"title":"CCA-secure revocable identity-based encryption schemes with decryption key exposure resistance","authors":"Yuu Ishida, Junji Shikata, Yohei Watanabe","doi":"10.1504/IJACT.2017.10007294","DOIUrl":"https://doi.org/10.1504/IJACT.2017.10007294","url":null,"abstract":"Key revocation functionality is important for identity-based encryption (IBE) to manage users dynamically. Revocable IBE (RIBE) realises such revocation functionality with scalability. In PKC 2013, Seo and Emura first considered decryption key exposure resistance (DKER) as a new realistic threat, and proposed the first RIBE scheme with DKER. Their RIBE scheme is adaptively secure against chosen plaintext attacks (CPA), and there is no concrete RIBE scheme adaptively secure against chosen ciphertext attacks (CCA) even without DKER so far. In this paper, we first propose three constructions of adaptively CCA-secure RIBE schemes with DKER. The first and second schemes are based on an existing transformation, which is called a BCHK transformation, that a CPA-secure hierarchical IBE scheme can be transformed into a CCA-secure scheme. The third scheme is constructed via the KEM/DEM framework. Specifically, we newly propose a revocable identity-based key encapsulation mechanism (RIB-KEM), and we show a generic construction of a CCA-secure RIBE scheme from the RIB-KEM and a data encapsulation mechanism (DEM). The third scheme is more efficient than the first and second ones in terms of the ciphertext size.","PeriodicalId":350332,"journal":{"name":"Int. J. Appl. Cryptogr.","volume":"103 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128508483","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 16

IBE and function-private IBE under linear assumptions with shorter ciphertexts and private keys, and extensions 线性假设下的IBE和功能私有IBE，具有更短的密文和私钥，以及扩展

Int. J. Appl. Cryptogr. Pub Date : 2017-09-04 DOI: 10.1504/IJACT.2017.10007292

K. Kurosawa, L. T. Phong

引用次数: 0

Sponge-based CCA2 secure asymmetric encryption for arbitrary length message (extended version) 针对任意长度消息的基于海绵的CCA2安全非对称加密(扩展版本)

Int. J. Appl. Cryptogr. Pub Date : 2017-09-04 DOI: 10.1504/IJACT.2017.10007290

Tarun Kumar Bansal, D. Chang, S. K. Sanadhya

{"title":"Sponge-based CCA2 secure asymmetric encryption for arbitrary length message (extended version)","authors":"Tarun Kumar Bansal, D. Chang, S. K. Sanadhya","doi":"10.1504/IJACT.2017.10007290","DOIUrl":"https://doi.org/10.1504/IJACT.2017.10007290","url":null,"abstract":"OAEP and other similar schemes, proven secure in random-oracle model, require one or more hash functions with an output size larger than those of the standard hash functions. In this paper, we show that by using the popular Sponge construction in the OAEP framework, we can eliminate the need for such a hash function. We provide a new scheme in the OAEP framework and call our scheme Sponge-based asymmetric encryption padding (SpAEP). The scheme SpAEP is based on two functions: Sponge and SpongeWrap, and requires only standard output sizes proposed and standardised for Sponge functions. Our scheme is CCA2 secure for any trapdoor one-way permutation in the ideal permutation model for arbitrary length messages. Our scheme utilises the versatile Sponge function to enhance the capability and efficiency of the OAEP framework. Prior to this work, the only scheme proven secure in the ideal permutation model was OAEP-3R. However this scheme is not efficient in practice as it utilises a full domain permutation which is hard to find and construct efficiently in practice. Therefore, the author of OAEP-3R provided another version of OAEP-3R but in random oracle model. Our scheme SpAEP utilises the ideal permutation model in a novel manner which makes SpAEP efficient and practical to construct a public key encryption. We also propose a key encapsulation mechanism for hybrid encryption using SpAEP with any trapdoor one-way permutation.","PeriodicalId":350332,"journal":{"name":"Int. J. Appl. Cryptogr.","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129473995","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 1

Prover-Efficient Commit-and-Prove Zero-Knowledge SNARKs 证明高效的提交-证明零知识陷阱

Int. J. Appl. Cryptogr. Pub Date : 2016-04-13 DOI: 10.1007/978-3-319-31517-1_10

H. Lipmaa

引用次数: 32