36 search results - page 2 / 8 » Proof Spaces for Unbounded Parallelism |
DALT
2008
Springer
13 years 7 months ago
2008
Springer
ing and Verifying Strategy-proofness for Auction Mechanisms E. M. Tadjouddine, F. Guerin, and W. Vasconcelos Department of Computing Science, King's College, University of Abe...
CSFW
2005
IEEE
13 years 11 months ago
2005
IEEE
We develop a general method for proving properties of contract-signing protocols using a specialized protocol logic. The method is applied to the Asokan-ShoupWaidner and the Garay...
ESORICS
2008
Springer
13 years 7 months ago
2008
Springer
The Maude-NRL Protocol Analyzer (Maude-NPA) is a tool and inference system for reasoning about the security of cryptographic protocols in which the cryptosystems satisfy different ...
CRYPTO
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. We show that only languages in BPP have public-coin, blackbox zero-knowledge protocols that are secure under an unbounded (polynomial) number of parallel repetitions. Thi...
PPOPP
2010
ACM
13 years 7 months ago
2010
ACM
Helper locks allow programs with large parallel critical sections, called parallel regions, to execute more efficiently by enlisting processors that might otherwise be waiting on ...