4212 search results - page 804 / 843 » On Compressible Pairings and Their Computation |
172
click to vote
PODC
2012
ACM
13 years 8 months ago
2012
ACM
This paper proves a necessary and sufficient condition for the existence of iterative algorithms that achieve approximate Byzantine consensus in arbitrary directed graphs, where e...
178
click to vote
ICPADS
2005
IEEE
15 years 11 months ago
2005
IEEE
Abstract. In identity-based (ID-based) cryptosystems, a local registration authority (LRA) is responsible for authentication of users while the key generation center (KGC) is respo...
145
click to vote
PODC
2010
ACM
15 years 10 months ago
2010
ACM
: The Borowsky-Gafni (BG) simulation algorithm is a powerful reduction algorithm that shows that t-resilience of decision tasks can be fully characterized in terms of wait-freedom....
181
click to vote
ACISP
2009
Springer
16 years 23 days ago
2009
Springer
Bernstein’s CubeHash is a hash function family that includes four functions submitted to the NIST Hash Competition. A CubeHash function is parametrized by a number of rounds r, a...
133
click to vote
Publication
People travel between places of residence and work destinations via transportation net-
works. The relation between selection of home and work locations has been heavily
debated ...