scholarly journals Universal Forgery Attack Against GCM-RUP

2020 ◽  
pp. 15-34
Author(s):  
Yanbin Li ◽  
Gaëtan Leurent ◽  
Meiqin Wang ◽  
Wei Wang ◽  
Guoyan Zhang ◽  
...  
Keyword(s):  
Forgery Attack

Improved Proofs Of Retrievability And Replication For Data Availability In Cloud Storage

2020 ◽  
Vol 63 (8) ◽  
pp. 1216-1230 ◽  
Author(s):  
Wei Guo ◽  
Sujuan Qin ◽  
Jun Lu ◽  
Fei Gao ◽  
Zhengping Jin ◽  
...  
Keyword(s):  
Service Providers ◽  
Cloud Service ◽  
Data Availability ◽  
Forgery Attack ◽  
Common Strategy ◽  
Comparable Performance ◽  
Replication Scheme ◽  
High Level ◽  
Cloud Users ◽  
Proofs Of Retrievability

Abstract For a high level of data availability and reliability, a common strategy for cloud service providers is to rely on replication, i.e. storing several replicas onto different servers. To provide cloud users with a strong guarantee that all replicas required by them are actually stored, many multi-replica integrity auditing schemes were proposed. However, most existing solutions are not resource economical since users need to create and upload replicas of their files by themselves. A multi-replica solution called Mirror is presented to overcome the problems, but we find that it is vulnerable to storage saving attack, by which a dishonest provider can considerably save storage costs compared to the costs of storing all the replicas honestly—while still can pass any challenge successfully. In addition, we also find that Mirror is easily subject to substitution attack and forgery attack, which pose new security risks for cloud users. To address the problems, we propose some simple yet effective countermeasures and an improved proofs of retrievability and replication scheme, which can resist the aforesaid attacks and maintain the advantages of Mirror, such as economical bandwidth and efficient verification. Experimental results show that our scheme exhibits comparable performance with Mirror while achieving high security.

(t,k,n) Multi-Blind Proxy Signature Scheme on Elliptic Curve

2011 ◽  
Vol 130-134 ◽  
pp. 291-294
Author(s):  
Guang Liang Liu ◽  
Sheng Xian Xie ◽  
Wei Fu
Keyword(s):  
Elliptic Curve ◽  
Secret Sharing ◽  
Proxy Signature ◽  
Elliptic Curve Cryptosystem ◽  
Secret Sharing Scheme ◽  
Signature Scheme ◽  
Forgery Attack ◽  
Threshold Secret Sharing ◽  
Sharing Scheme ◽  
Security Properties

On the elliptic curve cryptosystem proposed a new multi-proxy signature scheme - (t, k, n) threshold blind proxy signature scheme.In new program blind proxy signature and (t,k,n) threshold secret sharing scheme will be combined, and will not over-concentration of the rights of the blind proxy signer .Computation of the program is small, security is high, the achieve efficiency and the utility is better .can prevent a malicious user's forgery attack and have the security properties of proxy signature.

scholarly journals A MAC Forgery Attack on SOBER-128

2004 ◽  
pp. 472-482 ◽  
Author(s):  
Dai Watanabe ◽  
Soichi Furuya
Keyword(s):  
Forgery Attack

scholarly journals Rejection Sampling Revisit: How to Choose Parameters in Lattice-Based Signature

2021 ◽  
Vol 2021 ◽  
pp. 1-12
Author(s):  
Zhongxiang Zheng ◽  
Anyu Wang ◽  
Lingyue Qin
Keyword(s):  
Uniform Distribution ◽  
Sampling Theorem ◽  
New Method ◽  
Security Level ◽  
Rejection Sampling ◽  
Forgery Attack ◽  
Rejection Probability ◽  
Standardization Process ◽  
Security Levels ◽  
Security Bound

Rejection sampling technology is a core tool in the design of lattice-based signatures with ‘Fiat–Shamir with Aborts’ structure, and it is related to signing efficiency and signature, size as well as security. In the rejection sampling theorem proposed by Lyubashevsky, the masking vector of rejection sampling is chosen from discrete Gaussian distribution. However, in practical designs, the masking vector is more likely to be chosen from bounded uniform distribution due to better efficiency and simpler implementation. Besides, as one of the third-round candidate signatures in the NIST postquantum cryptography standardization process, the 3rd round version of CRYSTALS-Dilithium has proposed a new method to decrease the rejection probability in order to achieve better efficiency and smaller signature size by decreasing the number of nonzero coefficients of the challenge polynomial according to the security levels. However, it is seen that small entropies in this new method may lead to higher risk of forgery attack compared with former schemes proposed in its 2nd version. Thus, in this paper, we first analyze the complexity of forgery attack for small entropies and then introduce a new method to decrease the rejection probability without loss of security including the security against forgery attack. This method is achieved by introducing a new rejection sampling theorem with tighter bound by utilizing Rényi divergence where masking vector follows uniform distribution. By observing large gaps between the security claim and actual security bound in CRYSTALS-Dilithium, we propose two series of adapted parameters for CRYSTALS-Dilithium. The first set can improve the efficiency of the signing process in CRYSTALS-Dilithium by factors of 61.7 %  and  41.7 % , according to the security levels, and ensure the security against known attacks, including forgery attack. And, the second set can reduce the signature size by a factor of 14.09 % with small improvements in efficiency at the same security level.

scholarly journals Cryptanalytic Performance Appraisal of Improved CCH2 Proxy Multisignature Scheme

2014 ◽  
Vol 2014 ◽  
pp. 1-13
Author(s):  
Raman Kumar ◽  
Nonika Singla
Keyword(s):  
Elliptic Curve ◽  
Performance Appraisal ◽  
Time Complexity ◽  
Space Complexity ◽  
Elliptic Curve Cryptosystem ◽  
Forgery Attack ◽  
Signature Schemes ◽  
Computational Overhead ◽  
Threshold Schemes

Many of the signature schemes are proposed in which thetout ofnthreshold schemes are deployed, but they still lack the property of security. In this paper, we have discussed implementation of improved CCH1 and improved CCH2 proxy multisignature scheme based on elliptic curve cryptosystem. We have represented time complexity, space complexity, and computational overhead of improved CCH1 and CCH2 proxy multisignature schemes. We have presented cryptanalysis of improved CCH2 proxy multisignature scheme and showed that improved CCH2 scheme suffered from various attacks, that is, forgery attack and framing attack.

Copy-Move Forgery Attack Detection in Digital Images

2015 ◽  
Vol V4 (06) ◽  
Author(s):  
Prinkle Rani ◽  
Jyoti Rani ◽  
Keyword(s):  
Digital Images ◽  
Attack Detection ◽  
Forgery Attack

Forgery attack on the RPC incremental unforgeable encryption scheme

2006 ◽  
Vol 153 (4) ◽  
pp. 143
Author(s):  
C.-C. Wang ◽  
M.-C. Kao ◽  
Y.-S. Yeh
Keyword(s):  
Encryption Scheme ◽  
Forgery Attack

On the Security of the Discrete Logarithm Based Remote Authentication Scheme Using Smart Cards

2013 ◽  
Vol 479-480 ◽  
pp. 963-967
Author(s):  
Yung Cheng Lee ◽  
Pei Ju Lee
Keyword(s):  
Denial Of Service ◽  
Mutual Authentication ◽  
Discrete Logarithm ◽  
Smart Cards ◽  
Authentication Scheme ◽  
Forgery Attack ◽  
Denial Of Service Attack ◽  
Remote Authentication ◽  
Service Attack ◽  
Stolen Verifier Attack

Nowadays, we can easily obtain variety of services through network. But due to the open environment, networks are vulnerable to variety of security threats. Ramasamy et al. proposed a discrete logarithm based remote authentication scheme with smart cards. Their scheme provides mutual authentication and withstanding the denial of service attack, forgery attack, parallel session attack and smart card loss attack. In this article, we show that their scheme is not a practical solution for remote accessing. It also lacks key agreement mechanism; and users cannot update password freely. Moreover, their scheme cannot resist the stolen verifier attack and off-line guessing attack.

Sign in / Sign up

Export Citation Format

Share Document