121 search results - page 22 / 25 » Identity-based key agreement protocols from pairings |
CORR
2011
Springer
14 years 3 months ago
2011
Springer
In studying how to communicate over a public channel with an active adversary, Dodis and Wichs introduced the notion of a non-malleable extractor. A non-malleable extractor dramat...
CN
2004
14 years 11 months ago
2004
In secure group communications, a key server can deliver a "grouporiented" rekey message [22] to a large number of users efficiently using multicast. For reliable delive...
SIGCOMM
1997
ACM
15 years 3 months ago
1997
ACM
As multicast applications are deployed for mainstream use, the need to secure multicast communications will become critical. Multicast, however, does not t the point-to-point mod...
ACNS
2008
Springer
15 years 1 months ago
2008
Springer
The conjugacy search problem in a group G is the problem of recovering an x G from given g G and h = x-1 gx. The alleged computational hardness of this problem in some groups was...
100
click to vote
EUROCRYPT
2005
Springer
15 years 5 months ago
2005
Springer
A (1,2)-robust combiner for a cryptographic primitive P is a construction that takes two candidate schemes for P and combines them into one scheme that securely implement P even i...