Sciweavers

920 search results - page 89 / 184
» Selecting Secure Passwords
Sort
View
ICICS
2009
Springer
14 years 4 months ago
Design of Reliable and Secure Multipliers by Multilinear Arithmetic Codes
Abstract. We propose an efficient technique for the detection of errors in cryptographic circuits introduced by strong adversaries. Previously a number of linear and nonlinear err...
Zhen Wang, Mark G. Karpovsky, Berk Sunar, Ajay Jos...
IOLTS
2005
IEEE
120views Hardware» more  IOLTS 2005»
14 years 3 months ago
Side-Channel Issues for Designing Secure Hardware Implementations
Selecting a strong cryptographic algorithm makes no sense if the information leaks out of the device through sidechannels. Sensitive information, such as secret keys, can be obtai...
Lejla Batina, Nele Mentens, Ingrid Verbauwhede
SCN
2010
Springer
116views Communications» more  SCN 2010»
13 years 8 months ago
Provably Secure Convertible Undeniable Signatures with Unambiguity
Abstract. This paper shows some efficient and provably-secure convertible undeniable signature schemes (with both selective conversion and all conversion), in the standard model an...
Le Trieu Phong, Kaoru Kurosawa, Wakaha Ogata
IMCS
2007
144views more  IMCS 2007»
13 years 9 months ago
On the imbalance of the security problem space and its expected consequences
Purpose – This paper aims to report on the results of an analysis of the computer security problem space, to suggest the areas with highest potential for making progress in the ...
Konstantin Beznosov, Olga Beznosova
TRIDENTCOM
2010
IEEE
13 years 7 months ago
G-Lab Deep: Cross-Layer Composition and Security for a Flexible Future Internet
The Internet enables the way how global businesses and communities communicate today. In the last years, however, new demands have collided with old designs, resulting in a complex...
Carsten Schmoll, Christian Henke, Dirk Hoffstadt, ...