216 search results - page 24 / 44 » Formal Proofs for the Security of Signcryption |
JOC
2011
12 years 10 months ago
2011
This paper is devoted to the design and analysis of short undeniable signatures based on a random oracle. Exploiting their online property, we can achieve signatures with a fully s...
TPHOL
2008
IEEE
14 years 1 months ago
2008
IEEE
g to the well-known “LCF approach” of secure inferences as abstract datatype constructors in ML [16]; explicit proof terms are also available [8]. Isabelle/Isar provides sophis...
ASIAN
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. This paper is concerned about relating formal and computational models of cryptography in case of active adversaries when formal security analysis is done with first ord...
SP
2008
IEEE
13 years 6 months ago
2008
IEEE
e an abstraction of zero-knowledge protocols that is le to a fully mechanized analysis. The abstraction is formalized within the applied pi-calculus using a novel equational theor...
ACSAC
2001
IEEE
13 years 11 months ago
2001
IEEE
According to one common view, information security comes down to technical measures. Given better access control policy models, formal proofs of cryptographic protocols, approved ...