2043 search results - page 191 / 409 » Reasoning About Security Models |
165
click to vote
CRYPTO
2004
Springer
15 years 11 months ago
2004
Springer
Ordinarily, RSA and Rabin ciphertexts and signatures are log N bits, where N is a composite modulus; here, we describe how to “compress” Rabin ciphertexts and signatures (among...
168
Voted
FSE
2004
Springer
15 years 11 months ago
2004
Springer
A cryptanalysis is given of a MAC proposal presented at CRYPTO 2003 by Cary and Venkatesan. A nice feature of the CaryVenkatesan MAC is that a lower bound on its security can be pr...
189
click to vote
CCS
2010
ACM
15 years 6 months ago
2010
ACM
Many cryptographic tasks and protocols, such as non-repudiation, contract-signing, voting, auction, identity-based encryption, and certain forms of secure multi-party computation,...
166
click to vote
TISSEC
2008
15 years 6 months ago
2008
compromised sensor nodes. The framework provides an appropriate abstraction of applicationspecific detection mechanisms and models the unique properties of sensor networks. Based o...
144
Voted
CCS
2010
ACM
16 years 29 days ago
2010
ACM
Many authorization system models include some notion of obligation. Little attention has been given to user obligations that depend on and affect authorizations. However, to be u...