Formal methods have proved to be very useful for analyzing cryptographic protocols. However, most existing techniques apply to the case of abstract encryption schemes and pairing....
Voter anonymity, also known as unlinkability, is the primary requirement to satisfy privacy in e-voting protocols. Up until now, e-voting protocols have tried to make communicatio...
Motivated by emerging needs in online interactions, we define a new type of digital signature called a `Content Extraction Signature' (CES). A CES allows the owner, Bob, of a...
The strongest standard security notion for digital signature schemes is unforgeability under chosen message attacks. In practice, however, this notion can be insuļ¬cient due to ā...
Sebastian Faust, Eike Kiltz, Krzysztof Pietrzak, G...
Abstract. Formal methods have been extensively applied to the certiļ¬cation of cryptographic protocols. However, most of these works make the perfect cryptography assumption, i.e....