84 search results - page 6 / 17 » On the Security Loss in Cryptographic Reductions |
ASIACRYPT
2006
Springer
15 years 1 months ago
2006
Springer
There have been active discussions on how to derive a consistent cryptographic key from noisy data such as biometric templates, with the help of some extra information called a ske...
IFIP
2004
Springer
15 years 3 months ago
2004
Springer
This paper focuses on the usability of the PINPAS tool. The PINPAS tool is an instruction-level interpreter for smartcard assembler languages, augmented with facilities to study si...
78
Voted
CRYPTO
2008
Springer
14 years 11 months ago
2008
Springer
Despite considerable research efforts, no efficient reduction from the discrete log problem to forging a discrete log based signature (e.g. Schnorr) is currently known. In fact, ne...
117
click to vote
EUROCRYPT
2010
Springer
14 years 9 months ago
2010
Springer
We investigate the possibility to prove security of the well-known blind signature schemes by Chaum, and by Pointcheval and Stern in the standard model, i.e., without random oracle...
IACR
2011
13 years 9 months ago
2011
Given a lattice L with the i-th successive minimum λi, its i-th gap λi λ1 often provides useful information for analyzing the security of cryptographic schemes related to L. The...