Sciweavers

1834 search results - page 195 / 367
» Public Key Cryptography
Sort
View
CORR
2010
Springer
90views Education» more  CORR 2010»
13 years 7 months ago
Perfect Omniscience, Perfect Secrecy and Steiner Tree Packing
— We consider perfect secret key generation for a “pairwise independent network” model in which every pair of terminals share a random binary string, with the strings shared ...
Sirin Nitinawarat, Prakash Narayan
HICSS
2007
IEEE
157views Biometrics» more  HICSS 2007»
14 years 3 months ago
E-Government Evaluation: Reflections On Three Organisational Case Studies
The deployment of e-Government continues at a significant cost and pace in the worldwide public sector. An important area of research is that of the evaluation of e-Government. In...
Stephen Jones, Zahir Irani, Amir M. Sharif
ESWS
2010
Springer
14 years 2 months ago
Put in Your Postcode, Out Comes the Data: A Case Study
A single datum or a set of a categorical data has little value on its own. Combinations of disparate sets of data increase the value of those data sets and helps to discover intere...
Tope Omitola, Christos L. Koumenides, Igor O. Popo...
CHES
2009
Springer
150views Cryptology» more  CHES 2009»
14 years 9 months ago
An Efficient Method for Random Delay Generation in Embedded Software
Random delays are a countermeasure against a range of side channel and fault attacks that is often implemented in embedded software. We propose a new method for generation of rando...
Ilya Kizhvatov, Jean-Sébastien Coron
FSE
2009
Springer
106views Cryptology» more  FSE 2009»
14 years 9 months ago
Practical Collisions for EnRUPT
The EnRUPT hash functions were proposed by O'Neil, Nohl and Henzen [5] as candidates for the SHA-3 competition, organised by NIST [4]. The proposal contains seven concrete has...
Sebastiaan Indesteege, Bart Preneel