154 search results - page 21 / 31 » Proving Group Protocols Secure Against Eavesdroppers |
ACNS
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. We examine the problem of message recognition by reviewing the definitions and the security model in the literature. In particular, we examine the Jane Doe protocol, whi...
107
click to vote
CSFW
2005
IEEE
15 years 3 months ago
2005
IEEE
A number of key establishment protocols claim the property of forward secrecy, where the compromise of a longterm key does not result in the compromise of previously computed sess...
ICDCS
2007
IEEE
15 years 4 months ago
2007
IEEE
Trust negotiation supports authentication and access control across multiple security domains by allowing parties to use non-forgeable digital credentials to establish trust. By t...
ASIACRYPT
2000
Springer
15 years 2 months ago
2000
Springer
A discrete-logarithm algorithm is called generic if it does not exploit the specific representation of the cyclic group for which it is supposed to compute discrete logarithms. Su...
IJACT
2010
14 years 4 months ago
2010
: We look at message recognition protocols (MRPs) and prove that there is a oneto-one correspondence between stateless non-interactive MRPs and digital signature schemes. Next, we ...