Paper 2011/470

Non-malleable public key encryption in BRSIM/UC

István Vajda

Abstract

We propose an extension to the BRSIM/UC library of Backes, Pfitzmann and Waidner [1] with non-malleable public key encryption. We also investigate the requirement of “full randomization” of public key encryption primitives in [1], and show that additional randomization to attain word uniqueness is theoretically not justified.

Metadata
Available format(s)
PDF
Category
Cryptographic protocols
Publication info
Published elsewhere. Unknown where it was published
Keywords
cryptanalysisnon-malleabilityrandomization
Contact author(s)
vajda @ hit bme hu
History
2011-09-06: received
Short URL
https://ia.cr/2011/470
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2011/470,
      author = {István Vajda},
      title = {Non-malleable public key encryption in BRSIM/UC},
      howpublished = {Cryptology ePrint Archive, Paper 2011/470},
      year = {2011},
      note = {\url{https://eprint.iacr.org/2011/470}},
      url = {https://eprint.iacr.org/2011/470}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.