Sciweavers

123 search results - page 20 / 25
» Modelling the relative strength of security protocols
Sort
View
IDEAL
2005
Springer
14 years 26 days ago
Identification of Anomalous SNMP Situations Using a Cooperative Connectionist Exploratory Projection Pursuit Model
Abstract. The work presented in this paper shows the capability of a connectionist model, based on a statistical technique called Exploratory Projection Pursuit (EPP), to identify ...
Álvaro Herrero, Emilio Corchado, José...
TLCA
2009
Springer
14 years 1 months ago
Lexicographic Path Induction
Abstract. Programming languages theory is full of problems that reduce to proving the consistency of a logic, such as the normalization of typed lambda-calculi, the decidability of...
Jeffrey Sarnat, Carsten Schürmann
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
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
CANS
2009
Springer
120views Cryptology» more  CANS 2009»
14 years 2 months ago
Improved Garbled Circuit Building Blocks and Applications to Auctions and Computing Minima
Abstract. We consider generic Garbled Circuit (GC)-based techniques for Secure Function Evaluation (SFE) in the semi-honest model. We describe efficient GC constructions for additi...
Vladimir Kolesnikov, Ahmad-Reza Sadeghi, Thomas Sc...