5084 search results - page 164 / 1017 » Proving Possibility Properties |
164
click to vote
CSFW
2006
IEEE
16 years 12 days ago
2006
IEEE
Secrecy properties can be guaranteed through a combination of static and dynamic checks. The static checks may include the application of special type systems with notions of secr...
173
click to vote
SPAA
2005
ACM
15 years 12 months ago
2005
ACM
We prove that with high probability a skip graph contains a 4-regular expander as a subgraph, and estimate the quality of the expansion via simulations. As a consequence skip grap...
133
click to vote
ACISP
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. In this paper we present a non-transferable anonymous credential system that is based on the concept of a chameleon certificate. A chameleon certificate is a special ce...
177
click to vote
ASPDAC
2009
ACM
15 years 11 months ago
2009
ACM
Iterative retiming and resynthesis is a powerful way to optimize sequential circuits but its massive adoption has been hampered by the hardness of verification. This paper tackle...
160
click to vote
APN
2000
Springer
15 years 10 months ago
2000
Springer
One of the most efficient analysis technique is to reduce an original model into a simpler one such that the reduced model has the same properties than the original one. G. Berthel...