2492 search results - page 206 / 499 » On the General Signature Trees |
151
click to vote
RSA
2006
15 years 6 months ago
2006
Following the entropy method this paper presents general concentration inequalities, which can be applied to combinatorial optimization and empirical processes. The inequalities g...
166
click to vote
WWW
2005
ACM
16 years 7 months ago
2005
ACM
Being able to determine the provenience of statements is a fundamental step in any SW trust modeling. We propose a methodology that allows signing of small groups of RDF statement...
178
click to vote
STOC
2002
ACM
16 years 6 months ago
2002
ACM
A fundamental problem of distributed computing is that of simulating a secure broadcast channel, within the setting of a point-to-point network. This problem is known as Byzantine...
112
click to vote
PERCOM
2004
ACM
16 years 6 months ago
2004
ACM
There is generally no a priori trust relationship among entities interacting in pervasive computing environments which makes it necessary to establish trust from scratch. This tas...
142
click to vote
IMA
2009
Springer
16 years 1 months ago
2009
Springer
In previous work we showed how to compress certain prime-order subgroups of the cyclotomic subgroups of orders 22m + 1 of the multiplicative groups of F∗ 24m by a factor of 4. We...