Sciweavers

1059 search results - page 179 / 212
» Modeling Security Protocols as Games
Sort
View
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
ASIACRYPT
2006
Springer
13 years 11 months ago
Simulation-Sound NIZK Proofs for a Practical Language and Constant Size Group Signatures
Non-interactive zero-knowledge proofs play an essential role in many cryptographic protocols. We suggest several NIZK proof systems based on prime order groups with a bilinear map...
Jens Groth
CCS
2009
ACM
14 years 8 months ago
Hidden credential retrieval from a reusable password
We revisit the venerable question of access credentials management, which concerns the techniques that we, humans with limited memory, must employ to safeguard our various access ...
Xavier Boyen
IWCMC
2006
ACM
14 years 1 months ago
System approach to intrusion detection using hidden Markov model
In an era of cooperating ad hoc networks and pervasive wireless connectivity, we are becoming more vulnerable to malicious attacks. Many of these attacks are silent in nature and ...
Rahul Khanna, Huaping Liu
CMSB
2006
Springer
13 years 11 months ago
Probabilistic Model Checking of Complex Biological Pathways
Abstract. Probabilistic model checking is a formal verification technique that has been successfully applied to the analysis of systems from a broad range of domains, including sec...
John Heath, Marta Z. Kwiatkowska, Gethin Norman, D...