216 search results - page 6 / 44 » Formal Proofs for the Security of Signcryption |
CSFW
2010
IEEE
13 years 11 months ago
2010
IEEE
—Zero-knowledge proofs have a vast applicability in the domain of cryptography, stemming from the fact that they can be used to force potentially malicious parties to abide by th...
CCS
2011
ACM
12 years 7 months ago
2011
ACM
Cloud storage systems are becoming increasingly popular. A promising technology that keeps their cost down is deduplication, which stores only a single copy of repeating data. Cli...
POPL
2006
ACM
14 years 7 months ago
2006
ACM
This paper reports on the development and formal certification (proof of semantic preservation) of a compiler from Cminor (a Clike imperative language) to PowerPC assembly code, u...
FASE
2009
Springer
14 years 2 months ago
2009
Springer
Security automata are a convenient way to describe security policies. Their typical use is to monitor the execution of an application, and to interrupt it as soon as the security p...
ASIACRYPT
2008
Springer
13 years 9 months ago
2008
Springer
The collision-resistance of hash functions is an important foundation of many cryptographic protocols. Formally, collision-resistance can only be expected if the hash function in f...