1009 search results - page 151 / 202 » Correlations of Partial Words |
ICGI
2004
Springer
15 years 3 months ago
2004
Springer
State Merging algorithms, such as Rodney Price’s EDSM (Evidence-Driven State Merging) algorithm, have been reasonably successful at solving DFA-learning problems. EDSM, however, ...
ISW
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. Chameleon signatures are based on well established hashand-sign paradigm, where a chameleon hash function is used to compute the cryptographic message digest. Chameleon s...
124
click to vote
NDSS
2000
IEEE
15 years 2 months ago
2000
IEEE
Abstract. Chameleon signatures simultaneously provide the properties of nonrepudiation and non-transferability for the signed message. However, the initial constructions of chamele...
FOCS
1999
IEEE
15 years 2 months ago
1999
IEEE
Naor and Yung show that a one-bit-compressing universal one-way hash function (UOWHF) can be constructed based on a one-way permutation. This construction can be iterated to build...
SAS
1999
Springer
15 years 2 months ago
1999
Springer
This paper describes a powerful method for dead code analysis and elimination in the presence of recursive data constructions. We describe partially dead recursive data using live...