Sciweavers

330 search results - page 1 / 66
» On the Notion of Pseudo-Free Groups
Sort
View
TCC
2004
Springer
96views Cryptology» more  TCC 2004»
13 years 10 months ago
On the Notion of Pseudo-Free Groups
We explore the notion of a pseudo-free group, first introduced by Hohenberger [Hoh03], and provide an alternative stronger definition. We show that if Z∗ n is a pseudo-free abe...
Ronald L. Rivest
EUROCRYPT
2005
Springer
13 years 10 months ago
The RSA Group is Pseudo-Free
We prove, under the strong RSA assumption, that the group of invertible integers modulo the product of two safe primes is pseudo-free. More specifically, no polynomial time algor...
Daniele Micciancio
CTRSA
2011
Springer
223views Cryptology» more  CTRSA 2011»
12 years 8 months ago
Expedient Non-malleability Notions for Hash Functions
Non-malleability of a cryptographic primitive is a fundamental security property which ensures some sort of independence of cryptographic values. The notion has been extensively st...
Paul Baecher, Marc Fischlin, Dominique Schröd...
DCC
1998
IEEE
13 years 4 months ago
Quasideterminant Characterization of MDS Group Codes over Abelian Groups
A group code defined over a group G is a subset of Gn which forms a group under componentwise group operation. The well known matrix characterization of MDS (Maximum Distance Sepa...
A. A. Zain, B. Sundar Rajan
KES
2006
Springer
13 years 4 months ago
Building common awareness in agent organizations
Groups of collaborative agents within organizations need to achieve goals creating group awareness. This is necessary for groups to act as single entities. The notion of collective...
Ioannis Partsakoulakis, George A. Vouros