Sciweavers

163 search results - page 25 / 33
» Relaxing Chosen-Ciphertext Security
Sort
View
CANS
2008
Springer
126views Cryptology» more  CANS 2008»
13 years 10 months ago
A New Message Recognition Protocol for Ad Hoc Pervasive Networks
We propose a message recognition protocol which is suitable for ad hoc pervasive networks without the use of hash chains. Hence, we no longer require the devices to save values of ...
Atefeh Mashatan, Douglas R. Stinson
ICISC
2003
117views Cryptology» more  ICISC 2003»
13 years 9 months ago
Binary Tree Encryption: Constructions and Applications
Binary tree encryption (BTE), a relaxation of hierarchical identity-based encryption (HIBE), has recently emerged as a useful and intriguing primitive. On the one hand, the defini...
Jonathan Katz
CHES
2006
Springer
131views Cryptology» more  CHES 2006»
13 years 11 months ago
Why One Should Also Secure RSA Public Key Elements
It is well known that a malicious adversary can try to retrieve secret information by inducing a fault during cryptographic operations. Following the work of Seifert on fault induc...
Eric Brier, Benoît Chevallier-Mames, Mathieu...
KDD
2002
ACM
144views Data Mining» more  KDD 2002»
14 years 8 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
TCC
2009
Springer
177views Cryptology» more  TCC 2009»
14 years 8 months ago
Composability and On-Line Deniability of Authentication
Abstract. Protocols for deniable authentication achieve seemingly paradoxical guarantees: upon completion of the protocol the receiver is convinced that the sender authenticated th...
Yevgeniy Dodis, Jonathan Katz, Adam Smith, Shabsi ...