International Journal of Applied Cryptography最新文献

Efficient revocable identity-based encryption with equality test 具有等式检验的高效可撤销的基于身份的加密

International Journal of Applied Cryptography Pub Date : 2023-01-01 DOI: 10.1504/ijact.2023.10060444

Jiaojiao Du, Sha Ma, Tian Yang, Qiong Huang

引用次数: 0

Image and object encryption using multiplicative cipher and K-means clustering algorithm 使用乘法密码和K-means聚类算法的图像和对象加密

International Journal of Applied Cryptography Pub Date : 2023-01-01 DOI: 10.1504/ijact.2023.10060005

Maroti Deshmukh, Arjun Rawat

引用次数: 0

Hashing into Hessian curves 散列成黑森曲线

International Journal of Applied Cryptography Pub Date : 2011-07-05 DOI: 10.1504/IJACT.2014.062737

R. R. Farashahi

引用次数: 36

A framework for universally composable non-committing blind signatures 用于普遍可组合的非提交盲签名的框架

International Journal of Applied Cryptography Pub Date : 2009-12-02 DOI: 10.1504/IJACT.2012.045581

Masayuki Abe, Miyako Ohkubo

引用次数: 48

Fair threshold decryption with semi-trusted third parties 与半信任的第三方进行公平阈值解密

International Journal of Applied Cryptography Pub Date : 2009-06-22 DOI: 10.1504/IJACT.2010.038307

Jeongdae Hong, Jinil Kim, Jihye Kim, M. Franklin, Kunsoo Park

引用次数: 3

A ciphertext-policy attribute-based encryption scheme with constant ciphertext length 一种基于密文策略属性的加密方案，密文长度恒定

International Journal of Applied Cryptography Pub Date : 2009-04-02 DOI: 10.1504/IJACT.2010.033798

K. Emura, A. Miyaji, Kazumasa Omote, Akito Nomura, Masakazu Soshi

引用次数: 316

Strongly unforgeable ID-based signatures without random oracles 强不可伪造的基于id的签名，没有随机的预言

International Journal of Applied Cryptography Pub Date : 2009-04-02 DOI: 10.1504/IJACT.2010.033797

Chifumi Sato, T. Okamoto, E. Okamoto

引用次数: 19

Defending against the pirate evolution attack 防御海盗进化攻击

International Journal of Applied Cryptography Pub Date : 2009-04-02 DOI: 10.1504/IJACT.2010.033796

Hongxia Jin, J. Lotspiech, Serdar Pehlivanoglu

{"title":"Defending against the pirate evolution attack","authors":"Hongxia Jin, J. Lotspiech, Serdar Pehlivanoglu","doi":"10.1504/IJACT.2010.033796","DOIUrl":"https://doi.org/10.1504/IJACT.2010.033796","url":null,"abstract":"A trace and revoke scheme is an encryption scheme for secure content distribution so that only authorized users can access the copyrighted content. When a clone device is recovered, the \"trace\" component detects the pirate users that have compromised the secret keys in their devices and participated in the construction of the clone device. The \"revoke\" component excludes the pirate users from accessing the future content. The state-of-art trace-revoke scheme is the very efficient subset difference based NNL scheme [11] which is also deployed in AACS [1], the industry new content protection standard for high definition DVDs. While its revocation and tracing are both very efficient, as pointed out by Kiayias and Pehlivanoglu from Crypto 2007, in its deployment NNL scheme may suffer from a new attack called pirate evolution attack . In this attack attackers reveal the compromised secret keys to the clone decoder very slowly through a number of generations of pirate decoders that will take long time to disable them all. They showed in a system with N users, the attacker can produce up to t *logN generations of pirate decoders given t sets of keys. In AACS context, that means a pirate can produce more than 300 generations of decoders by compromising only 10 devices. If this happens, it will indeed be a nightmare. \u0000 \u0000In this paper we are interested in practical solutions that can defend well against the pirate evolution attack in practice. In particular we devise an easy and efficient approach for the subset difference based NNL scheme [11] to defend well against the potential pirate evolution attack. Indeed it takes as small as 2 generations to detect and disable a traitor in a coalition. This can be achieved by only negligibly increasing the cipher text header size in an application like AACS. The simplicity, efficiency and practicality of our approach has made AACS to adopt it to defend against the pirate evolution attack.","PeriodicalId":53552,"journal":{"name":"International Journal of Applied Cryptography","volume":"2 1","pages":"147-158"},"PeriodicalIF":0.0,"publicationDate":"2009-04-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78354474","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

Perfectly reliable and secure message transmission tolerating mobile adversary 完全可靠和安全的消息传输容忍移动对手

International Journal of Applied Cryptography Pub Date : 2008-07-07 DOI: 10.1504/IJACT.2009.023467

A. Patra, Ashish Choudhury, C. Rangan, K. Srinathan, P. Raghavendra

{"title":"Perfectly reliable and secure message transmission tolerating mobile adversary","authors":"A. Patra, Ashish Choudhury, C. Rangan, K. Srinathan, P. Raghavendra","doi":"10.1504/IJACT.2009.023467","DOIUrl":"https://doi.org/10.1504/IJACT.2009.023467","url":null,"abstract":"In this paper, we study the problem of Perfectly Reliable Message Transmission(PRMT) and Perfectly Secure Message Transmission(PSMT) between two nodes S and R in an undirected synchronous network, a part of which is under the influence of an all powerful mobile Byzantineadversary. We design a threephase bit optimalPSMT protocol tolerating mobile adversary, whose communication complexity matches the existing lower bound on the communication complexity of any multi phase PSMT protocol, tolerating mobile adversary. This significantly reduces the phase complexity of the existing O(t) phase bit optimal PSMT protocol tolerating mobile adversary, where tdenotes the number of nodes corrupted by the mobile adversary. Furthermore, we design a three phase bit optimalPRMT protocol which achieves reliability with constant factoroverhead against a mobile adversary. These are the firstever constant phase bit optimalPRMT and PSMT protocols against mobile Byzantine adversary. We also characterize PSMT protocols in directednetworks tolerating mobile adversary. Finally, we derive tight bound on the number of rounds required to achieve reliable communication from S to R tolerating a mobile adversary with arbitrary roaming speed.Finally, we show how our constant phase PRMT and PSMT protocols can be adapted to design round optimaland bit optimalPRMT and PSMT protocols, provided the network is given as collection of vertex disjoint paths.","PeriodicalId":53552,"journal":{"name":"International Journal of Applied Cryptography","volume":"3 1","pages":"170-186"},"PeriodicalIF":0.0,"publicationDate":"2008-07-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73332671","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}

引用次数: 10

The layered games framework for specifications and analysis of security protocols 该分层游戏框架用于规范和分析安全协议

International Journal of Applied Cryptography Pub Date : 2008-03-19 DOI: 10.1504/IJACT.2008.021087

A. Herzberg, I. Yoffe

{"title":"The layered games framework for specifications and analysis of security protocols","authors":"A. Herzberg, I. Yoffe","doi":"10.1504/IJACT.2008.021087","DOIUrl":"https://doi.org/10.1504/IJACT.2008.021087","url":null,"abstract":"The layered games framework provides a solid foundation to the accepted methodology of building complex distributed systems, as a 'stack' of independently-developed protocols. Each protocol in the stack, realizes a corresponding 'layer' model, over the 'lower layer'. We define layers, protocols and related concepts. We then prove the fundamental lemma of layering. The lemma shows that given a stack of protocols {πi}i=1u, s.t. for every i ∈ {1,...u}, protocol πi realizes layer Li over layer Li-1, then the entire stack can be composed to a single protocol πu||...||1, which realizes layer Lu over layer L0. \u0000 \u0000The fundamental lemma of layering allows precise specification, design and analysis of each layer independently, and combining the results to ensure properties of the complete system. This is especially useful when considering (computationally-bounded) adversarial environments, as for security and cryptographic protocols. \u0000 \u0000Our specifications are based on games, following many works in applied cryptography. This differs from existing frameworks allowing compositions of cryptographic protocols, which are based on simulatability of ideal functionality.","PeriodicalId":53552,"journal":{"name":"International Journal of Applied Cryptography","volume":"35 1","pages":"125-141"},"PeriodicalIF":0.0,"publicationDate":"2008-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85357434","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}

引用次数: 8