405 search results - page 35 / 81 » Practice-Oriented Provable Security |
ASIACRYPT
2000
Springer
15 years 3 months ago
2000
Springer
A common practice for signing with RSA is to first apply a hash function or a redundancy function to the message, add some padding and exponentiate the resulting padded message us...
101
click to vote
CCS
1998
ACM
15 years 3 months ago
1998
ACM
Many modern computing environments involve dynamic peer groups. Distributed simulation, multi-user games, conferencing and replicated servers are just a few examples. Given the op...
FSE
1997
Springer
15 years 2 months ago
1997
Springer
Feistel ciphers are very common and very important in the design and analysis of blockciphers, especially due to four reasons: (1) Many (DES-like) ciphers are based on Feistel’s ...
CSFW
2010
IEEE
15 years 2 months ago
2010
IEEE
—We establish formal bounds for the number of min-entropy bits that can be extracted in a timing attack against a cryptosystem that is protected by blinding, the state-of-the art...
CTRSA
2006
Springer
15 years 2 months ago
2006
Springer
Abstract. In this paper, we first demonstrate a gap between the security of verifiably committed signatures in the two-party setting and the security of verifiably committed signat...