Sciweavers

121 search results - page 22 / 25
» Identity-based key agreement protocols from pairings
Sort
View
CORR
2011
Springer
143views Education» more  CORR 2011»
12 years 11 months ago
Non-malleable extractors via character sums
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...
Trevor D. Wooley, David Zuckerman
CN
2004
122views more  CN 2004»
13 years 7 months ago
Group rekeying with limited unicast recovery
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...
X. Brian Zhang, Simon S. Lam, Dong-Young Lee
SIGCOMM
1997
ACM
13 years 11 months ago
Iolus: A Framework for Scalable Secure Multicasting
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...
Suvo Mittra
ACNS
2008
Springer
94views Cryptology» more  ACNS 2008»
13 years 9 months ago
An Authentication Scheme Based on the Twisted Conjugacy Problem
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...
Vladimir Shpilrain, Alexander Ushakov
EUROCRYPT
2005
Springer
14 years 26 days ago
On Robust Combiners for Oblivious Transfer and Other Primitives
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...
Danny Harnik, Joe Kilian, Moni Naor, Omer Reingold...