A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2007; you can also visit the original URL.
The file type is application/pdf
.
Soundness of Formal Encryption in the Presence of Key-Cycles
[chapter]
2005
Lecture Notes in Computer Science
Both the formal and the computational models of cryptography contain the notion of message equivalence or indistinguishability. An encryption scheme provides soundness for indistinguishability if, when mapping formal messages into the computational model, equivalent formal messages are mapped to indistinguishable computational distributions. Previous soundness results are limited in that they do not apply when key-cycles are present. We demonstrate that an encryption scheme provides soundness
doi:10.1007/11555827_22
fatcat:uq7a3froj5cjtjtnftbvwhkkjq