Sciweavers

40 search results - page 8 / 8
» Constant Round Dynamic Group Key Agreement
Sort
View
CORR
2006
Springer
114views Education» more  CORR 2006»
13 years 5 months ago
A New Cryptosystem Based On Hidden Order Groups
Let G1 be a cyclic multiplicative group of order n. It is known that the Diffie-Hellman problem is random self-reducible in G1 with respect to a fixed generator g if (n) is known....
Amitabh Saxena, Ben Soh
CORR
2011
Springer
143views Education» more  CORR 2011»
12 years 9 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
CEC
2009
IEEE
13 years 8 months ago
The coevolution of loyalty and cooperation
— Humans are inclined to engage in long-lasting relationships whose stability does not only rely on cooperation, but often also on loyalty — our tendency to keep interacting wi...
Sven Van Segbroeck, Francisco C. Santos, Ann Now&e...
ISCAS
2008
IEEE
100views Hardware» more  ISCAS 2008»
13 years 11 months ago
On the security of a class of image encryption schemes
— Recently four chaos-based image encryption schemes were proposed. Essentially, the four schemes can be classified into one class, which is composed of two basic parts: permuta...
Chengqing Li, Guanrong Chen
AICT
2010
IEEE
240views Communications» more  AICT 2010»
12 years 9 months ago
Providing Security in 4G Systems: Unveiling the Challenges
— Several research groups are working on designing new security architectures for 4G networks such as Hokey and Y-Comm. Since designing an efficient security module requires a cl...
Mahdi Aiash, Glenford E. Mapp, Aboubaker Lasebae, ...