173 search results - page 5 / 35 » Efficient One-Round Key Exchange in the Standard Model |
110
click to vote
ASIACRYPT
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. We describe a public-key encryption scheme based on lattices — specifically, based on the hardness of the learning with error (LWE) problem — that is secure against ...
70
Voted
CCS
2009
ACM
15 years 4 months ago
2009
ACM
Formal analysis of security protocols based on symbolic models has been very successful in finding flaws in published protocols and proving protocols secure, using automated too...
ACNS
2005
Springer
15 years 3 months ago
2005
Springer
Typical protocols for password-based authentication assume a single server which stores all the information (e.g., the password) necessary to authenticate a user. Unfortunately, a...
CRYPTO
2010
Springer
14 years 10 months ago
2010
Springer
Secure two-party authentication and key exchange are fundamental problems. Traditionally, the parties authenticate each other by means of their identities, using a public-key infr...
CCS
2006
ACM
15 years 1 months ago
2006
ACM
We extend the definitional work of Dwork, Naor and Sahai from deniable authentication to deniable key-exchange protocols. We then use these definitions to prove the deniability fe...