Sciweavers

20175 search results - page 159 / 4035
» Is abstraction the key to computing
Sort
View
82
Voted
CSFW
2007
IEEE
15 years 7 months ago
A Formal Theory of Key Conjuring
Key conjuring is the process by which an attacker obtains an unknown, encrypted key by repeatedly calling a cryptographic API function with random values in place of keys. We prop...
Véronique Cortier, Stéphanie Delaune...
103
Voted
CHI
2006
ACM
16 years 1 months ago
Few-key text entry revisited: mnemonic gestures on four keys
We present a new 4-key text entry method that, unlike most few-key methods, is gestural instead of selection-based. Importantly, its gestures mimic the writing of Roman letters fo...
Jacob O. Wobbrock, Brad A. Myers, Brandon Rothrock
ICNP
2003
IEEE
15 years 6 months ago
Establishing Pairwise Keys for Secure Communication in Ad Hoc Networks: A Probabilistic Approach
A prerequisite for secure communication between two nodes in an ad hoc network is that the nodes share a key to bootstrap their trust relationship. In this paper, we present a sca...
Sencun Zhu, Shouhuai Xu, Sanjeev Setia, Sushil Jaj...
113
Voted
AINA
2004
IEEE
15 years 4 months ago
Supervising Secret-Key Agreements in a Level-Based Hierarchy
A key agreement protocol is utilized in a network system such that two users are able to establish a commonly shared secret key. Entities within the same security level can commun...
Ching-Te Wang, Chu-Hsing Lin, Chin-Chen Chang
TCS
2008
15 years 29 days ago
New constructions for provably-secure time-bound hierarchical key assignment schemes
A time-bound hierarchical key assignment scheme is a method to assign time-dependent encryption keys to a set of classes in a partially ordered hierarchy, in such a way that each ...
Alfredo De Santis, Anna Lisa Ferrara, Barbara Masu...