Locating modifications in signed data for partial data integrity

Idalino, Thais Bardini; Moura, Lucia; Custódio, Ricardo Felipe; Panario, Daniel

doi:10.1016/j.ipl.2015.02.014

Cited by 11 publications

(2 citation statements)

References 8 publications

(20 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…rough the above security game model, we get the following security definition of data integrity verification scheme: if a data integrity verification scheme is secure, the probability of winning the above game for any opponent with probability polynomial time is negligible, and this probability is equal to the probability of obtaining all the data by using the message collector [22].…”

Section: Security Model Of Data Integrity Verification Schemementioning

confidence: 99%

Cloud Data Integrity Verification Algorithm for Sustainable Accounting Informatization

Yang

2021

Mathematical Problems in Engineering

View full text Add to dashboard Cite

In recent years, people have paid more and more attention to cloud data. However, because users do not have absolute control over the data stored on the cloud server, it is necessary for the cloud storage server to provide evidence that the data are completely saved to maintain their control over the data. Give users all management rights, users can independently install operating systems and applications and can choose self-service platforms and various remote management tools to manage and control the host according to personal habits. This paper mainly introduces the cloud data integrity verification algorithm of sustainable computing accounting informatization and studies the advantages and disadvantages of the existing data integrity proof mechanism and the new requirements under the cloud storage environment. In this paper, an LBT-based big data integrity proof mechanism is proposed, which introduces a multibranch path tree as the data structure used in the data integrity proof mechanism and proposes a multibranch path structure with rank and data integrity detection algorithm. In this paper, the proposed data integrity verification algorithm and two other integrity verification algorithms are used for simulation experiments. The experimental results show that the proposed scheme is about 10% better than scheme 1 and about 5% better than scheme 2 in computing time of 500 data blocks; in the change of operation data block time, the execution time of scheme 1 and scheme 2 increases with the increase of data blocks. The execution time of the proposed scheme remains unchanged, and the computational cost of the proposed scheme is also better than that of scheme 1 and scheme 2. The scheme in this paper not only can verify the integrity of cloud storage data but also has certain verification advantages, which has a certain significance in the application of big data integrity verification.

show abstract

Section: Security Model Of Data Integrity Verification Schemementioning

confidence: 99%

Cloud Data Integrity Verification Algorithm for Sustainable Accounting Informatization

Yang

2021

Mathematical Problems in Engineering

View full text Add to dashboard Cite

show abstract

“…A d-cover-free family (or d-CFF) indicates how to group the n elements into t groups (t ≤ n), and by performing only t tests we are able to identify up to d defective elements. These families are used to solve several problems in cryptography, such as one-time and multiple-times digital signature schemes [15,25], faulttolerant aggregation of signatures [8,9,24], localization of modifications on signed documents and redactable signatures [10], broadcast authentication [17], broadcast encryption [7], frameproof and traceability codes [18,20], among others [13].…”

Section: Introductionmentioning

confidence: 99%

Embedding cover-free families and cryptographical applications

Idalino¹,

Moura²

2019

Advances in Mathematics of Communications

Self Cite

View full text Add to dashboard Cite

Cover-free families are set systems used as solutions for a large variety of problems, and in particular, problems where we deal with n elements and want to identify d defective ones among them by performing only t tests (t ≤ n). We are especially interested in cryptographic problems, and we note that some of these problems need cover-free families with an increasing size n. Solutions that propose the increase of n, such as monotone families and nested families, have been recently considered in the literature. In this paper, we propose a generalization that we call embedding families, which allows us to increase both n and d. We propose constructions of embedding families using polynomials over finite fields embedded via extension fields; we study how different parameter combinations can be used to prioritize increase of d or of the compression ratio as n grows. We also provide new constructions for monotone families with improved compression ratio. Finally, we show how to use embedded sequences of orthogonal arrays and packing arrays to build embedding families.

show abstract