Abstract. A randomized implementation is given of a test-and-set register with O(log logn) individual step complexity and O(n) total step complexity against an oblivious adversary. The implementation is linearizable and multi-shot, and shows an exponential complexity improvement over previous solutions designed to work against a strong adversary.
International audienceWe define a call-by-value variant of Gödel 's System T with references, and eq...
We define a call-by-value variant of G\ua8odel\u2019s System T with references, and equip it with a ...
We study the round complexity of various cryptographic protocols. Our main result is a tight lower b...
Several new and existing components and techniques are used to achieve two new results. - A obstruct...
International audienceWe study randomized test-and-set (TAS) implementations from registers in the a...
The test-and-set object is a fundamental synchronization primitive for shared memory systems. This p...
We study the time and space complexity of randomized Test-And-Set (TAS) implementations from atomic ...
Abstract. We present a deterministic obstruction-free implementation of leader election from O( n) a...
Full version - 64 pagesInternational audienceDouble Compare-And-Swap (DCAS) is a tremendously useful...
The question of how to construct optimally efficient secure protocols is a central question in crypt...
Abstract: This paper proposes a new scheme for partially blind signature based on the difficulty in ...
International audienceWe define a call-by-value variant of Gödel 's System T with references, and eq...
We define a call-by-value variant of G\ua8odel\u2019s System T with references, and equip it with a ...
We study the round complexity of various cryptographic protocols. Our main result is a tight lower b...
Several new and existing components and techniques are used to achieve two new results. - A obstruct...
International audienceWe study randomized test-and-set (TAS) implementations from registers in the a...
The test-and-set object is a fundamental synchronization primitive for shared memory systems. This p...
We study the time and space complexity of randomized Test-And-Set (TAS) implementations from atomic ...
Abstract. We present a deterministic obstruction-free implementation of leader election from O( n) a...
Full version - 64 pagesInternational audienceDouble Compare-And-Swap (DCAS) is a tremendously useful...
The question of how to construct optimally efficient secure protocols is a central question in crypt...
Abstract: This paper proposes a new scheme for partially blind signature based on the difficulty in ...
International audienceWe define a call-by-value variant of Gödel 's System T with references, and eq...
We define a call-by-value variant of G\ua8odel\u2019s System T with references, and equip it with a ...
We study the round complexity of various cryptographic protocols. Our main result is a tight lower b...
DOI
Add to ORKG