4340 search results - page 184 / 868 » Formal Methods and Cryptography |
187
click to vote
TCC
2010
Springer
15 years 9 months ago
2010
Springer
We consider message authentication codes for streams where the key becomes known only at the end of the stream. This usually happens in key-exchange protocols like SSL and TLS wher...
110
click to vote
CIE
2008
Springer
15 years 6 months ago
2008
Springer
Abstract We prove, using a non-standard complexity assumption, that any language in NP has a 1-round (that is, the verifier sends a message to the prover, and the prover sends a me...
117
click to vote
INFORMATICALT
2006
15 years 4 months ago
2006
This paper proposes a threshold key escrow scheme from pairing. It tolerates the passive adversary to access any internal data of corrupted key escrow agents and the active adversa...
115
click to vote
JOC
2002
15 years 4 months ago
2002
In theoretical cryptography, one formalizes the notion of an adversary's success probability being "too small to matter" by asking that it be a negligible function ...
135
click to vote
IJISEC
2010
15 years 2 months ago
2010
The inherent key escrow problem is one of the main reasons for the slow adoption of identity-based cryptography. The existing solution for mitigating the key escrow problem is by a...