A NEW SECURITY PROOF FOR FMNV CONTINUOUS NON-MALLEABLE ENCODING SCHEME

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

MORTAZAVI AMIR S.; SALMASIZADEH MAHMOUD; DANESHGAR AMIR

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: THE ISC INTERNATIONAL JOURNAL OF INFORMATION SECURITY Year:2017 | Volume:9 | Issue:1 Page(s): 41-51

Download Full-Text

Persian Verion

View:

497

Download:

138

Cites:

Information Journal Paper

Title

A NEW SECURITY PROOF FOR FMNV CONTINUOUS NON-MALLEABLE ENCODING SCHEME

Author(s)

MORTAZAVI AMIR S. | SALMASIZADEH MAHMOUD | DANESHGAR AMIR | Issue Writer Certificate

Keywords

NON-MALLEABLEQ1

CONTINUOUS NON-MALLEABILITYQ1

TAMPER-RESILIENT CRYPTOGRAPHYQ1

LEAKAGE-RESILIENTQ1

Abstract

A NON-MALLEABLE code is a variant of an encoding scheme which is resilient to tampering attacks. The main idea behind NON-MALLEABLE coding is that the adversary should not be able to obtain any valuable information about the message. NON-MALLEABLE codes are used in TAMPER-RESILIENT CRYPTOGRAPHY and protecting memories against tampering attacks. Many di erent types of non-malleability have already been formalized and defined in current literature, among which CONTINUOUS NON-MALLEABILITY is the setup in which the messages are protected against adversaries who may issue polynomially many tampering queries. The first continuous NON-MALLEABLE encoding scheme has been proposed by Faustet al. (FMNV) in 2014. In this article, we propose a new proof ofcontinuous non-malleability of the FMNV scheme. The new proof will give rise to an improved andmore efficient version of this scheme.Also, the new proof shows that one may achieve CONTINUOUS NON-MALLEABILITY of the same security by using aleakage resilient storage scheme with fewer bits for the leakage bound. This shows that the new scheme is more efficient and practical for tamper-resilient applications.

Cites

No record.

References

No record.

Cite

APA: Copy

MORTAZAVI, AMIR S., SALMASIZADEH, MAHMOUD, & DANESHGAR, AMIR. (2017). A NEW SECURITY PROOF FOR FMNV CONTINUOUS NON-MALLEABLE ENCODING SCHEME. THE ISC INTERNATIONAL JOURNAL OF INFORMATION SECURITY, 9(1 ), 41-51. SID. https://sid.ir/paper/241786/en

Vancouver: Copy

MORTAZAVI AMIR S., SALMASIZADEH MAHMOUD, DANESHGAR AMIR. A NEW SECURITY PROOF FOR FMNV CONTINUOUS NON-MALLEABLE ENCODING SCHEME. THE ISC INTERNATIONAL JOURNAL OF INFORMATION SECURITY[Internet]. 2017;9(1 ):41-51. Available from: https://sid.ir/paper/241786/en

IEEE: Copy

AMIR S. MORTAZAVI, MAHMOUD SALMASIZADEH, and AMIR DANESHGAR, “A NEW SECURITY PROOF FOR FMNV CONTINUOUS NON-MALLEABLE ENCODING SCHEME,” THE ISC INTERNATIONAL JOURNAL OF INFORMATION SECURITY, vol. 9, no. 1 , pp. 41–51, 2017, [Online]. Available: https://sid.ir/paper/241786/en

Related Journal Papers