532 search results - page 12 / 107 » Graphically abelian groups |
CANS
2008
Springer
14 years 11 months ago
2008
Springer
In the Crypto'07 paper [5], Desmedt et al. studied the problem of achieving secure n-party computation over nonAbelian groups. The function to be computed is fG(x1, . . . , x...
DM
2010
14 years 9 months ago
2010
A generalization of the Davenport constant is investigated. For a finite abelian group G and a positive integer k, let Dk(G) denote the smallest such that each sequence over G of l...
99
Voted
ANTS
2008
Springer
14 years 11 months ago
2008
Springer
In previous work, the first author developed an algorithm for the computation of Hilbert modular forms. In this paper, we extend this to all totally real number fields of even degr...
117
click to vote
RTA
2005
Springer
15 years 3 months ago
2005
Springer
Cryptographic protocols are small programs which involve a high level of concurrency and which are difficult to analyze by hand. The most successful methods to verify such protocol...
LICS
2003
IEEE
15 years 2 months ago
2003
IEEE
We present decidability results for the verification of cryptographic protocols in the presence of equational theories corresponding to xor and Abelian groups. Since the perfect ...