Sciweavers

293 search results - page 44 / 59
» Formal Security Analysis with Interacting State Machines
Sort
View
FAC
2007
128views more  FAC 2007»
13 years 7 months ago
Verifying a signature architecture: a comparative case study
Abstract. We report on a case study in applying different formal methods to model and verify an architecture for administrating digital signatures. The architecture comprises seve...
David A. Basin, Hironobu Kuruma, Kunihiko Miyazaki...
POPL
2007
ACM
14 years 7 months ago
Logic-flow analysis of higher-order programs
This work presents a framework for fusing flow analysis and theorem proving called logic-flow analysis (LFA). The framework itthe reduced product of two abstract interpretations: ...
Matthew Might
FSTTCS
2003
Springer
14 years 23 days ago
Tagging Makes Secrecy Decidable with Unbounded Nonces as Well
Tagging schemes have been used in security protocols to ensure that the analysis of such protocols can work with messages of bounded length. When the set of nonces is bounded, this...
Ramaswamy Ramanujam, S. P. Suresh
FGR
2004
IEEE
149views Biometrics» more  FGR 2004»
13 years 11 months ago
Authentic Facial Expression Analysis
It is argued that for the computer to be able to interact with humans, it needs to have the communication skills of humans. One of these skills is the ability to understand the em...
Nicu Sebe, Michael S. Lew, Ira Cohen, Yafei Sun, T...
JOC
2011
104views more  JOC 2011»
12 years 10 months ago
Short Undeniable Signatures Based on Group Homomorphisms
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...
Jean Monnerat, Serge Vaudenay