Alternatives to non-malleability: Definitions, constructions, and applications (extended abstract)

68Citations
Citations of this article
40Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We explore whether non-malleability is necessary for the applications typically used to motivate it, and propose two alternatives. The first we call weak non-malleability (wnm) and show that it suffices to achieve secure contract bidding (the application for which non-malleability was initially introduced), despite being strictly weaker than non-malleability. The second we call tag-based non-malleability (tnm), and show that it suffices to construct an efficient universally-composable secure message transmission (SMT) protocol, for which the only previous solution was based on a public key encryption functionality whose security is equivalent to non-malleability. We also demonstrate constructions for wnm and tnm encryption schemes that are simpler than known constructions of non-malleable encryption schemes. © Springer-Verlag 2004.

Cite

CITATION STYLE

APA

MacKenzie, P., Reiter, M. K., & Yang, K. (2004). Alternatives to non-malleability: Definitions, constructions, and applications (extended abstract). Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2951, 171–190. https://doi.org/10.1007/978-3-540-24638-1_10

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free