216 search results - page 31 / 44 » Formal Proofs for the Security of Signcryption |
DCC
2008
IEEE
14 years 7 months ago
2008
IEEE
In this paper, we formally prove that padding the plaintext with a random bit-string provides the semantic security against chosen plaintext attack (IND-CPA) for the McEliece (and ...
EUROCRYPT
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. We give a provable-security treatment for the key-wrap problem, providing definitions, constructions, and proofs. We suggest that key-wrap's goal is security in the ...
ESORICS
2007
Springer
13 years 11 months ago
2007
Springer
We present a new technique for generating a formal proof that an access request satisfies accesscontrol policy, for use in logic-based access-control frameworks. Our approach is t...
ASIACRYPT
2006
Springer
13 years 11 months ago
2006
Springer
Understanding what construction strategy has a chance to be a good hash function is extremely important nowadays. In TCC'04, Maurer et al. [13] introduced the notion of indiff...
CCS
2005
ACM
14 years 1 months ago
2005
ACM
This paper introduces the PeerAccess framework for reasoning about authorization in open distributed systems, and shows how a parameterization of the framework can be used to reas...