3938 search results - page 253 / 788 » Interactive Protocols on the Reals |
199
click to vote
ACSAC
2005
IEEE
16 years 7 days ago
2005
IEEE
Understanding the security goals provided by cryptographic protocol implementations is known to be difficult, since security requirements such as secrecy, integrity and authentici...
190
click to vote
CRYPTO
2000
Springer
15 years 11 months ago
2000
Springer
Abstract. We present a lower bound on the number of rounds required by Concurrent Zero-Knowledge proofs for languages in NP. It is shown that in the context of Concurrent Zero-Know...
196
click to vote
BIOWIRE
2007
Springer
15 years 10 months ago
2007
Springer
Chemical computing models have been proposed since the 1980ies for expressing concurrent computations in elegant ways for shared memory systems. In this paper we look at the distri...
146
click to vote
DCC
2010
IEEE
15 years 6 months ago
2010
IEEE
We investigate unconditional security for message authentication protocols that are designed using two-channel cryptography. We look at both noninteractive message authentication ...
165
click to vote
PROVSEC
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. In this paper, we study the soundness amplification by repetition of cryptographic protocols. As a tool, we use the Chernoff Information. We specify the number of attempt...