50 search results - page 5 / 10 » Computational soundness for key exchange protocols with symm... |
102
click to vote
FC
2007
Springer
15 years 3 months ago
2007
Springer
Task-specific groups are often formed in an ad-hoc manner within big structures, like companies. Take the following typical scenario: A high rank manager decides that a task force...
87
Voted
TCC
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. We prove a computational soundness theorem for the symbolic analysis of cryptographic protocols which extends an analogous theorem of Abadi and Rogaway (J. of Cryptology ...
100
click to vote
ACMSE
2009
ACM
14 years 7 months ago
2009
ACM
Proxy re-encryption, abbreviated as PRE, is a cryptosystem which allows the proxy to re-encrypt a cirphertext without accessing the underlying message. The re-encryption protocol ...
103
click to vote
PKC
2004
Springer
15 years 2 months ago
2004
Springer
Abstract. A group key agreement protocol allows a set of users, communicating over a public network, to agree on a private session key. Most of the schemes proposed so far require ...
CRYPTO
2007
Springer
15 years 3 months ago
2007
Springer
In this paper we identify the (P, Q)-DDH assumption, as an extreme, powerful generalization of the Decisional Diffie-Hellman (DDH) assumption: virtually all previously proposed gen...