The Internet enables concurrent executions of cryptographic protocols. This concurrent setting, however, also brings forth new types of coordinated attacks in which an adversary controls many parties, interleaving the executions of the various protocol instances, and attempts to “maul” messages from one execution to use in another. In this talk, we will survey some recent methods for achieving concurrent security without relying on any trusted-set up (such as e.g., Common Reference Strings).
CITATION STYLE
Pass, R. (2011). Concurrent security and non-malleability. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 6597 LNCS, 540. https://doi.org/10.1007/978-3-642-19571-6_32
Mendeley helps you to discover research relevant for your work.