Sciweavers

67 search results - page 8 / 14
» Strengthened Security for Blind Signatures
Sort
View
PPDP
2005
Springer
14 years 28 days ago
A resolution strategy for verifying cryptographic protocols with CBC encryption and blind signatures
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....
Véronique Cortier, Michaël Rusinowitch...
IEEEARES
2007
IEEE
14 years 1 months ago
Pseudo-Voter Identity (PVID) Scheme for e-Voting Protocols
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...
Orhan Cetinkaya, Ali Doganaksoy
ICISC
2001
162views Cryptology» more  ICISC 2001»
13 years 8 months ago
Content Extraction Signatures
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...
Ron Steinfeld, Laurence Bull, Yuliang Zheng
TCC
2010
Springer
324views Cryptology» more  TCC 2010»
14 years 4 months ago
Leakage-Resilient Signatures
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...
ESORICS
2005
Springer
14 years 1 months ago
Machine-Checked Security Proofs of Cryptographic Signature Schemes
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....
Sabrina Tarento