216 search results - page 5 / 44 » Formal Proofs for the Security of Signcryption |
106
click to vote
CSFW
2012
IEEE
12 years 12 months ago
2012
IEEE
—In this paper, we propose a formal analysis of domain extenders for hash functions in the indifferentiability framework. We define a general model for domain extenders and prov...
CAV
2009
Springer
15 years 10 months ago
2009
Springer
ICICS
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. To be accepted, a cryptographic scheme must come with a proof that it satisfies some standard security properties. However, because cryptographic schemes are based on no...
CSFW
2011
IEEE
13 years 9 months ago
2011
IEEE
—We propose a much-needed formal definition of security for cryptographic key management APIs. The advantages of our definition are that it is general, intuitive, and applicabl...
175
click to vote
POPL
2009
ACM
15 years 10 months ago
2009
ACM
As cryptographic proofs have become essentially unverifiable, cryptographers have argued in favor of developing techniques that help tame the complexity of their proofs. Game-base...