2200 search results - page 20 / 440 » Bloch's Constant is Computable |
PODC
2010
ACM
15 years 1 months ago
2010
ACM
We study Reader-Writer Exclusion [1], a well-known variant of the Mutual Exclusion problem [2] where processes are divided into two classes–readers and writers–and multiple re...
ISW
2005
Springer
15 years 3 months ago
2005
Springer
We present a fully symmetric constant round authenticated group key agreement protocol in dynamic scenario. Our proposed scheme achieves forward secrecy and is provably secure und...
ICANN
2001
Springer
15 years 2 months ago
2001
Springer
Abstract. It has remained an open question whether there exist product unit networks with constant depth that have superlinear VC dimension. In this paper we give an answer by cons...
AFRICACRYPT
2008
Springer
14 years 11 months ago
2008
Springer
Proof-of-work schemes are economic measures to deter denial-of-service attacks: service requesters compute moderately hard functions the results of which are easy to check by the ...
FC
2003
Springer
15 years 3 months ago
2003
Springer
Abstract. We present a new cryptographic auction protocol that prevents extraction of bid information despite any collusion of participants. This requirement is stronger than commo...