Sciweavers

252 search results - page 43 / 51
» How Secure is Deterministic Encryption
Sort
View
JSAC
2006
155views more  JSAC 2006»
13 years 7 months ago
LR-AKE-Based AAA for Network Mobility (NEMO) Over Wireless Links
Network mobility introduces far more complexity than host mobility. Therefore, host mobility protocols such as Mobile IPv6 (MIPv6) need to be extended to support this new type of m...
Hanane Fathi, SeongHan Shin, Kazukuni Kobara, Shya...
CCS
2011
ACM
12 years 7 months ago
Automated black-box detection of side-channel vulnerabilities in web applications
Web applications divide their state between the client and the server. The frequent and highly dynamic client-server communication that is characteristic of modern web application...
Peter Chapman, David Evans
CCS
2010
ACM
13 years 7 months ago
Modeling attacks on physical unclonable functions
We show in this paper how several proposed Physical Unclonable Functions (PUFs) can be broken by numerical modeling attacks. Given a set of challenge-response pairs (CRPs) of a PU...
Ulrich Rührmair, Frank Sehnke, Jan Sölte...
PROVSEC
2009
Springer
14 years 5 days ago
Oracle Separation in the Non-uniform Model
Abstract. Oracle separation methods are used in cryptography to rule out blackbox reductions between cryptographic primitives. It is sufficient to find an oracle relative to whic...
Ahto Buldas, Sven Laur, Margus Niitsoo
CCS
2001
ACM
13 years 11 months ago
Efficient State Updates for Key Management
Encryption is widely used to enforce usage rules for digital content. In many scenarios content is encrypted using a group key which is known to a group of users that are allowed ...
Benny Pinkas