Sciweavers

621 search results - page 73 / 125
» Efficient Secure Multi-party Computation
Sort
View
PODC
2009
ACM
14 years 11 months ago
Simple and efficient asynchronous byzantine agreement with optimal resilience
Consider a completely asynchronous network consisting of n parties where every two parties are connected by a private channel. An adversary At with unbounded computing power activ...
Arpita Patra, Ashish Choudhary, C. Pandu Rangan
KDD
2002
ACM
144views Data Mining» more  KDD 2002»
14 years 11 months ago
ADMIT: anomaly-based data mining for intrusions
Security of computer systems is essential to their acceptance and utility. Computer security analysts use intrusion detection systems to assist them in maintaining computer system...
Karlton Sequeira, Mohammed Javeed Zaki
CTRSA
2007
Springer
93views Cryptology» more  CTRSA 2007»
14 years 3 months ago
Human Identification Through Image Evaluation Using Secret Predicates
Abstract. The task of developing protocols for humans to securely authenticate themselves to a remote server has been an interesting topic in cryptography as a replacement for the ...
Hassan Jameel, Riaz Ahmed Shaikh, Heejo Lee, Sungy...
IEEEARES
2006
IEEE
14 years 5 months ago
Modeling Dependable Systems using Hybrid Bayesian Networks
A hybrid Bayesian Network (BN) is one that incorporates both discrete and continuous nodes. In our extensive applications of BNs for system dependability assessment the models are...
Martin Neil, Manesh Tailor, Norman E. Fenton, Davi...
PERCOM
2008
ACM
14 years 10 months ago
A tamper-proof and lightweight authentication scheme
We present a tamper-proof and lightweight challenge-response authentication scheme based on 2-level noisy Physically Unclonable Functions (PUF). We present a security reduction, w...
Ghaith Hammouri, Erdinç Öztürk, Berk Sunar