Skip to main content

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

Publication ,  Journal Article
MacKenzie, P; Reiter, MK; Yang, K
Published in: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
January 1, 2004

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.

Duke Scholars

Published In

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

DOI

EISSN

1611-3349

ISSN

0302-9743

Publication Date

January 1, 2004

Volume

2951

Start / End Page

171 / 190

Related Subject Headings

  • Artificial Intelligence & Image Processing
  • 46 Information and computing sciences
 

Citation

APA
Chicago
ICMJE
MLA
NLM
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
MacKenzie, P., M. K. Reiter, and K. Yang. “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 (January 1, 2004): 171–90. https://doi.org/10.1007/978-3-540-24638-1_10.
MacKenzie P, Reiter MK, Yang K. 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). 2004 Jan 1;2951:171–90.
MacKenzie, P., et al. “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), vol. 2951, Jan. 2004, pp. 171–90. Scopus, doi:10.1007/978-3-540-24638-1_10.
MacKenzie P, Reiter MK, Yang K. 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). 2004 Jan 1;2951:171–190.

Published In

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

DOI

EISSN

1611-3349

ISSN

0302-9743

Publication Date

January 1, 2004

Volume

2951

Start / End Page

171 / 190

Related Subject Headings

  • Artificial Intelligence & Image Processing
  • 46 Information and computing sciences