216 search results - page 15 / 44 » Formal Proofs for the Security of Signcryption |
77
Voted
SACMAT
2009
ACM
15 years 4 months ago
2009
ACM
A number of research systems have demonstrated the benefits of accompanying each request with a machine-checkable proof that the request complies with access-control policy — a...
101
click to vote
POST
2012
13 years 5 months ago
2012
Abstract. We formally analyze the family of entity authentication protocols defined by the ISO/IEC 9798 standard and find numerous weaknesses, both old and new, including some th...
101
click to vote
IFIP
2010
Springer
14 years 4 months ago
2010
Springer
Abstract. Task-structured probabilistic input/output automata (taskPIOAs) are concurrent probabilistic automata that, among other things, have been used to provide a formal framewo...
CRYPTO
2000
Springer
15 years 1 months ago
2000
Springer
Partially blind signature schemes are an extension of blind signature schemes that allow a signer to explicitly include necessary information (expiration date, collateral condition...
CCS
2009
ACM
15 years 4 months ago
2009
ACM
We describe CoSP, a general framework for conducting computational soundness proofs of symbolic models and for embedding these proofs into formal calculi. CoSP considers arbitrary...