2967 search results - page 176 / 594 » Cryptology |
157
click to vote
CRYPTO
2001
Springer
15 years 11 months ago
2001
Springer
The public-key model for interactive proofs has proved to be quite effective in improving protocol efficiency [CGGM00]. We argue, however, that its soundness notion is more subtle...
192
click to vote
EUROCRYPT
2001
Springer
15 years 11 months ago
2001
Springer
Message integrity from one sender to one receiver is typically achieved by having the two parties share a secret key to compute a Message Authentication Code (MAC). We consider the...
196
click to vote
EUROCRYPT
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. Known practical blind signature schemes whose security against adaptive and parallel attacks can be proven in the random oracle model either need five data exchanges bet...
169
click to vote
EUROCRYPT
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. We provide identi£cation protocols that are secure even when the adversary can reset the internal state and/or randomization source of the user identifying itself, and w...
179
click to vote
EUROCRYPT
2001
Springer
15 years 11 months ago
2001
Springer
In this paper we show how to convert a statistically binding but computationally concealing quantum bit commitment scheme into a computationally binding but statistically concealin...