Sciweavers

2028 search results - page 10 / 406
» Deriving Relation Keys from XML Keys
Sort
View
155
Voted
SACRYPT
2009
Springer
212views Cryptology» more  SACRYPT 2009»
15 years 10 months ago
Compact McEliece Keys from Goppa Codes
The classical McEliece cryptosystem is built upon the class of Goppa codes, which remains secure to this date in contrast to many other families of codes but leads to very large pu...
Rafael Misoczki, Paulo S. L. M. Barreto
128
Voted
IACR
2011
73views more  IACR 2011»
14 years 3 months ago
Secure Authentication from a Weak Key, Without Leaking Information
We study the problem of authentication based on a weak key in the information-theoretic setting. A key is weak if its min-entropy is an arbitrary small fraction of its bit length. ...
Niek J. Bouman, Serge Fehr
171
Voted
WISEC
2010
ACM
15 years 8 months ago
Secret keys from entangled sensor motes: implementation and analysis
Key management in wireless sensor networks does not only face typical, but also several new challenges. The scale, resource limitations, and new threats such as node capture and c...
Matthias Wilhelm, Ivan Martinovic, Jens B. Schmitt
125
Voted
IS
2006
15 years 3 months ago
The Michigan benchmark: towards XML query performance diagnostics
We propose a micro-benchmark for XML data management to aid engineers in designing improved XML processing engines. This benchmark is inherently different from application-level b...
Kanda Runapongsa, Jignesh M. Patel, H. V. Jagadish...
140
Voted
CSFW
2003
IEEE
15 years 9 months ago
Identity Based Authenticated Key Agreement Protocols from Pairings
We investigate a number of issues related to identity based authenticated key agreement protocols using the Weil or Tate pairings. These issues include how to make protocols effici...
Liqun Chen, Caroline Kudla