Sciweavers

1019 search results - page 133 / 204
» Cryptographic Design Vulnerabilities
Sort
View
CHES
1999
Springer
133views Cryptology» more  CHES 1999»
15 years 4 months ago
Random Number Generators Founded on Signal and Information Theory
The strength of a cryptographic function depends on the amount of entropy in the cryptovariables that are used as keys. Using a large key length with a strong algorithm is false co...
David Paul Maher, Robert J. Rance
EUROCRYPT
2004
Springer
15 years 3 months ago
Anonymous Identification in Ad Hoc Groups
We introduce Ad Hoc Anonymous Identification schemes, a new multi-user cryptographic primitive that allows participants from a user population to form ad hoc groups, and then prove...
Yevgeniy Dodis, Aggelos Kiayias, Antonio Nicolosi,...
DGO
2007
174views Education» more  DGO 2007»
15 years 1 months ago
New techniques for ensuring the long term integrity of digital archives
A large portion of the government, business, cultural, and scientific digital data being created today needs to be archived and preserved for future use of periods ranging from a ...
Sangchul Song, Joseph JáJá
APLAS
2010
ACM
15 years 3 days ago
Typechecking Higher-Order Security Libraries
Abstract. We propose a flexible method for verifying the security of ML programs that use cryptography and recursive data structures. Our main applications are X.509 certificate ch...
Karthikeyan Bhargavan, Cédric Fournet, Nata...
COMPSEC
2004
131views more  COMPSEC 2004»
14 years 11 months ago
Biometric random number generators
Abstract Up to now biometric methods have been used in cryptography for authentication purposes. In this paper we propose to use biological data for generating sequences of random ...
Janusz Szczepanski, Elek Wajnryb, José M. A...