1401 search results - page 168 / 281 » Randomness in Interactive Proofs |
EUROCRYPT
2000
Springer
15 years 1 months ago
2000
Springer
Abstract. When designing password-authenticated key exchange protocols (as opposed to key exchange protocols authenticated using cryptographically secure keys), one must not allow ...
CARDIS
2010
Springer
15 years 1 months ago
2010
Springer
This paper establishes a novel model for RFID schemes where readers are not continuously connected to the back office, but only periodically. Furthermore, adversaries are not only ...
APLAS
2008
ACM
14 years 12 months ago
2008
ACM
Abstract. We study the problem of generating a test sequence that achieves maximal coverage for a reactive system under test. We formulate the problem as a repeated game between th...
ICALP
2010
Springer
14 years 12 months ago
2010
Springer
Given a connected graph G and a failure probability pe for each edge e in G, the reliability of G is the probability that G remains connected when each edge e is removed independe...
CCS
2008
ACM
14 years 12 months ago
2008
ACM
The Unified Model (UM) key agreement protocol is an efficient Diffie-Hellman scheme that has been included in many cryptographic standards, most recently in the NIST SP 80056A sta...