2967 search results - page 583 / 594 » Cryptology |
157
click to vote
CRYPTO
2005
Springer
15 years 11 months ago
2005
Springer
We study the question whether the sequential or parallel composition of two functions, each indistinguishable from a random function by non-adaptive distinguishers is secure agains...
146
click to vote
CRYPTO
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. We propose a way to establish peer-to-peer authenticated communications over an insecure channel by using an extra channel which can authenticate very short strings, e.g....
152
click to vote
EUROCRYPT
2005
Springer
15 years 11 months ago
2005
Springer
Biometric data offer a potential source of high-entropy, secret information that can be used in cryptographic protocols provided two issues are addressed: (1) biometric data are n...
135
click to vote
EUROCRYPT
2005
Springer
15 years 11 months ago
2005
Springer
It is a standard result in the theory of quantum error-correcting codes that no code of length n can fix more than n/4 arbitrary errors, regardless of the dimension of the coding ...
157
click to vote
EUROCRYPT
2005
Springer
15 years 11 months ago
2005
Springer
A (1,2)-robust combiner for a cryptographic primitive P is a construction that takes two candidate schemes for P and combines them into one scheme that securely implement P even i...