3115 search results - page 312 / 623 » Synthesizing Secure Protocols |
180
click to vote
EUROCRYPT
2010
Springer
15 years 11 months ago
2010
Springer
We present a constant-round non-malleable commitment scheme based on the existence of sub-exponential one-way functions and using a blackbox proof of security. As far as we know, t...
126
click to vote
DSN
2004
IEEE
15 years 10 months ago
2004
IEEE
This paper describes the support provided for mobility and fault tolerance in Mykil, which is a key distribution protocol for large, secure group multicast. Mykil is based on a com...
181
click to vote
EUROCRYPT
2000
Springer
15 years 10 months ago
2000
Springer
We show that although unconditionally secure quantum bit commitment is impossible, it can be based upon any family of quantum one-way permutations. The resulting scheme is uncondit...
185
click to vote
ISSE
2010
15 years 1 months ago
2010
In this work, we address the formalisation of symmetric nets, a subclass of coloured Petri nets, refinement in COQ. We first provide a formalisation of the net models, and of thei...
196
click to vote
NORDSEC
2009
Springer
16 years 1 months ago
2009
Springer
Runtime enforcement is a common mechanism for ensuring that program executions adhere to constraints specified by a security policy. It is based on two simple ideas: the enforceme...